./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_fillercode_fillercodesize_ps-cn-10_file-72.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_fillercode_fillercodesize_ps-cn-10_file-72.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 ff43099396207f2e7f14a52467281e8d3219fba521ba1b291bba2029ae8f3105 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:08:57,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:08:57,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:08:57,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:08:57,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:08:57,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:08:57,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:08:57,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:08:57,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:08:57,603 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:08:57,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:08:57,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:08:57,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:08:57,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:08:57,609 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:08:57,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:08:57,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:08:57,609 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:08:57,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:08:57,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:08:57,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:08:57,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:08:57,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:08:57,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:08:57,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:08:57,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:08:57,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:08:57,614 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:08:57,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:08:57,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:08:57,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:08:57,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:08:57,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:08:57,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:08:57,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:08:57,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:08:57,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:08:57,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:08:57,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:08:57,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:08:57,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:08:57,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:08:57,631 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 -> ff43099396207f2e7f14a52467281e8d3219fba521ba1b291bba2029ae8f3105 [2024-10-11 08:08:57,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:08:57,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:08:57,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:08:57,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:08:57,879 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:08:57,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2024-10-11 08:08:59,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:08:59,277 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:08:59,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2024-10-11 08:08:59,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b29105569/55ef5211190a48e185800b32c19940f9/FLAG42c4a0091 [2024-10-11 08:08:59,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b29105569/55ef5211190a48e185800b32c19940f9 [2024-10-11 08:08:59,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:08:59,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:08:59,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:08:59,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:08:59,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:08:59,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:08:59" (1/1) ... [2024-10-11 08:08:59,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd15d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59, skipping insertion in model container [2024-10-11 08:08:59,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:08:59" (1/1) ... [2024-10-11 08:08:59,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:08:59,476 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_fillercode_fillercodesize_ps-cn-10_file-72.i[915,928] [2024-10-11 08:08:59,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:08:59,548 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:08:59,563 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_fillercode_fillercodesize_ps-cn-10_file-72.i[915,928] [2024-10-11 08:08:59,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:08:59,601 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:08:59,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59 WrapperNode [2024-10-11 08:08:59,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:08:59,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:08:59,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:08:59,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:08:59,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59" (1/1) ... [2024-10-11 08:08:59,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59" (1/1) ... [2024-10-11 08:08:59,639 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-10-11 08:08:59,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:08:59,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:08:59,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:08:59,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:08:59,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59" (1/1) ... [2024-10-11 08:08:59,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59" (1/1) ... [2024-10-11 08:08:59,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59" (1/1) ... [2024-10-11 08:08:59,668 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 08:08:59,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59" (1/1) ... [2024-10-11 08:08:59,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59" (1/1) ... [2024-10-11 08:08:59,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59" (1/1) ... [2024-10-11 08:08:59,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59" (1/1) ... [2024-10-11 08:08:59,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59" (1/1) ... [2024-10-11 08:08:59,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59" (1/1) ... [2024-10-11 08:08:59,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:08:59,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:08:59,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:08:59,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:08:59,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59" (1/1) ... [2024-10-11 08:08:59,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:08:59,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:08:59,718 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 08:08:59,722 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 08:08:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:08:59,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:08:59,759 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:08:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:08:59,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:08:59,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:08:59,842 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:08:59,847 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:09:00,108 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 08:09:00,109 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:09:00,143 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:09:00,144 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:09:00,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:00 BoogieIcfgContainer [2024-10-11 08:09:00,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:09:00,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:09:00,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:09:00,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:09:00,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:08:59" (1/3) ... [2024-10-11 08:09:00,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97ff1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:09:00, skipping insertion in model container [2024-10-11 08:09:00,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:08:59" (2/3) ... [2024-10-11 08:09:00,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97ff1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:09:00, skipping insertion in model container [2024-10-11 08:09:00,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:00" (3/3) ... [2024-10-11 08:09:00,152 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2024-10-11 08:09:00,164 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:09:00,164 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:09:00,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:09:00,210 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;@724a756a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:09:00,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:09:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 08:09:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 08:09:00,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:00,230 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:00,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:00,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:00,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1121632176, now seen corresponding path program 1 times [2024-10-11 08:09:00,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:00,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780354210] [2024-10-11 08:09:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:09:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:09:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:09:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:09:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:09:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:09:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:09:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:09:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:09:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:09:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:09:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:09:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:09:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:09:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:09:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:09:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:09:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:09:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:09:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:09:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:09:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:09:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:09:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:09:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:09:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:09:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:09:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:09:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:09:00,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:09:00,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780354210] [2024-10-11 08:09:00,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780354210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:00,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:00,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:09:00,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037524461] [2024-10-11 08:09:00,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:00,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:09:00,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:09:00,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:09:00,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:09:00,692 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 08:09:00,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:00,732 INFO L93 Difference]: Finished difference Result 143 states and 256 transitions. [2024-10-11 08:09:00,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:09:00,735 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 171 [2024-10-11 08:09:00,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:00,742 INFO L225 Difference]: With dead ends: 143 [2024-10-11 08:09:00,742 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 08:09:00,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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 08:09:00,748 INFO L432 NwaCegarLoop]: 107 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, 107 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 08:09:00,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:09:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 08:09:00,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 08:09:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 08:09:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2024-10-11 08:09:00,782 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 171 [2024-10-11 08:09:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:00,783 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2024-10-11 08:09:00,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 08:09:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2024-10-11 08:09:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 08:09:00,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:00,788 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:00,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:09:00,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:00,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:00,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2003304180, now seen corresponding path program 1 times [2024-10-11 08:09:00,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:00,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221764729] [2024-10-11 08:09:00,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:00,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:09:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:09:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:09:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:09:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:09:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:09:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:09:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:09:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:09:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:09:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:09:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:09:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:09:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:09:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:09:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:09:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:09:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:09:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:09:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:09:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:09:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:09:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:09:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:09:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:09:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:09:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:09:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:09:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:09:01,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:09:01,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221764729] [2024-10-11 08:09:01,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221764729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:01,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:01,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:09:01,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425528312] [2024-10-11 08:09:01,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:01,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:09:01,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:09:01,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:09:01,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:09:01,295 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:09:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:01,343 INFO L93 Difference]: Finished difference Result 155 states and 239 transitions. [2024-10-11 08:09:01,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:09:01,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 171 [2024-10-11 08:09:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:01,345 INFO L225 Difference]: With dead ends: 155 [2024-10-11 08:09:01,345 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 08:09:01,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:09:01,347 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 15 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:01,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 201 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:09:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 08:09:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2024-10-11 08:09:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 08:09:01,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 116 transitions. [2024-10-11 08:09:01,366 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 116 transitions. Word has length 171 [2024-10-11 08:09:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:01,370 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 116 transitions. [2024-10-11 08:09:01,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:09:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 116 transitions. [2024-10-11 08:09:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 08:09:01,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:01,373 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:01,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:09:01,373 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:01,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1045484921, now seen corresponding path program 1 times [2024-10-11 08:09:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:01,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671222030] [2024-10-11 08:09:01,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:01,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:09:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:09:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:09:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:09:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:09:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:09:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:09:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:09:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:09:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:09:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:09:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:09:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:09:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:09:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:09:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:09:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:09:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:09:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:09:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:09:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:09:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:09:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:09:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:09:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:09:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:09:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:09:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:09:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:09:01,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:09:01,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671222030] [2024-10-11 08:09:01,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671222030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:01,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:01,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:09:01,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895666624] [2024-10-11 08:09:01,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:01,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:09:01,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:09:01,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:09:01,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:09:01,816 INFO L87 Difference]: Start difference. First operand 75 states and 116 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:09:01,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:01,907 INFO L93 Difference]: Finished difference Result 186 states and 280 transitions. [2024-10-11 08:09:01,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:09:01,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-10-11 08:09:01,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:01,909 INFO L225 Difference]: With dead ends: 186 [2024-10-11 08:09:01,910 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 08:09:01,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:09:01,911 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:01,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 305 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:09:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 08:09:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 90. [2024-10-11 08:09:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 55 states have internal predecessors, (70), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 08:09:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 136 transitions. [2024-10-11 08:09:01,923 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 136 transitions. Word has length 172 [2024-10-11 08:09:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:01,924 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 136 transitions. [2024-10-11 08:09:01,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:09:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2024-10-11 08:09:01,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 08:09:01,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:01,926 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:01,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:09:01,926 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:01,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:01,927 INFO L85 PathProgramCache]: Analyzing trace with hash -988226619, now seen corresponding path program 1 times [2024-10-11 08:09:01,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:01,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892620410] [2024-10-11 08:09:01,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:01,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:09:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:09:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:09:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:09:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:09:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:09:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:09:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:09:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:09:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:09:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:09:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:09:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:09:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:09:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:09:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:09:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:09:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:09:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:09:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:09:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:09:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:09:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:09:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:09:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:09:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:09:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:09:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:09:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 08:09:02,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:09:02,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892620410] [2024-10-11 08:09:02,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892620410] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:09:02,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100272182] [2024-10-11 08:09:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:02,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:09:02,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:09:02,259 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 08:09:02,261 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 08:09:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:02,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:09:02,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:09:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 477 proven. 66 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-11 08:09:02,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:09:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 08:09:02,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100272182] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:09:02,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:09:02,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 08:09:02,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218893494] [2024-10-11 08:09:02,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:09:02,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 08:09:02,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:09:02,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 08:09:02,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:09:02,878 INFO L87 Difference]: Start difference. First operand 90 states and 136 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-10-11 08:09:03,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:03,070 INFO L93 Difference]: Finished difference Result 175 states and 260 transitions. [2024-10-11 08:09:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 08:09:03,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 172 [2024-10-11 08:09:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:03,072 INFO L225 Difference]: With dead ends: 175 [2024-10-11 08:09:03,072 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 08:09:03,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 395 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 08:09:03,074 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 35 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:03,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 190 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:09:03,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 08:09:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2024-10-11 08:09:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 55 states have internal predecessors, (67), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 08:09:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2024-10-11 08:09:03,111 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 172 [2024-10-11 08:09:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:03,113 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2024-10-11 08:09:03,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2024-10-11 08:09:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2024-10-11 08:09:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 08:09:03,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:03,116 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:03,132 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 08:09:03,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:09:03,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:03,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:03,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1854831547, now seen corresponding path program 1 times [2024-10-11 08:09:03,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:03,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690164918] [2024-10-11 08:09:03,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:03,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:09:03,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272396905] [2024-10-11 08:09:03,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:03,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:09:03,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:09:03,442 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 08:09:03,443 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 08:09:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:03,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 08:09:03,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:09:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:09:04,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:09:04,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:09:04,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690164918] [2024-10-11 08:09:04,024 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 08:09:04,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272396905] [2024-10-11 08:09:04,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272396905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:04,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:04,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:09:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61177935] [2024-10-11 08:09:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:04,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:09:04,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:09:04,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:09:04,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:09:04,026 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:09:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:04,165 INFO L93 Difference]: Finished difference Result 248 states and 363 transitions. [2024-10-11 08:09:04,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:09:04,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-10-11 08:09:04,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:04,168 INFO L225 Difference]: With dead ends: 248 [2024-10-11 08:09:04,169 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 08:09:04,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 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 08:09:04,170 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 73 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:04,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 317 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:09:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 08:09:04,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 142. [2024-10-11 08:09:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 80 states have (on average 1.2) internal successors, (96), 80 states have internal predecessors, (96), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 08:09:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2024-10-11 08:09:04,205 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 172 [2024-10-11 08:09:04,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:04,205 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2024-10-11 08:09:04,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:09:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2024-10-11 08:09:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 08:09:04,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:04,208 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:04,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 08:09:04,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:09:04,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:04,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash -963848445, now seen corresponding path program 1 times [2024-10-11 08:09:04,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:04,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446787846] [2024-10-11 08:09:04,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:09:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:09:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:09:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:09:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:09:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:09:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:09:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:09:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:09:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:09:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:09:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:09:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:09:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:09:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:09:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:09:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:09:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:09:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:09:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:09:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:09:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:09:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:09:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:09:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:09:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:09:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:09:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:09:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:09:04,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:09:04,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446787846] [2024-10-11 08:09:04,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446787846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:04,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:04,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:09:04,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335958234] [2024-10-11 08:09:04,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:04,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:09:04,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:09:04,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:09:04,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:09:04,585 INFO L87 Difference]: Start difference. First operand 142 states and 208 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 08:09:04,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:04,718 INFO L93 Difference]: Finished difference Result 302 states and 441 transitions. [2024-10-11 08:09:04,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:09:04,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 172 [2024-10-11 08:09:04,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:04,721 INFO L225 Difference]: With dead ends: 302 [2024-10-11 08:09:04,721 INFO L226 Difference]: Without dead ends: 220 [2024-10-11 08:09:04,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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 08:09:04,722 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 129 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:04,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 203 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:09:04,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-11 08:09:04,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 142. [2024-10-11 08:09:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 80 states have (on average 1.2) internal successors, (96), 80 states have internal predecessors, (96), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 08:09:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions. [2024-10-11 08:09:04,743 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 172 [2024-10-11 08:09:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:04,744 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions. [2024-10-11 08:09:04,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 08:09:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions. [2024-10-11 08:09:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 08:09:04,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:04,745 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:04,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 08:09:04,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:04,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:04,746 INFO L85 PathProgramCache]: Analyzing trace with hash -562735057, now seen corresponding path program 1 times [2024-10-11 08:09:04,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:04,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404676335] [2024-10-11 08:09:04,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:04,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:09:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:09:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:09:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:09:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:09:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:09:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:09:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:09:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:09:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:09:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:09:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:09:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:09:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:09:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:09:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:09:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:09:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:09:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:09:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:09:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:09:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:09:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:09:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:09:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:09:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:09:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:09:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:09:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:09:04,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:09:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404676335] [2024-10-11 08:09:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404676335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:04,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:04,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:09:04,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458574757] [2024-10-11 08:09:04,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:04,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:09:04,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:09:04,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:09:04,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:09:04,922 INFO L87 Difference]: Start difference. First operand 142 states and 208 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:09:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:05,040 INFO L93 Difference]: Finished difference Result 302 states and 440 transitions. [2024-10-11 08:09:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:09:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-10-11 08:09:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:05,042 INFO L225 Difference]: With dead ends: 302 [2024-10-11 08:09:05,042 INFO L226 Difference]: Without dead ends: 220 [2024-10-11 08:09:05,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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 08:09:05,043 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 112 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:05,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 207 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:09:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-11 08:09:05,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 138. [2024-10-11 08:09:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 76 states have internal predecessors, (90), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 08:09:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 202 transitions. [2024-10-11 08:09:05,064 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 202 transitions. Word has length 173 [2024-10-11 08:09:05,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:05,064 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 202 transitions. [2024-10-11 08:09:05,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:09:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 202 transitions. [2024-10-11 08:09:05,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 08:09:05,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:05,065 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:05,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 08:09:05,066 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:05,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:05,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1462064216, now seen corresponding path program 1 times [2024-10-11 08:09:05,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:05,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112470187] [2024-10-11 08:09:05,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:09:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:09:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:09:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:09:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:09:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 08:09:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:09:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:09:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:09:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:09:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:09:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:09:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:09:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:09:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:09:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:09:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:09:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:09:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:09:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:09:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:09:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:09:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:09:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:09:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:09:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:09:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 08:09:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:09:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:09:05,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:09:05,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112470187] [2024-10-11 08:09:05,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112470187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:05,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:05,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:09:05,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434947996] [2024-10-11 08:09:05,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:05,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:09:05,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:09:05,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:09:05,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:09:05,251 INFO L87 Difference]: Start difference. First operand 138 states and 202 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:09:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:05,353 INFO L93 Difference]: Finished difference Result 232 states and 337 transitions. [2024-10-11 08:09:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:09:05,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-10-11 08:09:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:05,355 INFO L225 Difference]: With dead ends: 232 [2024-10-11 08:09:05,355 INFO L226 Difference]: Without dead ends: 154 [2024-10-11 08:09:05,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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 08:09:05,355 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 62 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:05,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 309 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:09:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-11 08:09:05,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 139. [2024-10-11 08:09:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 77 states have internal predecessors, (91), 56 states have call successors, (56), 5 states have call predecessors, (56), 5 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 08:09:05,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 203 transitions. [2024-10-11 08:09:05,378 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 203 transitions. Word has length 173 [2024-10-11 08:09:05,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:05,378 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 203 transitions. [2024-10-11 08:09:05,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:09:05,379 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 203 transitions. [2024-10-11 08:09:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-11 08:09:05,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:05,380 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:05,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 08:09:05,380 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:05,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:05,380 INFO L85 PathProgramCache]: Analyzing trace with hash 310612778, now seen corresponding path program 1 times [2024-10-11 08:09:05,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:09:05,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483822044] [2024-10-11 08:09:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:05,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:09:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:09:05,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806761322] [2024-10-11 08:09:05,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:05,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:09:05,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:09:05,442 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 08:09:05,443 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 08:09:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:09:05,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:09:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:09:05,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:09:05,696 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:09:05,697 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:09:05,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 08:09:05,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:09:05,905 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:09:06,012 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:09:06,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:09:06 BoogieIcfgContainer [2024-10-11 08:09:06,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:09:06,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:09:06,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:09:06,014 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:09:06,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:00" (3/4) ... [2024-10-11 08:09:06,017 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:09:06,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:09:06,018 INFO L158 Benchmark]: Toolchain (without parser) took 6717.57ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 132.1MB in the beginning and 81.4MB in the end (delta: 50.7MB). Peak memory consumption was 127.4MB. Max. memory is 16.1GB. [2024-10-11 08:09:06,018 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:09:06,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.39ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 127.3MB in the end (delta: 4.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 08:09:06,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.01ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 124.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 08:09:06,019 INFO L158 Benchmark]: Boogie Preprocessor took 49.56ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 120.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:09:06,019 INFO L158 Benchmark]: RCFGBuilder took 455.81ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 114.3MB in the end (delta: 5.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 08:09:06,019 INFO L158 Benchmark]: TraceAbstraction took 5866.85ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 114.3MB in the beginning and 82.4MB in the end (delta: 32.0MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. [2024-10-11 08:09:06,019 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 245.4MB. Free memory was 82.4MB in the beginning and 81.4MB in the end (delta: 974.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:09:06,021 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.15ms. Allocated memory is still 167.8MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.39ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 127.3MB in the end (delta: 4.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.01ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 124.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.56ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 120.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 455.81ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 114.3MB in the end (delta: 5.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5866.85ms. Allocated memory was 167.8MB in the beginning and 245.4MB in the end (delta: 77.6MB). Free memory was 114.3MB in the beginning and 82.4MB in the end (delta: 32.0MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 245.4MB. Free memory was 82.4MB in the beginning and 81.4MB in the end (delta: 974.8kB). 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 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 164. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_10 = 2; [L24] signed char var_1_11 = 1; [L25] float var_1_14 = 64.3; [L26] signed char var_1_16 = 32; [L27] unsigned char var_1_17 = 1; [L28] unsigned char var_1_18 = 0; [L29] unsigned char var_1_19 = 0; [L30] double var_1_20 = 9.25; [L31] double var_1_21 = 255.05; [L32] double var_1_22 = 25.5; [L33] unsigned char var_1_23 = 2; [L34] unsigned char var_1_25 = 1; [L35] unsigned short int var_1_26 = 5; [L36] unsigned char var_1_27 = 128; [L37] unsigned char var_1_28 = 1; [L38] signed long int var_1_29 = 128; [L39] unsigned long int var_1_31 = 1; [L40] unsigned long int var_1_32 = 64; [L41] unsigned long int var_1_33 = 100; [L42] double var_1_34 = 63.5; [L43] double var_1_35 = 3.75; [L44] signed long int var_1_36 = -10; [L45] signed long int var_1_37 = 64; [L46] signed long int var_1_38 = 32; [L47] signed long int var_1_39 = -1000000; [L48] signed char var_1_40 = 8; [L49] signed char var_1_41 = -4; [L50] unsigned char var_1_42 = 25; [L51] unsigned char var_1_43 = 8; [L52] unsigned char last_1_var_1_17 = 1; [L53] double last_1_var_1_20 = 9.25; [L54] unsigned char last_1_var_1_23 = 2; [L55] unsigned short int last_1_var_1_26 = 5; [L56] signed long int last_1_var_1_29 = 128; [L168] isInitial = 1 [L169] FCALL initially() [L170] COND TRUE 1 [L171] CALL updateLastVariables() [L157] last_1_var_1_17 = var_1_17 [L158] last_1_var_1_20 = var_1_20 [L159] last_1_var_1_23 = var_1_23 [L160] last_1_var_1_26 = var_1_26 [L161] last_1_var_1_29 = var_1_29 [L171] RET updateLastVariables() [L172] CALL updateVariables() [L111] var_1_11 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L112] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L113] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L113] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L114] var_1_14 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L115] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L116] var_1_16 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_16 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L117] RET assume_abort_if_not(var_1_16 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L118] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L118] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L120] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L121] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L121] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L122] var_1_19 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L123] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L124] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L124] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L125] var_1_21 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L126] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L127] var_1_22 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L128] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L129] var_1_25 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L130] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L131] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L131] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L132] var_1_27 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L133] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L134] CALL assume_abort_if_not(var_1_27 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L134] RET assume_abort_if_not(var_1_27 <= 255) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L135] var_1_28 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L136] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L137] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L137] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L138] var_1_33 = __VERIFIER_nondet_ulong() [L139] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L139] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L140] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L140] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L141] var_1_35 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L142] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L143] var_1_38 = __VERIFIER_nondet_long() [L144] CALL assume_abort_if_not(var_1_38 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L144] RET assume_abort_if_not(var_1_38 >= -2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L145] CALL assume_abort_if_not(var_1_38 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L145] RET assume_abort_if_not(var_1_38 <= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L146] var_1_39 = __VERIFIER_nondet_long() [L147] CALL assume_abort_if_not(var_1_39 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L147] RET assume_abort_if_not(var_1_39 >= -2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L148] CALL assume_abort_if_not(var_1_39 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L148] RET assume_abort_if_not(var_1_39 <= 2147483646) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L149] var_1_41 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L150] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L151] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L151] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L152] var_1_43 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25] [L153] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25] [L154] CALL assume_abort_if_not(var_1_43 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L154] RET assume_abort_if_not(var_1_43 <= 254) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=0, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L172] RET updateVariables() [L173] CALL step() [L60] var_1_32 = var_1_33 [L61] var_1_34 = var_1_35 [L62] var_1_36 = -256 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L63] EXPR ((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38))) | var_1_32 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L63] COND TRUE var_1_36 >= (((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38))) | var_1_32) [L64] var_1_37 = var_1_39 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=0, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L66] var_1_40 = var_1_41 [L67] var_1_42 = var_1_43 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=0, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L68] COND FALSE !((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=0, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L71] COND TRUE last_1_var_1_17 || last_1_var_1_17 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=0, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L72] COND TRUE (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20) [L73] var_1_10 = (var_1_11 + var_1_16) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=0, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L81] COND TRUE (last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26 [L82] var_1_23 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=0, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L84] var_1_17 = (var_1_18 && var_1_19) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=0, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L85] COND FALSE !(! var_1_18) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=0, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L88] COND TRUE 256 >= var_1_10 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=0, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L89] COND TRUE var_1_17 && (var_1_25 >= (var_1_27 - var_1_28)) [L90] var_1_26 = 16 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=0, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L97] signed long int stepLocal_0 = var_1_23 * var_1_26; VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=0, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L98] COND FALSE !(((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) [L105] var_1_1 = -50 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=0, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L107] var_1_31 = var_1_26 [L108] var_1_29 = var_1_1 [L173] RET step() [L174] CALL, EXPR property() [L164-L165] return ((((((((((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) ? (((var_1_23 * var_1_26) <= (~ var_1_26)) ? (var_1_1 == ((signed short int) (((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) + var_1_23))) : (var_1_1 == ((signed short int) var_1_10))) : (var_1_1 == ((signed short int) -50))) && (((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) ? (var_1_10 == ((signed char) (var_1_11 + 10))) : ((last_1_var_1_17 || last_1_var_1_17) ? (((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20)) ? (var_1_10 == ((signed char) (var_1_11 + var_1_16))) : (var_1_10 == ((signed char) var_1_11))) : (var_1_10 == ((signed char) var_1_16))))) && (var_1_17 == ((unsigned char) (var_1_18 && var_1_19)))) && ((! var_1_18) ? (var_1_20 == ((double) ((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22))))) : 1)) && (((last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26) ? (var_1_23 == ((unsigned char) var_1_25)) : 1)) && ((256 >= var_1_10) ? ((var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) ? (var_1_26 == ((unsigned short int) 16)) : (var_1_26 == ((unsigned short int) var_1_28))) : (var_1_26 == ((unsigned short int) var_1_25)))) && (var_1_29 == ((signed long int) var_1_1))) && (var_1_31 == ((unsigned long int) var_1_26)) ; [L174] RET, EXPR property() [L174] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=0, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=0, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 490 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 485 mSDsluCounter, 1839 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 986 mSDsCounter, 328 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 328 mSolverCounterUnsat, 853 mSDtfsCounter, 344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 970 GetRequests, 945 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=5, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 234 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2068 NumberOfCodeBlocks, 2068 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1710 ConstructedInterpolants, 0 QuantifiedInterpolants, 5015 SizeOfPredicates, 4 NumberOfNonLiveVariables, 846 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 14922/15120 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 08:09:06,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 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_fillercode_fillercodesize_ps-cn-10_file-72.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 ff43099396207f2e7f14a52467281e8d3219fba521ba1b291bba2029ae8f3105 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:09:07,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:09:07,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:09:07,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:09:07,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:09:07,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:09:07,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:09:07,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:09:07,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:09:07,996 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:09:07,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:09:07,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:09:07,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:09:07,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:09:07,998 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:09:07,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:09:07,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:09:07,998 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:09:07,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:09:07,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:09:07,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:09:08,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:09:08,001 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:09:08,001 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:09:08,002 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:09:08,002 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:09:08,002 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:09:08,002 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:09:08,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:09:08,002 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:09:08,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:09:08,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:09:08,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:09:08,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:09:08,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:09:08,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:09:08,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:09:08,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:09:08,003 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:09:08,004 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:09:08,004 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:09:08,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:09:08,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:09:08,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:09:08,005 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:09:08,006 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 -> ff43099396207f2e7f14a52467281e8d3219fba521ba1b291bba2029ae8f3105 [2024-10-11 08:09:08,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:09:08,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:09:08,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:09:08,272 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:09:08,273 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:09:08,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2024-10-11 08:09:09,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:09:09,705 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:09:09,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2024-10-11 08:09:09,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b829cdef7/080f08f404fe47928240a8b36b8ab7ab/FLAG2e14c7828 [2024-10-11 08:09:09,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b829cdef7/080f08f404fe47928240a8b36b8ab7ab [2024-10-11 08:09:09,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:09:09,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:09:09,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:09:09,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:09:09,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:09:09,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:09:09" (1/1) ... [2024-10-11 08:09:09,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4112ff71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:09, skipping insertion in model container [2024-10-11 08:09:09,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:09:09" (1/1) ... [2024-10-11 08:09:09,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:09:09,932 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_fillercode_fillercodesize_ps-cn-10_file-72.i[915,928] [2024-10-11 08:09:09,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:09:10,006 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:09:10,016 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_fillercode_fillercodesize_ps-cn-10_file-72.i[915,928] [2024-10-11 08:09:10,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:09:10,070 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:09:10,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:10 WrapperNode [2024-10-11 08:09:10,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:09:10,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:09:10,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:09:10,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:09:10,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:10" (1/1) ... [2024-10-11 08:09:10,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:10" (1/1) ... [2024-10-11 08:09:10,119 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-11 08:09:10,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:09:10,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:09:10,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:09:10,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:09:10,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:10" (1/1) ... [2024-10-11 08:09:10,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:10" (1/1) ... [2024-10-11 08:09:10,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:10" (1/1) ... [2024-10-11 08:09:10,145 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 08:09:10,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:10" (1/1) ... [2024-10-11 08:09:10,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:10" (1/1) ... [2024-10-11 08:09:10,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:10" (1/1) ... [2024-10-11 08:09:10,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:10" (1/1) ... [2024-10-11 08:09:10,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:10" (1/1) ... [2024-10-11 08:09:10,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:10" (1/1) ... [2024-10-11 08:09:10,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:09:10,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:09:10,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:09:10,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:09:10,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:10" (1/1) ... [2024-10-11 08:09:10,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:09:10,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:09:10,208 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 08:09:10,214 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 08:09:10,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:09:10,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:09:10,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:09:10,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:09:10,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:09:10,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:09:10,322 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:09:10,324 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:09:16,398 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 08:09:16,399 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:09:16,488 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:09:16,505 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:09:16,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:16 BoogieIcfgContainer [2024-10-11 08:09:16,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:09:16,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:09:16,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:09:16,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:09:16,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:09:09" (1/3) ... [2024-10-11 08:09:16,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f6399c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:09:16, skipping insertion in model container [2024-10-11 08:09:16,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:09:10" (2/3) ... [2024-10-11 08:09:16,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f6399c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:09:16, skipping insertion in model container [2024-10-11 08:09:16,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:09:16" (3/3) ... [2024-10-11 08:09:16,514 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2024-10-11 08:09:16,528 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:09:16,528 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:09:16,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:09:16,587 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;@5a5d9f1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:09:16,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:09:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 08:09:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 08:09:16,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:16,607 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:16,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:16,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:16,612 INFO L85 PathProgramCache]: Analyzing trace with hash 757868381, now seen corresponding path program 1 times [2024-10-11 08:09:16,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:09:16,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724150131] [2024-10-11 08:09:16,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:16,626 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 08:09:16,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:09:16,628 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 08:09:16,629 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 08:09:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:17,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:09:17,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:09:17,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-10-11 08:09:17,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:09:17,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:09:17,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724150131] [2024-10-11 08:09:17,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724150131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:17,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:17,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:09:17,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424928524] [2024-10-11 08:09:17,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:17,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:09:17,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:09:17,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:09:17,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:09:17,166 INFO L87 Difference]: Start difference. First operand has 70 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 08:09:21,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:09:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:21,272 INFO L93 Difference]: Finished difference Result 137 states and 246 transitions. [2024-10-11 08:09:21,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:09:21,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170 [2024-10-11 08:09:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:21,320 INFO L225 Difference]: With dead ends: 137 [2024-10-11 08:09:21,320 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 08:09:21,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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 08:09:21,325 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:21,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 08:09:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 08:09:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 08:09:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 08:09:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2024-10-11 08:09:21,376 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 170 [2024-10-11 08:09:21,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:21,376 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2024-10-11 08:09:21,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 08:09:21,377 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2024-10-11 08:09:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 08:09:21,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:21,379 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:21,396 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 08:09:21,583 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 08:09:21,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:21,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash -117617034, now seen corresponding path program 1 times [2024-10-11 08:09:21,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:09:21,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892094834] [2024-10-11 08:09:21,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:21,585 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 08:09:21,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:09:21,586 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 08:09:21,591 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 08:09:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:22,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:09:22,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:09:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:09:25,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:09:25,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:09:25,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892094834] [2024-10-11 08:09:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892094834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:25,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:25,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:09:25,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086249387] [2024-10-11 08:09:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:25,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:09:25,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:09:25,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:09:25,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:09:25,419 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:09:29,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:09:33,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:09:36,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:09:40,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:09:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:40,829 INFO L93 Difference]: Finished difference Result 211 states and 323 transitions. [2024-10-11 08:09:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:09:40,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 171 [2024-10-11 08:09:40,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:40,872 INFO L225 Difference]: With dead ends: 211 [2024-10-11 08:09:40,872 INFO L226 Difference]: Without dead ends: 144 [2024-10-11 08:09:40,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:09:40,874 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 64 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:40,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 302 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 15.3s Time] [2024-10-11 08:09:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-11 08:09:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 120. [2024-10-11 08:09:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 08:09:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 184 transitions. [2024-10-11 08:09:40,908 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 184 transitions. Word has length 171 [2024-10-11 08:09:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:40,909 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 184 transitions. [2024-10-11 08:09:40,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:09:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 184 transitions. [2024-10-11 08:09:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 08:09:40,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:40,913 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:40,929 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-11 08:09:41,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 08:09:41,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:41,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:41,115 INFO L85 PathProgramCache]: Analyzing trace with hash -518860741, now seen corresponding path program 1 times [2024-10-11 08:09:41,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:09:41,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96175194] [2024-10-11 08:09:41,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:41,116 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 08:09:41,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:09:41,117 INFO L229 MonitoredProcess]: Starting monitored process 4 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 08:09:41,119 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 (4)] Waiting until timeout for monitored process [2024-10-11 08:09:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:41,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 08:09:41,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:09:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 08:09:42,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:09:42,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:09:42,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96175194] [2024-10-11 08:09:42,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96175194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:09:42,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:09:42,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:09:42,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163545048] [2024-10-11 08:09:42,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:09:42,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:09:42,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:09:42,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:09:42,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:09:42,992 INFO L87 Difference]: Start difference. First operand 120 states and 184 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:09:47,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:09:51,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:09:54,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:09:57,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:09:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:09:57,840 INFO L93 Difference]: Finished difference Result 203 states and 310 transitions. [2024-10-11 08:09:57,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:09:57,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-10-11 08:09:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:09:57,881 INFO L225 Difference]: With dead ends: 203 [2024-10-11 08:09:57,881 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 08:09:57,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 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 08:09:57,884 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 51 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2024-10-11 08:09:57,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 297 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 13 Invalid, 2 Unknown, 0 Unchecked, 14.8s Time] [2024-10-11 08:09:57,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 08:09:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2024-10-11 08:09:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 62 states have internal predecessors, (73), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 08:09:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 185 transitions. [2024-10-11 08:09:57,910 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 185 transitions. Word has length 172 [2024-10-11 08:09:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:09:57,911 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 185 transitions. [2024-10-11 08:09:57,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 08:09:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 185 transitions. [2024-10-11 08:09:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 08:09:57,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:09:57,913 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:09:57,928 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 (4)] Ended with exit code 0 [2024-10-11 08:09:58,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 08:09:58,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:09:58,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:09:58,116 INFO L85 PathProgramCache]: Analyzing trace with hash -267454179, now seen corresponding path program 1 times [2024-10-11 08:09:58,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:09:58,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5473530] [2024-10-11 08:09:58,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:09:58,117 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 08:09:58,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:09:58,120 INFO L229 MonitoredProcess]: Starting monitored process 5 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 08:09:58,121 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 (5)] Waiting until timeout for monitored process [2024-10-11 08:09:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:09:58,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 08:09:58,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:10:29,297 WARN L286 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)