./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:18:08,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:18:08,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:18:08,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:18:08,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:18:08,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:18:08,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:18:08,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:18:08,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:18:08,119 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:18:08,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:18:08,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:18:08,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:18:08,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:18:08,122 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:18:08,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:18:08,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:18:08,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:18:08,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:18:08,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:18:08,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:18:08,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:18:08,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:18:08,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:18:08,126 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:18:08,127 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:18:08,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:18:08,127 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:18:08,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:18:08,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:18:08,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:18:08,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:18:08,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:18:08,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:18:08,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:18:08,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:18:08,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:18:08,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:18:08,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:18:08,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:18:08,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:18:08,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:18:08,130 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf [2024-10-11 11:18:08,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:18:08,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:18:08,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:18:08,365 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:18:08,365 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:18:08,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i [2024-10-11 11:18:09,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:18:09,843 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:18:09,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i [2024-10-11 11:18:09,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cc00c58ab/62562da787274129be1340d59932212d/FLAG688deea85 [2024-10-11 11:18:09,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cc00c58ab/62562da787274129be1340d59932212d [2024-10-11 11:18:09,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:18:09,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:18:09,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:18:09,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:18:09,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:18:09,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:18:09" (1/1) ... [2024-10-11 11:18:09,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@241b6029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:09, skipping insertion in model container [2024-10-11 11:18:09,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:18:09" (1/1) ... [2024-10-11 11:18:09,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:18:10,063 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i[916,929] [2024-10-11 11:18:10,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:18:10,141 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:18:10,151 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i[916,929] [2024-10-11 11:18:10,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:18:10,207 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:18:10,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:10 WrapperNode [2024-10-11 11:18:10,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:18:10,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:18:10,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:18:10,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:18:10,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:10" (1/1) ... [2024-10-11 11:18:10,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:10" (1/1) ... [2024-10-11 11:18:10,259 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-10-11 11:18:10,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:18:10,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:18:10,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:18:10,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:18:10,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:10" (1/1) ... [2024-10-11 11:18:10,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:10" (1/1) ... [2024-10-11 11:18:10,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:10" (1/1) ... [2024-10-11 11:18:10,312 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:18:10,313 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:10" (1/1) ... [2024-10-11 11:18:10,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:10" (1/1) ... [2024-10-11 11:18:10,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:10" (1/1) ... [2024-10-11 11:18:10,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:10" (1/1) ... [2024-10-11 11:18:10,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:10" (1/1) ... [2024-10-11 11:18:10,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:10" (1/1) ... [2024-10-11 11:18:10,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:18:10,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:18:10,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:18:10,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:18:10,347 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:10" (1/1) ... [2024-10-11 11:18:10,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:18:10,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:18:10,387 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:18:10,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:18:10,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:18:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:18:10,429 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:18:10,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:18:10,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:18:10,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:18:10,510 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:18:10,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:18:10,869 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 11:18:10,869 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:18:10,923 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:18:10,923 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:18:10,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:18:10 BoogieIcfgContainer [2024-10-11 11:18:10,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:18:10,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:18:10,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:18:10,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:18:10,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:18:09" (1/3) ... [2024-10-11 11:18:10,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1532e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:18:10, skipping insertion in model container [2024-10-11 11:18:10,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:18:10" (2/3) ... [2024-10-11 11:18:10,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1532e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:18:10, skipping insertion in model container [2024-10-11 11:18:10,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:18:10" (3/3) ... [2024-10-11 11:18:10,932 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-51.i [2024-10-11 11:18:10,946 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:18:10,946 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:18:11,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:18:11,014 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5241715e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:18:11,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:18:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 11:18:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 11:18:11,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:18:11,040 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:18:11,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:18:11,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:18:11,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1230719355, now seen corresponding path program 1 times [2024-10-11 11:18:11,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:18:11,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879222295] [2024-10-11 11:18:11,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:18:11,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:18:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:18:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:18:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:18:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:18:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:18:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:18:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:18:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:18:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:18:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:18:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:18:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:18:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:18:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:18:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:18:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:18:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:18:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:18:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:18:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:18:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:18:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:18:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:18:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:18:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:18:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:18:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:18:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 11:18:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:18:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:18:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:18:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:18:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 11:18:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:18:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879222295] [2024-10-11 11:18:11,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879222295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:18:11,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:18:11,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:18:11,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752813976] [2024-10-11 11:18:11,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:18:11,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:18:11,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:18:11,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:18:11,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:18:11,487 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 11:18:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:18:11,567 INFO L93 Difference]: Finished difference Result 173 states and 314 transitions. [2024-10-11 11:18:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:18:11,575 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 199 [2024-10-11 11:18:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:18:11,583 INFO L225 Difference]: With dead ends: 173 [2024-10-11 11:18:11,583 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 11:18:11,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:18:11,589 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:18:11,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:18:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 11:18:11,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 11:18:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 11:18:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 137 transitions. [2024-10-11 11:18:11,626 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 137 transitions. Word has length 199 [2024-10-11 11:18:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:18:11,626 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 137 transitions. [2024-10-11 11:18:11,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 11:18:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 137 transitions. [2024-10-11 11:18:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 11:18:11,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:18:11,630 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:18:11,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:18:11,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:18:11,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:18:11,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1349404215, now seen corresponding path program 1 times [2024-10-11 11:18:11,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:18:11,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684604851] [2024-10-11 11:18:11,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:18:11,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:18:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:18:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:18:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:18:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:18:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:18:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:18:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:18:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:18:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:18:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:18:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:18:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:18:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:18:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:18:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:18:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:18:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:18:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:18:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:18:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:18:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:18:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:18:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:18:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:18:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:18:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:18:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:18:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 11:18:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:18:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:18:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:18:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:18:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 11:18:12,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:18:12,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684604851] [2024-10-11 11:18:12,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684604851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:18:12,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:18:12,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:18:12,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007156224] [2024-10-11 11:18:12,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:18:12,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:18:12,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:18:12,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:18:12,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:18:12,441 INFO L87 Difference]: Start difference. First operand 86 states and 137 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 11:18:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:18:12,642 INFO L93 Difference]: Finished difference Result 256 states and 409 transitions. [2024-10-11 11:18:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:18:12,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2024-10-11 11:18:12,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:18:12,649 INFO L225 Difference]: With dead ends: 256 [2024-10-11 11:18:12,649 INFO L226 Difference]: Without dead ends: 171 [2024-10-11 11:18:12,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:18:12,652 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 69 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:18:12,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 348 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:18:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-11 11:18:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2024-10-11 11:18:12,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 11:18:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 268 transitions. [2024-10-11 11:18:12,682 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 268 transitions. Word has length 199 [2024-10-11 11:18:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:18:12,687 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 268 transitions. [2024-10-11 11:18:12,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 11:18:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 268 transitions. [2024-10-11 11:18:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 11:18:12,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:18:12,691 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:18:12,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:18:12,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:18:12,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:18:12,691 INFO L85 PathProgramCache]: Analyzing trace with hash -69540537, now seen corresponding path program 1 times [2024-10-11 11:18:12,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:18:12,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656474675] [2024-10-11 11:18:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:18:12,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:18:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:18:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:18:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:18:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:18:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:18:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:18:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:18:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:18:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:18:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:18:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:18:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:18:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:18:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:18:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:18:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:18:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:18:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:18:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:18:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:18:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:18:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:18:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:18:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:18:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:18:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:18:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:18:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 11:18:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:18:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:18:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:18:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:18:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 11:18:13,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:18:13,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656474675] [2024-10-11 11:18:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656474675] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:18:13,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442736313] [2024-10-11 11:18:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:18:13,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:18:13,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:18:13,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:18:13,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:18:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:13,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:18:13,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:18:13,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2024-10-11 11:18:13,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:18:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 11:18:13,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442736313] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:18:13,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:18:13,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 11:18:13,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804173092] [2024-10-11 11:18:13,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:18:13,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:18:13,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:18:13,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:18:13,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:18:13,784 INFO L87 Difference]: Start difference. First operand 169 states and 268 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-10-11 11:18:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:18:14,007 INFO L93 Difference]: Finished difference Result 353 states and 549 transitions. [2024-10-11 11:18:14,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:18:14,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 199 [2024-10-11 11:18:14,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:18:14,012 INFO L225 Difference]: With dead ends: 353 [2024-10-11 11:18:14,014 INFO L226 Difference]: Without dead ends: 185 [2024-10-11 11:18:14,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 457 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:18:14,016 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:18:14,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 226 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:18:14,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-11 11:18:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2024-10-11 11:18:14,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 11:18:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 272 transitions. [2024-10-11 11:18:14,047 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 272 transitions. Word has length 199 [2024-10-11 11:18:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:18:14,048 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 272 transitions. [2024-10-11 11:18:14,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-10-11 11:18:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 272 transitions. [2024-10-11 11:18:14,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 11:18:14,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:18:14,050 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:18:14,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:18:14,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:18:14,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:18:14,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:18:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1080657787, now seen corresponding path program 1 times [2024-10-11 11:18:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:18:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758552215] [2024-10-11 11:18:14,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:18:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:18:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:18:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:18:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:18:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:18:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:18:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:18:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:18:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:18:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:18:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:18:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:18:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:18:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:18:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:18:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:18:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:18:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:18:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:18:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:18:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:18:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:18:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:18:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:18:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:18:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:18:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:18:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:18:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 11:18:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:18:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:18:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:18:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:18:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 11:18:14,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:18:14,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758552215] [2024-10-11 11:18:14,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758552215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:18:14,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:18:14,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:18:14,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515670219] [2024-10-11 11:18:14,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:18:14,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:18:14,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:18:14,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:18:14,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:18:14,829 INFO L87 Difference]: Start difference. First operand 177 states and 272 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 11:18:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:18:15,055 INFO L93 Difference]: Finished difference Result 356 states and 549 transitions. [2024-10-11 11:18:15,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:18:15,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2024-10-11 11:18:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:18:15,059 INFO L225 Difference]: With dead ends: 356 [2024-10-11 11:18:15,061 INFO L226 Difference]: Without dead ends: 267 [2024-10-11 11:18:15,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:18:15,062 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 184 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:18:15,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 471 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:18:15,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-11 11:18:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 177. [2024-10-11 11:18:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 11:18:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 272 transitions. [2024-10-11 11:18:15,094 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 272 transitions. Word has length 199 [2024-10-11 11:18:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:18:15,095 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 272 transitions. [2024-10-11 11:18:15,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 11:18:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 272 transitions. [2024-10-11 11:18:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 11:18:15,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:18:15,097 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:18:15,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:18:15,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:18:15,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:18:15,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1911793355, now seen corresponding path program 1 times [2024-10-11 11:18:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:18:15,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243554347] [2024-10-11 11:18:15,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:18:15,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:18:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:18:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:18:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:18:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:18:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:18:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:18:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:18:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:18:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:18:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:18:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:18:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:18:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:18:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:18:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:18:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:18:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:18:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:18:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:18:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:18:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:18:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:18:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:18:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:18:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:18:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:18:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:18:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 11:18:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:18:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:18:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:18:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:18:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 11:18:15,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:18:15,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243554347] [2024-10-11 11:18:15,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243554347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:18:15,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:18:15,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:18:15,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021963032] [2024-10-11 11:18:15,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:18:15,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:18:15,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:18:15,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:18:15,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:18:15,547 INFO L87 Difference]: Start difference. First operand 177 states and 272 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 11:18:15,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:18:15,881 INFO L93 Difference]: Finished difference Result 518 states and 787 transitions. [2024-10-11 11:18:15,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:18:15,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 200 [2024-10-11 11:18:15,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:18:15,885 INFO L225 Difference]: With dead ends: 518 [2024-10-11 11:18:15,885 INFO L226 Difference]: Without dead ends: 429 [2024-10-11 11:18:15,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:18:15,886 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 172 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:18:15,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 431 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:18:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-11 11:18:15,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 362. [2024-10-11 11:18:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 223 states have (on average 1.3139013452914798) internal successors, (293), 223 states have internal predecessors, (293), 128 states have call successors, (128), 10 states have call predecessors, (128), 10 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-11 11:18:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 549 transitions. [2024-10-11 11:18:15,934 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 549 transitions. Word has length 200 [2024-10-11 11:18:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:18:15,935 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 549 transitions. [2024-10-11 11:18:15,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 11:18:15,935 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 549 transitions. [2024-10-11 11:18:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 11:18:15,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:18:15,937 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:18:15,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:18:15,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:18:15,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:18:15,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1615696844, now seen corresponding path program 1 times [2024-10-11 11:18:15,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:18:15,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546220533] [2024-10-11 11:18:15,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:18:15,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:18:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:18:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:18:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:18:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:18:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:18:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:18:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:18:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:18:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:18:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:18:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:18:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:18:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:18:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:18:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:18:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:18:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:18:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:18:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:18:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:18:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:18:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:18:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:18:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:18:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:18:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:18:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:18:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 11:18:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:18:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:18:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:18:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:18:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 11:18:16,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:18:16,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546220533] [2024-10-11 11:18:16,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546220533] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:18:16,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818296651] [2024-10-11 11:18:16,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:18:16,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:18:16,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:18:16,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:18:16,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:18:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:18:16,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 11:18:16,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:18:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 1168 trivial. 0 not checked. [2024-10-11 11:18:17,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:19:11,276 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_~var_1_30~0 65536)) (.cse5 (mod c_~var_1_29~0 65536)) (.cse4 (* c_~last_1_var_1_33~0 65535))) (and (or (let ((.cse1 (mod (+ c_~var_1_29~0 .cse4) 65536))) (and (forall ((~var_1_6~0 Int)) (let ((.cse0 (* c_~var_1_1~0 ~var_1_6~0))) (or (not (= (mod .cse0 64) 0)) (< 0 (+ .cse1 (div .cse0 64)))))) (forall ((~var_1_6~0 Int)) (let ((.cse2 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse1 (div .cse2 64) 1)) (= (mod .cse2 64) 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse3 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse1 (div .cse3 64))) (< .cse3 0)))))) (< .cse5 (+ .cse6 1))) (or (< .cse6 .cse5) (let ((.cse7 (mod (+ c_~var_1_30~0 .cse4) 65536))) (and (forall ((~var_1_6~0 Int)) (let ((.cse8 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse7 (div .cse8 64))) (< .cse8 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse9 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse7 (div .cse9 64) 1)) (= (mod .cse9 64) 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse10 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse7 (div .cse10 64))) (not (= (mod .cse10 64) 0)))))))))) is different from false [2024-10-11 11:19:11,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818296651] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:19:11,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:19:11,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14] total 20 [2024-10-11 11:19:11,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19908432] [2024-10-11 11:19:11,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:19:11,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 11:19:11,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:19:11,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 11:19:11,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=379, Unknown=12, NotChecked=40, Total=506 [2024-10-11 11:19:11,530 INFO L87 Difference]: Start difference. First operand 362 states and 549 transitions. Second operand has 20 states, 20 states have (on average 4.8) internal successors, (96), 19 states have internal predecessors, (96), 6 states have call successors, (64), 5 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) [2024-10-11 11:19:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:19:13,655 INFO L93 Difference]: Finished difference Result 993 states and 1473 transitions. [2024-10-11 11:19:13,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 11:19:13,657 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 19 states have internal predecessors, (96), 6 states have call successors, (64), 5 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) Word has length 200 [2024-10-11 11:19:13,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:19:13,661 INFO L225 Difference]: With dead ends: 993 [2024-10-11 11:19:13,661 INFO L226 Difference]: Without dead ends: 632 [2024-10-11 11:19:13,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 53.8s TimeCoverageRelationStatistics Valid=385, Invalid=1413, Unknown=12, NotChecked=82, Total=1892 [2024-10-11 11:19:13,665 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 464 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:19:13,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 833 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 11:19:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-10-11 11:19:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 461. [2024-10-11 11:19:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 283 states have (on average 1.2756183745583038) internal successors, (361), 283 states have internal predecessors, (361), 160 states have call successors, (160), 17 states have call predecessors, (160), 17 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-11 11:19:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 681 transitions. [2024-10-11 11:19:13,722 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 681 transitions. Word has length 200 [2024-10-11 11:19:13,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:19:13,723 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 681 transitions. [2024-10-11 11:19:13,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.8) internal successors, (96), 19 states have internal predecessors, (96), 6 states have call successors, (64), 5 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) [2024-10-11 11:19:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 681 transitions. [2024-10-11 11:19:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 11:19:13,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:19:13,726 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:19:13,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 11:19:13,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:19:13,927 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:19:13,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:19:13,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1708373451, now seen corresponding path program 1 times [2024-10-11 11:19:13,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:19:13,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116474669] [2024-10-11 11:19:13,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:13,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:19:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:19:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:19:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:19:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 11:19:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:19:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:19:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:19:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:19:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:19:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:19:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:19:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:19:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:19:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:19:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:19:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:19:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:19:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:19:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:19:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:19:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:19:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:19:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:19:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:19:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:19:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:19:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:19:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 11:19:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:19:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 11:19:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 11:19:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 11:19:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 11:19:14,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:19:14,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116474669] [2024-10-11 11:19:14,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116474669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:19:14,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:19:14,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:19:14,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541646357] [2024-10-11 11:19:14,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:19:14,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:19:14,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:19:14,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:19:14,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:19:14,439 INFO L87 Difference]: Start difference. First operand 461 states and 681 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 11:19:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:19:15,009 INFO L93 Difference]: Finished difference Result 637 states and 943 transitions. [2024-10-11 11:19:15,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:19:15,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 200 [2024-10-11 11:19:15,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:19:15,017 INFO L225 Difference]: With dead ends: 637 [2024-10-11 11:19:15,017 INFO L226 Difference]: Without dead ends: 548 [2024-10-11 11:19:15,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:19:15,018 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 265 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:19:15,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 260 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:19:15,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-11 11:19:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 280. [2024-10-11 11:19:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 170 states have (on average 1.2352941176470589) internal successors, (210), 170 states have internal predecessors, (210), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 11:19:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 402 transitions. [2024-10-11 11:19:15,068 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 402 transitions. Word has length 200 [2024-10-11 11:19:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:19:15,069 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 402 transitions. [2024-10-11 11:19:15,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 11:19:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 402 transitions. [2024-10-11 11:19:15,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 11:19:15,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:19:15,072 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:19:15,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 11:19:15,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:19:15,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:19:15,073 INFO L85 PathProgramCache]: Analyzing trace with hash -167325496, now seen corresponding path program 1 times [2024-10-11 11:19:15,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:19:15,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104343587] [2024-10-11 11:19:15,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:15,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:19:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:19:15,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287719236] [2024-10-11 11:19:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:15,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:19:15,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:19:15,273 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:19:15,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 11:19:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:19:15,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:19:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:19:15,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:19:15,630 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:19:15,632 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:19:15,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 11:19:15,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:19:15,836 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:19:15,946 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:19:15,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:19:15 BoogieIcfgContainer [2024-10-11 11:19:15,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:19:15,950 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:19:15,950 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:19:15,950 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:19:15,951 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:18:10" (3/4) ... [2024-10-11 11:19:15,952 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:19:15,953 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:19:15,954 INFO L158 Benchmark]: Toolchain (without parser) took 66081.48ms. Allocated memory was 130.0MB in the beginning and 297.8MB in the end (delta: 167.8MB). Free memory was 59.0MB in the beginning and 213.5MB in the end (delta: -154.5MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-10-11 11:19:15,954 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 91.6MB in the beginning and 91.5MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:19:15,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.58ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 58.7MB in the beginning and 127.0MB in the end (delta: -68.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-10-11 11:19:15,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.03ms. Allocated memory is still 169.9MB. Free memory was 127.0MB in the beginning and 121.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:19:15,955 INFO L158 Benchmark]: Boogie Preprocessor took 80.99ms. Allocated memory is still 169.9MB. Free memory was 121.7MB in the beginning and 112.1MB in the end (delta: 9.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:19:15,955 INFO L158 Benchmark]: RCFGBuilder took 578.18ms. Allocated memory is still 169.9MB. Free memory was 112.1MB in the beginning and 130.6MB in the end (delta: -18.5MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-10-11 11:19:15,955 INFO L158 Benchmark]: TraceAbstraction took 65023.40ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 129.6MB in the beginning and 213.5MB in the end (delta: -83.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-11 11:19:15,955 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 297.8MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:19:15,956 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 91.6MB in the beginning and 91.5MB in the end (delta: 140.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.58ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 58.7MB in the beginning and 127.0MB in the end (delta: -68.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.03ms. Allocated memory is still 169.9MB. Free memory was 127.0MB in the beginning and 121.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.99ms. Allocated memory is still 169.9MB. Free memory was 121.7MB in the beginning and 112.1MB in the end (delta: 9.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 578.18ms. Allocated memory is still 169.9MB. Free memory was 112.1MB in the beginning and 130.6MB in the end (delta: -18.5MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * TraceAbstraction took 65023.40ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 129.6MB in the beginning and 213.5MB in the end (delta: -83.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 297.8MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 198, overapproximation of someBinaryDOUBLEComparisonOperation at line 198, overapproximation of someUnaryDOUBLEoperation at line 23. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 0; [L23] float var_1_3 = -0.1; [L24] float var_1_4 = 127.25; [L25] float var_1_5 = 2.75; [L26] signed char var_1_6 = 1; [L27] signed char var_1_7 = -2; [L28] signed char var_1_8 = 25; [L29] signed char var_1_9 = 32; [L30] signed char var_1_11 = 0; [L31] signed long int var_1_12 = 2; [L32] unsigned long int var_1_13 = 256; [L33] unsigned long int var_1_16 = 3775050608; [L34] unsigned char var_1_18 = 16; [L35] unsigned char var_1_19 = 100; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_21 = 0; [L38] unsigned char var_1_22 = 0; [L39] unsigned char var_1_23 = 4; [L40] unsigned char var_1_24 = 32; [L41] unsigned char var_1_25 = 16; [L42] unsigned char var_1_26 = 32; [L43] unsigned char var_1_27 = 0; [L44] unsigned short int var_1_28 = 4; [L45] unsigned short int var_1_29 = 38930; [L46] unsigned short int var_1_30 = 59162; [L47] unsigned short int var_1_31 = 1; [L48] unsigned short int var_1_32 = 30817; [L49] unsigned long int var_1_33 = 50; [L50] double var_1_34 = 50.25; [L51] double var_1_35 = 10000000000000.75; [L52] unsigned long int last_1_var_1_13 = 256; [L53] unsigned short int last_1_var_1_31 = 1; [L54] unsigned long int last_1_var_1_33 = 50; [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L193] last_1_var_1_13 = var_1_13 [L194] last_1_var_1_31 = var_1_31 [L195] last_1_var_1_33 = var_1_33 [L205] RET updateLastVariables() [L206] CALL updateVariables() [L141] var_1_3 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L142] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_4=509/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L143] var_1_4 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L144] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_5=11/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L145] var_1_5 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L146] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L147] var_1_6 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L148] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L149] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L149] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=25, var_1_9=32] [L150] var_1_8 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L151] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L152] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L152] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=0, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L153] var_1_11 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_11 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L154] RET assume_abort_if_not(var_1_11 >= -126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L155] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L155] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=3775050608, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L156] var_1_16 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_16 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L157] RET assume_abort_if_not(var_1_16 >= 2147483647) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L158] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L158] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=100, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L159] var_1_19 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L160] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L161] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L161] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L162] var_1_21 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L163] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L164] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L164] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=32, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L165] var_1_24 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L166] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L167] CALL assume_abort_if_not(var_1_24 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L167] RET assume_abort_if_not(var_1_24 <= 64) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=16, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L168] var_1_25 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L169] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L170] CALL assume_abort_if_not(var_1_25 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L170] RET assume_abort_if_not(var_1_25 <= 63) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=32, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L171] var_1_26 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_26 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L172] RET assume_abort_if_not(var_1_26 >= 31) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L173] CALL assume_abort_if_not(var_1_26 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L173] RET assume_abort_if_not(var_1_26 <= 64) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=0, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L174] var_1_27 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L175] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L176] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L176] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=38930, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L177] var_1_29 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L178] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L179] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L179] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=59162, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L180] var_1_30 = __VERIFIER_nondet_ushort() [L181] CALL assume_abort_if_not(var_1_30 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L181] RET assume_abort_if_not(var_1_30 >= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L182] CALL assume_abort_if_not(var_1_30 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L182] RET assume_abort_if_not(var_1_30 <= 65534) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=30817, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L183] var_1_32 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_32 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L184] RET assume_abort_if_not(var_1_32 >= 16384) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L185] CALL assume_abort_if_not(var_1_32 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L185] RET assume_abort_if_not(var_1_32 <= 32767) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_34=201/4, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L186] var_1_34 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_34 >= -922337.2036854776000e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L187] RET assume_abort_if_not((var_1_34 >= -922337.2036854776000e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_35=40000000000003/4, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L188] var_1_35 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L189] RET assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L190] CALL assume_abort_if_not(var_1_35 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L190] RET assume_abort_if_not(var_1_35 != 0.0F) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=4, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L206] RET updateVariables() [L207] CALL step() [L58] COND FALSE !(last_1_var_1_13 > ((((last_1_var_1_31) > (var_1_16)) ? (last_1_var_1_31) : (var_1_16)))) [L61] var_1_28 = (var_1_25 + var_1_19) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L63] COND FALSE !((- var_1_3) <= (var_1_4 - var_1_5)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=-2, var_1_8=-127, var_1_9=32] [L70] COND TRUE var_1_4 != var_1_5 [L71] var_1_7 = var_1_6 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=16, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L75] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L76] COND FALSE !(var_1_18 > ((32u / var_1_16) + 32u)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=4, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L79] COND FALSE !(\read(var_1_21)) [L82] var_1_23 = var_1_27 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=1, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L84] COND TRUE var_1_5 <= (- ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) [L85] var_1_31 = ((25454 + var_1_32) - var_1_1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L89] unsigned short int stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_2=41838, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L90] COND FALSE !(stepLocal_2 == var_1_11) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L97] COND TRUE (var_1_31 / var_1_16) <= var_1_28 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L98] COND TRUE var_1_28 <= var_1_18 [L99] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L102] unsigned char stepLocal_1 = var_1_20; [L103] unsigned char stepLocal_0 = var_1_22; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_0=0, stepLocal_1=0, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L104] COND FALSE !(var_1_22 || stepLocal_1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_0=0, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L107] COND FALSE !(var_1_20 && stepLocal_0) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L111] signed long int stepLocal_4 = (var_1_6 * var_1_1) / -64; [L112] unsigned short int stepLocal_3 = var_1_28; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_4=0, var_1_11=-126, var_1_12=2, var_1_13=256, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L113] COND TRUE stepLocal_4 >= var_1_28 [L114] var_1_13 = ((((var_1_28) < (var_1_31)) ? (var_1_28) : (var_1_31))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, var_1_11=-126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L120] unsigned long int stepLocal_6 = var_1_16; [L121] signed long int stepLocal_5 = (- var_1_18) / var_1_26; VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_5=0, stepLocal_6=2147483680, var_1_11=-126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=50, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L122] COND FALSE !(var_1_34 < (var_1_5 / var_1_35)) [L137] var_1_33 = var_1_30 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, stepLocal_3=0, stepLocal_5=0, stepLocal_6=2147483680, var_1_11=-126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L207] RET step() [L208] CALL, EXPR property() [L198-L199] return (((((((((((((- var_1_3) <= (var_1_4 - var_1_5)) ? ((var_1_3 >= (var_1_5 / 255.75f)) ? (var_1_1 == ((signed char) var_1_6)) : (var_1_1 == ((signed char) var_1_6))) : 1) && ((var_1_4 != var_1_5) ? (var_1_7 == ((signed char) var_1_6)) : (var_1_7 == ((signed char) var_1_8)))) && ((var_1_22 || var_1_20) ? (var_1_9 == ((signed char) ((((((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) > (((((-2) < 0 ) ? -(-2) : (-2))))) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (((((-2) < 0 ) ? -(-2) : (-2))))))) > (var_1_6)) ? (((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) > (((((-2) < 0 ) ? -(-2) : (-2))))) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (((((-2) < 0 ) ? -(-2) : (-2))))))) : (var_1_6))))) : ((var_1_20 && var_1_22) ? (var_1_9 == ((signed char) ((((var_1_11) < (var_1_8)) ? (var_1_11) : (var_1_8))))) : 1))) && ((var_1_31 == var_1_11) ? ((! var_1_22) ? (var_1_22 ? (var_1_12 == ((signed long int) var_1_18)) : 1) : 1) : 1)) && ((((var_1_6 * var_1_1) / -64) >= var_1_28) ? (var_1_13 == ((unsigned long int) ((((var_1_28) < (var_1_31)) ? (var_1_28) : (var_1_31))))) : ((50u >= var_1_28) ? (var_1_13 == ((unsigned long int) (var_1_16 - var_1_18))) : 1))) && (var_1_18 == ((unsigned char) var_1_19))) && (((var_1_31 / var_1_16) <= var_1_28) ? ((var_1_28 <= var_1_18) ? (var_1_20 == ((unsigned char) var_1_21)) : 1) : 1)) && ((var_1_18 > ((32u / var_1_16) + 32u)) ? (var_1_22 == ((unsigned char) var_1_21)) : 1)) && (var_1_21 ? (var_1_23 == ((unsigned char) ((var_1_24 + var_1_25) + ((var_1_26 + 32) - var_1_27)))) : (var_1_23 == ((unsigned char) var_1_27)))) && ((last_1_var_1_13 > ((((last_1_var_1_31) > (var_1_16)) ? (last_1_var_1_31) : (var_1_16)))) ? (var_1_28 == ((unsigned short int) (((((var_1_29) > (var_1_30)) ? (var_1_29) : (var_1_30))) - last_1_var_1_33))) : (var_1_28 == ((unsigned short int) (var_1_25 + var_1_19))))) && ((var_1_5 <= (- ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3))))) ? (var_1_31 == ((unsigned short int) ((25454 + var_1_32) - var_1_1))) : (var_1_31 == ((unsigned short int) ((((((((var_1_19) < (var_1_23)) ? (var_1_19) : (var_1_23)))) > (var_1_29)) ? (((((var_1_19) < (var_1_23)) ? (var_1_19) : (var_1_23)))) : (var_1_29))))))) && ((var_1_34 < (var_1_5 / var_1_35)) ? ((var_1_16 > ((((64u) < (var_1_28)) ? (64u) : (var_1_28)))) ? (((var_1_4 - var_1_5) <= var_1_3) ? (var_1_33 == ((unsigned long int) (((((8u) < 0 ) ? -(8u) : (8u))) + 25u))) : (var_1_33 == ((unsigned long int) ((((var_1_27) > ((var_1_29 + ((((16u) < (var_1_18)) ? (16u) : (var_1_18)))))) ? (var_1_27) : ((var_1_29 + ((((16u) < (var_1_18)) ? (16u) : (var_1_18)))))))))) : ((((- var_1_18) / var_1_26) < var_1_25) ? (var_1_33 == ((unsigned long int) var_1_30)) : (var_1_33 == ((unsigned long int) var_1_7)))) : (var_1_33 == ((unsigned long int) var_1_30))) ; [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_31=1, last_1_var_1_33=50, var_1_11=-126, var_1_12=2, var_1_13=0, var_1_16=2147483680, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=256, var_1_24=0, var_1_25=0, var_1_26=31, var_1_27=256, var_1_28=0, var_1_29=32768, var_1_30=32767, var_1_31=41838, var_1_32=16384, var_1_33=32767, var_1_6=1, var_1_7=1, var_1_8=-127, var_1_9=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.8s, OverallIterations: 8, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1286 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1273 mSDsluCounter, 2703 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1823 mSDsCounter, 634 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1533 IncrementalHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 634 mSolverCounterUnsat, 880 mSDtfsCounter, 1533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1173 GetRequests, 1100 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 54.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=6, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 606 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 58.4s InterpolantComputationTime, 2197 NumberOfCodeBlocks, 2197 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1984 ConstructedInterpolants, 0 QuantifiedInterpolants, 6818 SizeOfPredicates, 8 NumberOfNonLiveVariables, 905 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 19576/19840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:19:16,179 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-11 11:19:16,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:19:17,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:19:17,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:19:17,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:19:17,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:19:17,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:19:17,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:19:17,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:19:17,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:19:17,992 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:19:17,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:19:17,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:19:17,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:19:17,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:19:17,993 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:19:17,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:19:17,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:19:17,994 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:19:17,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:19:17,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:19:17,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:19:17,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:19:17,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:19:17,997 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:19:17,998 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:19:17,998 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:19:17,998 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:19:17,998 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:19:17,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:19:17,999 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:19:17,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:19:17,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:19:17,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:19:17,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:19:17,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:19:18,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:19:18,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:19:18,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:19:18,002 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:19:18,002 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:19:18,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:19:18,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:19:18,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:19:18,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:19:18,003 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:19:18,003 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64360fc7d3c5d5814f250bc67771c1266affbe7be077c4ce76d53cff763882cf [2024-10-11 11:19:18,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:19:18,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:19:18,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:19:18,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:19:18,307 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:19:18,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i [2024-10-11 11:19:19,540 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:19:19,735 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:19:19,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i [2024-10-11 11:19:19,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/75d58a246/9fa53d89877540d88145068e70474727/FLAGb13ebe21c [2024-10-11 11:19:19,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/75d58a246/9fa53d89877540d88145068e70474727 [2024-10-11 11:19:19,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:19:19,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:19:19,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:19:19,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:19:19,791 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:19:19,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:19:19" (1/1) ... [2024-10-11 11:19:19,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4404c1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:19, skipping insertion in model container [2024-10-11 11:19:19,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:19:19" (1/1) ... [2024-10-11 11:19:19,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:19:19,963 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i[916,929] [2024-10-11 11:19:20,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:19:20,071 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:19:20,083 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-51.i[916,929] [2024-10-11 11:19:20,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:19:20,134 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:19:20,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:20 WrapperNode [2024-10-11 11:19:20,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:19:20,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:19:20,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:19:20,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:19:20,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:20" (1/1) ... [2024-10-11 11:19:20,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:20" (1/1) ... [2024-10-11 11:19:20,194 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-10-11 11:19:20,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:19:20,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:19:20,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:19:20,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:19:20,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:20" (1/1) ... [2024-10-11 11:19:20,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:20" (1/1) ... [2024-10-11 11:19:20,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:20" (1/1) ... [2024-10-11 11:19:20,225 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:19:20,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:20" (1/1) ... [2024-10-11 11:19:20,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:20" (1/1) ... [2024-10-11 11:19:20,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:20" (1/1) ... [2024-10-11 11:19:20,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:20" (1/1) ... [2024-10-11 11:19:20,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:20" (1/1) ... [2024-10-11 11:19:20,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:20" (1/1) ... [2024-10-11 11:19:20,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:19:20,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:19:20,269 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:19:20,269 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:19:20,270 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:20" (1/1) ... [2024-10-11 11:19:20,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:19:20,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:19:20,298 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:19:20,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:19:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:19:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:19:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:19:20,341 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:19:20,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:19:20,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:19:20,419 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:19:20,420 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:19:34,174 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 11:19:34,174 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:19:34,231 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:19:34,232 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:19:34,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:19:34 BoogieIcfgContainer [2024-10-11 11:19:34,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:19:34,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:19:34,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:19:34,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:19:34,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:19:19" (1/3) ... [2024-10-11 11:19:34,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7943fcf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:19:34, skipping insertion in model container [2024-10-11 11:19:34,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:19:20" (2/3) ... [2024-10-11 11:19:34,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7943fcf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:19:34, skipping insertion in model container [2024-10-11 11:19:34,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:19:34" (3/3) ... [2024-10-11 11:19:34,242 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-51.i [2024-10-11 11:19:34,254 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:19:34,255 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:19:34,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:19:34,307 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7fb1f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:19:34,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:19:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 11:19:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 11:19:34,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:19:34,324 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:19:34,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:19:34,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:19:34,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1230719355, now seen corresponding path program 1 times [2024-10-11 11:19:34,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:19:34,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856982053] [2024-10-11 11:19:34,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:34,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:19:34,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:19:34,341 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:19:34,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:19:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:35,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:19:35,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:19:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2024-10-11 11:19:35,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:19:35,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:19:35,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856982053] [2024-10-11 11:19:35,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856982053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:19:35,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:19:35,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:19:35,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593636425] [2024-10-11 11:19:35,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:19:35,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:19:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:19:35,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:19:35,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:19:35,331 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 11:19:39,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:19:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:19:39,812 INFO L93 Difference]: Finished difference Result 173 states and 314 transitions. [2024-10-11 11:19:39,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:19:39,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 199 [2024-10-11 11:19:39,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:19:39,994 INFO L225 Difference]: With dead ends: 173 [2024-10-11 11:19:39,994 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 11:19:39,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:19:40,003 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:19:40,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 11:19:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 11:19:40,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 11:19:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 11:19:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 137 transitions. [2024-10-11 11:19:40,049 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 137 transitions. Word has length 199 [2024-10-11 11:19:40,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:19:40,050 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 137 transitions. [2024-10-11 11:19:40,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 11:19:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 137 transitions. [2024-10-11 11:19:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 11:19:40,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:19:40,053 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:19:40,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:19:40,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:19:40,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:19:40,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:19:40,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1349404215, now seen corresponding path program 1 times [2024-10-11 11:19:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:19:40,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615140160] [2024-10-11 11:19:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:19:40,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:19:40,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:19:40,262 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:19:40,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:19:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:19:41,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 11:19:41,110 INFO L278 TraceCheckSpWp]: Computing forward predicates...