./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_fillercodestructure_filler-pe-co_file-30.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_fillercodestructure_filler-pe-co_file-30.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 641285a7f142375d2fe4c09d97137238c35a52e1a89408c5b7047a07a2270bcc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:16:31,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:16:31,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:16:31,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:16:31,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:16:31,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:16:31,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:16:31,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:16:31,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:16:31,457 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:16:31,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:16:31,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:16:31,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:16:31,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:16:31,461 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:16:31,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:16:31,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:16:31,462 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:16:31,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:16:31,462 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:16:31,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:16:31,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:16:31,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:16:31,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:16:31,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:16:31,466 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:16:31,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:16:31,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:16:31,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:16:31,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:16:31,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:16:31,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:16:31,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:16:31,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:16:31,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:16:31,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:16:31,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:16:31,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:16:31,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:16:31,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:16:31,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:16:31,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:16:31,472 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 -> 641285a7f142375d2fe4c09d97137238c35a52e1a89408c5b7047a07a2270bcc [2024-10-11 09:16:31,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:16:31,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:16:31,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:16:31,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:16:31,765 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:16:31,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-30.i [2024-10-11 09:16:33,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:16:33,525 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:16:33,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-30.i [2024-10-11 09:16:33,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b8dac1136/15a909234ddf40c185798a1fd95a43f9/FLAGbe987616b [2024-10-11 09:16:33,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b8dac1136/15a909234ddf40c185798a1fd95a43f9 [2024-10-11 09:16:33,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:16:33,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:16:33,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:16:33,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:16:33,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:16:33,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:16:33" (1/1) ... [2024-10-11 09:16:33,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5febdd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:33, skipping insertion in model container [2024-10-11 09:16:33,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:16:33" (1/1) ... [2024-10-11 09:16:33,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:16:34,101 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_fillercodestructure_filler-pe-co_file-30.i[919,932] [2024-10-11 09:16:34,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:16:34,220 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:16:34,232 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_fillercodestructure_filler-pe-co_file-30.i[919,932] [2024-10-11 09:16:34,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:16:34,336 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:16:34,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:34 WrapperNode [2024-10-11 09:16:34,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:16:34,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:16:34,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:16:34,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:16:34,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:34" (1/1) ... [2024-10-11 09:16:34,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:34" (1/1) ... [2024-10-11 09:16:34,410 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 229 [2024-10-11 09:16:34,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:16:34,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:16:34,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:16:34,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:16:34,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:34" (1/1) ... [2024-10-11 09:16:34,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:34" (1/1) ... [2024-10-11 09:16:34,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:34" (1/1) ... [2024-10-11 09:16:34,473 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 09:16:34,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:34" (1/1) ... [2024-10-11 09:16:34,478 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:34" (1/1) ... [2024-10-11 09:16:34,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:34" (1/1) ... [2024-10-11 09:16:34,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:34" (1/1) ... [2024-10-11 09:16:34,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:34" (1/1) ... [2024-10-11 09:16:34,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:34" (1/1) ... [2024-10-11 09:16:34,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:16:34,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:16:34,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:16:34,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:16:34,519 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:34" (1/1) ... [2024-10-11 09:16:34,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:16:34,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:16:34,564 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 09:16:34,567 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 09:16:34,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:16:34,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:16:34,618 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:16:34,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:16:34,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:16:34,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:16:34,725 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:16:34,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:16:35,155 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 09:16:35,156 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:16:35,188 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:16:35,189 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:16:35,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:16:35 BoogieIcfgContainer [2024-10-11 09:16:35,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:16:35,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:16:35,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:16:35,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:16:35,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:16:33" (1/3) ... [2024-10-11 09:16:35,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530ddf73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:16:35, skipping insertion in model container [2024-10-11 09:16:35,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:34" (2/3) ... [2024-10-11 09:16:35,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530ddf73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:16:35, skipping insertion in model container [2024-10-11 09:16:35,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:16:35" (3/3) ... [2024-10-11 09:16:35,202 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-30.i [2024-10-11 09:16:35,218 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:16:35,218 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:16:35,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:16:35,292 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;@1793783e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:16:35,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:16:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 66 states have internal predecessors, (100), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:16:35,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 09:16:35,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:16:35,317 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:35,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:16:35,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:16:35,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1709465317, now seen corresponding path program 1 times [2024-10-11 09:16:35,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:16:35,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436640859] [2024-10-11 09:16:35,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:35,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:16:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:16:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:16:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:16:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:16:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:16:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:16:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:16:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:16:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:16:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:16:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:16:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 09:16:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:16:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:16:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:16:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 09:16:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:16:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 09:16:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:16:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:16:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 09:16:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 09:16:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 09:16:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 09:16:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 09:16:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 09:16:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:16:35,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:16:35,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436640859] [2024-10-11 09:16:35,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436640859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:16:35,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:16:35,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:16:35,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464077005] [2024-10-11 09:16:35,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:16:35,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:16:35,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:16:35,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:16:35,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:16:35,944 INFO L87 Difference]: Start difference. First operand has 94 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 66 states have internal predecessors, (100), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 09:16:36,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:16:36,001 INFO L93 Difference]: Finished difference Result 185 states and 328 transitions. [2024-10-11 09:16:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:16:36,004 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 173 [2024-10-11 09:16:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:16:36,012 INFO L225 Difference]: With dead ends: 185 [2024-10-11 09:16:36,012 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 09:16:36,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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 09:16:36,020 INFO L432 NwaCegarLoop]: 144 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, 144 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 09:16:36,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:16:36,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 09:16:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 09:16:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:16:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 147 transitions. [2024-10-11 09:16:36,134 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 147 transitions. Word has length 173 [2024-10-11 09:16:36,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:16:36,135 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 147 transitions. [2024-10-11 09:16:36,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 09:16:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 147 transitions. [2024-10-11 09:16:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 09:16:36,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:16:36,140 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:36,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:16:36,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:16:36,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:16:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash 38501143, now seen corresponding path program 1 times [2024-10-11 09:16:36,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:16:36,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719170837] [2024-10-11 09:16:36,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:36,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:16:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:16:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:16:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:16:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:16:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:16:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:16:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:16:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:16:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:16:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:16:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:16:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 09:16:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:16:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:16:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:16:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 09:16:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:16:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 09:16:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:16:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:16:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 09:16:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 09:16:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 09:16:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 09:16:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 09:16:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 09:16:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:16:36,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:16:36,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719170837] [2024-10-11 09:16:36,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719170837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:16:36,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:16:36,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:16:36,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794993909] [2024-10-11 09:16:36,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:16:36,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:16:36,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:16:36,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:16:36,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:16:36,480 INFO L87 Difference]: Start difference. First operand 92 states and 147 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:16:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:16:36,575 INFO L93 Difference]: Finished difference Result 271 states and 433 transitions. [2024-10-11 09:16:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:16:36,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-10-11 09:16:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:16:36,580 INFO L225 Difference]: With dead ends: 271 [2024-10-11 09:16:36,580 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 09:16:36,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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 09:16:36,584 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 122 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:16:36,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 349 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:16:36,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 09:16:36,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2024-10-11 09:16:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 123 states have (on average 1.4390243902439024) internal successors, (177), 123 states have internal predecessors, (177), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 09:16:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 281 transitions. [2024-10-11 09:16:36,640 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 281 transitions. Word has length 173 [2024-10-11 09:16:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:16:36,641 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 281 transitions. [2024-10-11 09:16:36,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:16:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 281 transitions. [2024-10-11 09:16:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 09:16:36,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:16:36,647 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:36,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:16:36,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:16:36,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:16:36,649 INFO L85 PathProgramCache]: Analyzing trace with hash -770845483, now seen corresponding path program 1 times [2024-10-11 09:16:36,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:16:36,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85615899] [2024-10-11 09:16:36,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:36,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:16:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:16:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:16:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:36,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:16:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:16:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:16:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:16:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:16:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:16:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:16:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:16:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:16:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 09:16:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:16:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:16:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:16:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 09:16:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:16:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 09:16:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:16:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:16:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 09:16:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 09:16:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 09:16:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 09:16:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 09:16:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 09:16:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:16:37,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:16:37,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85615899] [2024-10-11 09:16:37,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85615899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:16:37,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:16:37,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:16:37,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801137741] [2024-10-11 09:16:37,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:16:37,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:16:37,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:16:37,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:16:37,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:16:37,152 INFO L87 Difference]: Start difference. First operand 178 states and 281 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:16:37,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:16:37,415 INFO L93 Difference]: Finished difference Result 519 states and 827 transitions. [2024-10-11 09:16:37,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:16:37,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-10-11 09:16:37,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:16:37,420 INFO L225 Difference]: With dead ends: 519 [2024-10-11 09:16:37,421 INFO L226 Difference]: Without dead ends: 342 [2024-10-11 09:16:37,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 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 09:16:37,425 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 162 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:16:37,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 467 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:16:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-11 09:16:37,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 267. [2024-10-11 09:16:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 185 states have (on average 1.427027027027027) internal successors, (264), 185 states have internal predecessors, (264), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 09:16:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 420 transitions. [2024-10-11 09:16:37,484 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 420 transitions. Word has length 173 [2024-10-11 09:16:37,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:16:37,485 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 420 transitions. [2024-10-11 09:16:37,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:16:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 420 transitions. [2024-10-11 09:16:37,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-11 09:16:37,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:16:37,489 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:37,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:16:37,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:16:37,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:16:37,490 INFO L85 PathProgramCache]: Analyzing trace with hash -48175448, now seen corresponding path program 1 times [2024-10-11 09:16:37,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:16:37,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552539392] [2024-10-11 09:16:37,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:37,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:16:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:16:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:16:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:16:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:16:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:16:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:16:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:16:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:16:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:16:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:16:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:16:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 09:16:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:16:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:16:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:16:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 09:16:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:16:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 09:16:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:16:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:16:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 09:16:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 09:16:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 09:16:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 09:16:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:37,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 09:16:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 09:16:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:38,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-11 09:16:38,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:16:38,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552539392] [2024-10-11 09:16:38,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552539392] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:16:38,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273243712] [2024-10-11 09:16:38,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:38,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:16:38,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:16:38,010 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 09:16:38,012 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 09:16:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:38,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 09:16:38,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:16:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 52 proven. 144 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:16:39,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:16:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-11 09:16:39,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273243712] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:16:39,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:16:39,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-10-11 09:16:39,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555516751] [2024-10-11 09:16:39,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:16:39,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 09:16:39,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:16:39,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 09:16:39,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 09:16:39,590 INFO L87 Difference]: Start difference. First operand 267 states and 420 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) [2024-10-11 09:16:40,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:16:40,113 INFO L93 Difference]: Finished difference Result 419 states and 650 transitions. [2024-10-11 09:16:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 09:16:40,114 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) Word has length 174 [2024-10-11 09:16:40,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:16:40,116 INFO L225 Difference]: With dead ends: 419 [2024-10-11 09:16:40,117 INFO L226 Difference]: Without dead ends: 242 [2024-10-11 09:16:40,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 392 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2024-10-11 09:16:40,119 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 463 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:16:40,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 427 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:16:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-11 09:16:40,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 197. [2024-10-11 09:16:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 138 states have (on average 1.3695652173913044) internal successors, (189), 138 states have internal predecessors, (189), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 09:16:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 293 transitions. [2024-10-11 09:16:40,187 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 293 transitions. Word has length 174 [2024-10-11 09:16:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:16:40,188 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 293 transitions. [2024-10-11 09:16:40,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) [2024-10-11 09:16:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 293 transitions. [2024-10-11 09:16:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 09:16:40,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:16:40,191 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:40,211 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 09:16:40,392 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 09:16:40,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:16:40,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:16:40,395 INFO L85 PathProgramCache]: Analyzing trace with hash -775153347, now seen corresponding path program 1 times [2024-10-11 09:16:40,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:16:40,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261987497] [2024-10-11 09:16:40,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:40,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:16:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:16:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:16:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:16:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:16:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:16:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:16:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:16:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:16:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:16:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:16:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:16:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 09:16:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:16:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:16:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:16:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 09:16:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:16:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 09:16:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:16:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:16:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 09:16:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 09:16:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 09:16:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 09:16:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 09:16:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 09:16:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:16:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:16:40,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:16:40,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261987497] [2024-10-11 09:16:40,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261987497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:16:40,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:16:40,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:16:40,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117453223] [2024-10-11 09:16:40,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:16:40,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:16:40,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:16:40,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:16:40,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:16:40,569 INFO L87 Difference]: Start difference. First operand 197 states and 293 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:16:40,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:16:40,634 INFO L93 Difference]: Finished difference Result 393 states and 585 transitions. [2024-10-11 09:16:40,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:16:40,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-10-11 09:16:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:16:40,639 INFO L225 Difference]: With dead ends: 393 [2024-10-11 09:16:40,639 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 09:16:40,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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 09:16:40,641 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:16:40,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:16:40,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 09:16:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-10-11 09:16:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 138 states have (on average 1.355072463768116) internal successors, (187), 138 states have internal predecessors, (187), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 09:16:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 291 transitions. [2024-10-11 09:16:40,683 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 291 transitions. Word has length 175 [2024-10-11 09:16:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:16:40,684 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 291 transitions. [2024-10-11 09:16:40,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:16:40,684 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 291 transitions. [2024-10-11 09:16:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 09:16:40,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:16:40,686 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:40,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:16:40,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:16:40,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:16:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2139314059, now seen corresponding path program 1 times [2024-10-11 09:16:40,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:16:40,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53537248] [2024-10-11 09:16:40,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:16:40,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:16:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:16:40,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:16:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:16:40,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:16:40,878 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:16:40,879 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:16:40,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 09:16:40,885 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 09:16:41,027 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:16:41,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:16:41 BoogieIcfgContainer [2024-10-11 09:16:41,031 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:16:41,031 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:16:41,031 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:16:41,031 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:16:41,032 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:16:35" (3/4) ... [2024-10-11 09:16:41,034 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:16:41,035 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:16:41,036 INFO L158 Benchmark]: Toolchain (without parser) took 7164.12ms. Allocated memory was 163.6MB in the beginning and 249.6MB in the end (delta: 86.0MB). Free memory was 89.7MB in the beginning and 79.8MB in the end (delta: 9.9MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. [2024-10-11 09:16:41,036 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:16:41,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.98ms. Allocated memory is still 163.6MB. Free memory was 89.5MB in the beginning and 131.1MB in the end (delta: -41.6MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-10-11 09:16:41,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.25ms. Allocated memory was 163.6MB in the beginning and 207.6MB in the end (delta: 44.0MB). Free memory was 131.1MB in the beginning and 177.7MB in the end (delta: -46.6MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-10-11 09:16:41,037 INFO L158 Benchmark]: Boogie Preprocessor took 104.26ms. Allocated memory is still 207.6MB. Free memory was 177.7MB in the beginning and 174.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:16:41,037 INFO L158 Benchmark]: RCFGBuilder took 673.62ms. Allocated memory is still 207.6MB. Free memory was 174.4MB in the beginning and 148.4MB in the end (delta: 26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 09:16:41,037 INFO L158 Benchmark]: TraceAbstraction took 5835.19ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 147.3MB in the beginning and 79.8MB in the end (delta: 67.5MB). Peak memory consumption was 109.5MB. Max. memory is 16.1GB. [2024-10-11 09:16:41,037 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 249.6MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:16:41,039 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.18ms. Allocated memory is still 163.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.98ms. Allocated memory is still 163.6MB. Free memory was 89.5MB in the beginning and 131.1MB in the end (delta: -41.6MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.25ms. Allocated memory was 163.6MB in the beginning and 207.6MB in the end (delta: 44.0MB). Free memory was 131.1MB in the beginning and 177.7MB in the end (delta: -46.6MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.26ms. Allocated memory is still 207.6MB. Free memory was 177.7MB in the beginning and 174.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 673.62ms. Allocated memory is still 207.6MB. Free memory was 174.4MB in the beginning and 148.4MB in the end (delta: 26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5835.19ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 147.3MB in the beginning and 79.8MB in the end (delta: 67.5MB). Peak memory consumption was 109.5MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 249.6MB. Free memory is still 79.8MB. 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 184, overapproximation of someBinaryArithmeticDOUBLEoperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 204, overapproximation of someBinaryArithmeticFLOAToperation at line 136. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] signed short int var_1_19 = -64; [L36] double var_1_21 = 100.4; [L37] signed long int var_1_24 = 10; [L38] signed char var_1_25 = -8; [L39] double var_1_26 = 9.75; [L40] signed char var_1_28 = 8; [L41] unsigned long int var_1_29 = 16; [L42] unsigned long int var_1_30 = 1; [L43] float var_1_31 = 16.6; [L44] float var_1_33 = 0.25; [L45] float var_1_34 = 99.8; [L46] signed short int var_1_35 = 256; [L47] unsigned long int var_1_36 = 16; [L48] double var_1_37 = 8.5; [L49] unsigned long int var_1_38 = 3569725445; [L50] unsigned long int var_1_39 = 3551809449; [L51] unsigned long int var_1_40 = 10000000; [L52] unsigned char last_1_var_1_1 = 1; [L53] signed long int last_1_var_1_11 = -2; [L54] signed long int last_1_var_1_15 = 1000; [L55] double last_1_var_1_16 = 0.2; [L208] isInitial = 1 [L209] FCALL initially() [L210] COND TRUE 1 [L211] CALL updateLastVariables() [L198] last_1_var_1_1 = var_1_1 [L199] last_1_var_1_11 = var_1_11 [L200] last_1_var_1_15 = var_1_15 [L201] last_1_var_1_16 = var_1_16 [L211] RET updateLastVariables() [L212] CALL updateVariables() [L153] var_1_4 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L154] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L155] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L155] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L156] var_1_7 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L157] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L158] var_1_10 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L159] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L160] var_1_13 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L161] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L162] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L162] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L163] var_1_14 = __VERIFIER_nondet_long() [L164] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L164] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L165] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L165] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L166] var_1_17 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L167] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L168] var_1_18 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L169] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L170] var_1_21 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L171] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L172] var_1_26 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L173] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L174] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L174] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L175] var_1_28 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L176] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L177] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L177] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L178] var_1_30 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L179] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L180] CALL assume_abort_if_not(var_1_30 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L180] RET assume_abort_if_not(var_1_30 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_33=1/4, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L181] var_1_33 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L182] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_34=499/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L183] var_1_34 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L184] RET assume_abort_if_not((var_1_34 >= -922337.2036854765600e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L185] var_1_37 = __VERIFIER_nondet_double() [L186] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L186] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L187] var_1_38 = __VERIFIER_nondet_ulong() [L188] CALL assume_abort_if_not(var_1_38 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L188] RET assume_abort_if_not(var_1_38 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L189] CALL assume_abort_if_not(var_1_38 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L189] RET assume_abort_if_not(var_1_38 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=3551809449, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L190] var_1_39 = __VERIFIER_nondet_ulong() [L191] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L191] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L192] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L192] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=10000000, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L193] var_1_40 = __VERIFIER_nondet_ulong() [L194] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L194] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L195] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L195] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L212] RET updateVariables() [L213] CALL step() [L59] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L60] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L61] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L66] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L67] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L68] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=-255, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L70] signed long int stepLocal_2 = var_1_11; [L71] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=-255, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L72] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=-255, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L73] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=-255, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L74] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L75] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=-255, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L81] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=-255, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L81] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L92] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_16=1/5, var_1_19=-64, var_1_1=-255, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L94] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L95] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-64, var_1_1=-255, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L99] COND FALSE !(10.55f < var_1_16) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-64, var_1_1=-255, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=5/4] [L104] COND TRUE var_1_16 > var_1_7 [L105] var_1_8 = var_1_10 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-64, var_1_1=-255, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L110] COND TRUE (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) - var_1_21) == (var_1_8 * var_1_16) [L111] var_1_19 = -4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=10, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L113] var_1_24 = var_1_11 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=0, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L114] COND TRUE var_1_21 != var_1_5 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=0, var_1_25=-8, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L115] COND TRUE var_1_5 < (var_1_5 / var_1_26) [L116] var_1_25 = ((((4) < 0 ) ? -(4) : (4))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=0, var_1_25=4, var_1_28=-127, var_1_29=16, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L127] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=0, var_1_25=4, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L128] COND FALSE !(var_1_16 > var_1_16) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=0, var_1_25=4, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L135] COND TRUE \read(var_1_1) [L136] var_1_31 = ((((((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))) < 0 ) ? -((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))) : ((((var_1_33) < (var_1_34)) ? (var_1_33) : (var_1_34))))) - 256.35f) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=0, var_1_25=4, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L139] COND FALSE !(! ((1 + var_1_11) <= var_1_15)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=0, var_1_25=4, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L144] COND FALSE !(var_1_21 < var_1_5) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=0, var_1_25=4, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L213] RET step() [L214] CALL, EXPR property() [L204] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=0, var_1_25=4, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L204-L205] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L214] RET, EXPR property() [L214] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=0, var_1_25=4, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=-1, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=0, var_1_25=4, var_1_28=-127, var_1_29=-2, var_1_30=-2, var_1_35=256, var_1_36=16, var_1_38=4294967294, var_1_39=4294967294, var_1_40=0, var_1_4=-255, var_1_5=100000000000005, var_1_7=100000000000005, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 748 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 747 mSDsluCounter, 1635 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 833 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 406 IncrementalHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 802 mSDtfsCounter, 406 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 665 GetRequests, 635 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=267occurred in iteration=3, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 122 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1218 NumberOfCodeBlocks, 1218 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1209 ConstructedInterpolants, 0 QuantifiedInterpolants, 4263 SizeOfPredicates, 3 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 8806/9100 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 09:16:41,082 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_fillercodestructure_filler-pe-co_file-30.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 641285a7f142375d2fe4c09d97137238c35a52e1a89408c5b7047a07a2270bcc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:16:43,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:16:43,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:16:43,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:16:43,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:16:43,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:16:43,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:16:43,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:16:43,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:16:43,506 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:16:43,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:16:43,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:16:43,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:16:43,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:16:43,510 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:16:43,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:16:43,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:16:43,512 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:16:43,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:16:43,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:16:43,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:16:43,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:16:43,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:16:43,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:16:43,516 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:16:43,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:16:43,517 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:16:43,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:16:43,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:16:43,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:16:43,518 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:16:43,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:16:43,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:16:43,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:16:43,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:16:43,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:16:43,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:16:43,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:16:43,521 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:16:43,521 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:16:43,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:16:43,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:16:43,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:16:43,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:16:43,523 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:16:43,523 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 -> 641285a7f142375d2fe4c09d97137238c35a52e1a89408c5b7047a07a2270bcc [2024-10-11 09:16:43,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:16:43,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:16:43,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:16:43,886 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:16:43,886 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:16:43,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-30.i [2024-10-11 09:16:45,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:16:45,720 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:16:45,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-30.i [2024-10-11 09:16:45,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/43a06fdbe/439c9bd4a93c4e9ebf68419b63078cc5/FLAG462f76b5b [2024-10-11 09:16:45,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/43a06fdbe/439c9bd4a93c4e9ebf68419b63078cc5 [2024-10-11 09:16:45,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:16:45,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:16:45,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:16:45,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:16:45,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:16:45,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:16:45" (1/1) ... [2024-10-11 09:16:45,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72df70dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:45, skipping insertion in model container [2024-10-11 09:16:45,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:16:45" (1/1) ... [2024-10-11 09:16:45,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:16:45,996 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_fillercodestructure_filler-pe-co_file-30.i[919,932] [2024-10-11 09:16:46,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:16:46,123 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:16:46,135 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_fillercodestructure_filler-pe-co_file-30.i[919,932] [2024-10-11 09:16:46,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:16:46,212 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:16:46,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:46 WrapperNode [2024-10-11 09:16:46,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:16:46,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:16:46,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:16:46,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:16:46,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:46" (1/1) ... [2024-10-11 09:16:46,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:46" (1/1) ... [2024-10-11 09:16:46,273 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-10-11 09:16:46,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:16:46,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:16:46,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:16:46,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:16:46,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:46" (1/1) ... [2024-10-11 09:16:46,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:46" (1/1) ... [2024-10-11 09:16:46,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:46" (1/1) ... [2024-10-11 09:16:46,324 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 09:16:46,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:46" (1/1) ... [2024-10-11 09:16:46,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:46" (1/1) ... [2024-10-11 09:16:46,345 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:46" (1/1) ... [2024-10-11 09:16:46,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:46" (1/1) ... [2024-10-11 09:16:46,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:46" (1/1) ... [2024-10-11 09:16:46,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:46" (1/1) ... [2024-10-11 09:16:46,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:16:46,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:16:46,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:16:46,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:16:46,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:46" (1/1) ... [2024-10-11 09:16:46,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:16:46,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:16:46,423 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 09:16:46,426 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 09:16:46,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:16:46,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:16:46,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:16:46,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:16:46,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:16:46,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:16:46,555 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:16:46,557 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:17:14,099 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 09:17:14,100 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:17:14,142 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:17:14,143 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:17:14,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:17:14 BoogieIcfgContainer [2024-10-11 09:17:14,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:17:14,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:17:14,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:17:14,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:17:14,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:16:45" (1/3) ... [2024-10-11 09:17:14,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d18ff1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:17:14, skipping insertion in model container [2024-10-11 09:17:14,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:16:46" (2/3) ... [2024-10-11 09:17:14,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d18ff1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:17:14, skipping insertion in model container [2024-10-11 09:17:14,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:17:14" (3/3) ... [2024-10-11 09:17:14,152 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-30.i [2024-10-11 09:17:14,171 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:17:14,171 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:17:14,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:17:14,256 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;@496342cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:17:14,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:17:14,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 57 states have internal predecessors, (86), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:17:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 09:17:14,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:17:14,299 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:17:14,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:17:14,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:17:14,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1057240753, now seen corresponding path program 1 times [2024-10-11 09:17:14,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:17:14,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183482218] [2024-10-11 09:17:14,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:17:14,324 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 09:17:14,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:17:14,329 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 09:17:14,331 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 09:17:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:17:15,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:17:15,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:17:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-10-11 09:17:15,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:17:15,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:17:15,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183482218] [2024-10-11 09:17:15,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183482218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:17:15,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:17:15,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:17:15,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527151964] [2024-10-11 09:17:15,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:17:15,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:17:15,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:17:15,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:17:15,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:17:15,919 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 57 states have internal predecessors, (86), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 09:17:20,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:17:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:17:20,161 INFO L93 Difference]: Finished difference Result 165 states and 296 transitions. [2024-10-11 09:17:20,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:17:20,212 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2024-10-11 09:17:20,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:17:20,218 INFO L225 Difference]: With dead ends: 165 [2024-10-11 09:17:20,218 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 09:17:20,221 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 09:17:20,224 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:17:20,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 09:17:20,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 09:17:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 09:17:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:17:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 128 transitions. [2024-10-11 09:17:20,280 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 128 transitions. Word has length 170 [2024-10-11 09:17:20,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:17:20,280 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 128 transitions. [2024-10-11 09:17:20,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 09:17:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 128 transitions. [2024-10-11 09:17:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 09:17:20,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:17:20,291 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:17:20,332 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 09:17:20,494 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 09:17:20,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:17:20,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:17:20,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1380384309, now seen corresponding path program 1 times [2024-10-11 09:17:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:17:20,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560536871] [2024-10-11 09:17:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:17:20,499 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 09:17:20,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:17:20,500 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 09:17:20,501 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 09:17:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:17:21,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 09:17:21,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:17:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:17:25,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:17:25,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:17:25,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560536871] [2024-10-11 09:17:25,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560536871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:17:25,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:17:25,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:17:25,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930863377] [2024-10-11 09:17:25,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:17:25,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:17:25,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:17:25,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:17:25,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:17:25,186 INFO L87 Difference]: Start difference. First operand 81 states and 128 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:17:29,991 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 09:17:32,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:17:37,334 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 09:17:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:17:37,335 INFO L93 Difference]: Finished difference Result 270 states and 430 transitions. [2024-10-11 09:17:37,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:17:37,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-10-11 09:17:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:17:37,390 INFO L225 Difference]: With dead ends: 270 [2024-10-11 09:17:37,391 INFO L226 Difference]: Without dead ends: 190 [2024-10-11 09:17:37,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:17:37,393 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 122 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:17:37,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 399 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 12.0s Time] [2024-10-11 09:17:37,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-11 09:17:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 159. [2024-10-11 09:17:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 104 states have internal predecessors, (145), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 09:17:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 249 transitions. [2024-10-11 09:17:37,427 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 249 transitions. Word has length 170 [2024-10-11 09:17:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:17:37,428 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 249 transitions. [2024-10-11 09:17:37,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:17:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 249 transitions. [2024-10-11 09:17:37,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 09:17:37,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:17:37,431 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:17:37,473 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 09:17:37,631 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 09:17:37,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:17:37,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:17:37,633 INFO L85 PathProgramCache]: Analyzing trace with hash -885398078, now seen corresponding path program 1 times [2024-10-11 09:17:37,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:17:37,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798282127] [2024-10-11 09:17:37,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:17:37,634 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 09:17:37,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:17:37,639 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 09:17:37,640 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 09:17:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:17:38,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:17:38,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:17:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 52 proven. 144 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:17:45,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:17:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-11 09:17:48,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:17:48,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798282127] [2024-10-11 09:17:48,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798282127] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:17:48,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:17:48,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-10-11 09:17:48,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695411731] [2024-10-11 09:17:48,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:17:48,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 09:17:48,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:17:48,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 09:17:48,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 09:17:48,422 INFO L87 Difference]: Start difference. First operand 159 states and 249 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) [2024-10-11 09:17:54,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:17:58,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:17:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:17:58,503 INFO L93 Difference]: Finished difference Result 260 states and 393 transitions. [2024-10-11 09:17:58,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 09:17:58,505 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) Word has length 171 [2024-10-11 09:17:58,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:17:58,508 INFO L225 Difference]: With dead ends: 260 [2024-10-11 09:17:58,508 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 09:17:58,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 331 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2024-10-11 09:17:58,511 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 188 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-10-11 09:17:58,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 284 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2024-10-11 09:17:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 09:17:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2024-10-11 09:17:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 116 states have internal predecessors, (153), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 09:17:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 257 transitions. [2024-10-11 09:17:58,548 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 257 transitions. Word has length 171 [2024-10-11 09:17:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:17:58,549 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 257 transitions. [2024-10-11 09:17:58,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 2 states have call predecessors, (52), 3 states have call successors, (52) [2024-10-11 09:17:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 257 transitions. [2024-10-11 09:17:58,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 09:17:58,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:17:58,553 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:17:58,598 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 09:17:58,753 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 09:17:58,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:17:58,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:17:58,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1179095503, now seen corresponding path program 1 times [2024-10-11 09:17:58,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:17:58,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491223028] [2024-10-11 09:17:58,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:17:58,755 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 09:17:58,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:17:58,758 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 09:17:58,761 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 09:17:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:18:00,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 09:18:00,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:18:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:18:00,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:18:00,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:18:00,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491223028] [2024-10-11 09:18:00,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491223028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:18:00,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:18:00,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:18:00,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133218248] [2024-10-11 09:18:00,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:18:00,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:18:00,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:18:00,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:18:00,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:18:00,142 INFO L87 Difference]: Start difference. First operand 175 states and 257 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)