./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-pr-co_file-68.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-pr-co_file-68.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 0767bce9c4099f45ee11cd1ef676ae525a65f96727af97d4487455a7a72fa712 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:53:48,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:53:48,965 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:53:48,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:53:48,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:53:49,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:53:49,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:53:49,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:53:49,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:53:49,005 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:53:49,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:53:49,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:53:49,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:53:49,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:53:49,008 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:53:49,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:53:49,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:53:49,009 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:53:49,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:53:49,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:53:49,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:53:49,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:53:49,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:53:49,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:53:49,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:53:49,016 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:53:49,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:53:49,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:53:49,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:53:49,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:53:49,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:53:49,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:53:49,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:53:49,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:53:49,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:53:49,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:53:49,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:53:49,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:53:49,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:53:49,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:53:49,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:53:49,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:53:49,021 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 -> 0767bce9c4099f45ee11cd1ef676ae525a65f96727af97d4487455a7a72fa712 [2024-10-11 09:53:49,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:53:49,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:53:49,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:53:49,299 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:53:49,299 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:53:49,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-68.i [2024-10-11 09:53:50,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:53:51,035 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:53:51,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-68.i [2024-10-11 09:53:51,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc879167d/86f07f9b9ef047f79dd5a56829a82356/FLAG2680d698f [2024-10-11 09:53:51,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fc879167d/86f07f9b9ef047f79dd5a56829a82356 [2024-10-11 09:53:51,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:53:51,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:53:51,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:53:51,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:53:51,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:53:51,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:53:51" (1/1) ... [2024-10-11 09:53:51,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534e7c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:53:51, skipping insertion in model container [2024-10-11 09:53:51,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:53:51" (1/1) ... [2024-10-11 09:53:51,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:53:51,331 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-pr-co_file-68.i[919,932] [2024-10-11 09:53:51,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:53:51,410 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:53:51,420 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-pr-co_file-68.i[919,932] [2024-10-11 09:53:51,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:53:51,472 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:53:51,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:53:51 WrapperNode [2024-10-11 09:53:51,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:53:51,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:53:51,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:53:51,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:53:51,480 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:53:51" (1/1) ... [2024-10-11 09:53:51,493 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:53:51" (1/1) ... [2024-10-11 09:53:51,538 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2024-10-11 09:53:51,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:53:51,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:53:51,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:53:51,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:53:51,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:53:51" (1/1) ... [2024-10-11 09:53:51,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:53:51" (1/1) ... [2024-10-11 09:53:51,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:53:51" (1/1) ... [2024-10-11 09:53:51,584 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:53:51,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:53:51" (1/1) ... [2024-10-11 09:53:51,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:53:51" (1/1) ... [2024-10-11 09:53:51,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:53:51" (1/1) ... [2024-10-11 09:53:51,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:53:51" (1/1) ... [2024-10-11 09:53:51,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:53:51" (1/1) ... [2024-10-11 09:53:51,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:53:51" (1/1) ... [2024-10-11 09:53:51,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:53:51,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:53:51,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:53:51,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:53:51,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:53:51" (1/1) ... [2024-10-11 09:53:51,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:53:51,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:53:51,649 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:53:51,652 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:53:51,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:53:51,700 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:53:51,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:53:51,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:53:51,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:53:51,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:53:51,800 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:53:51,802 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:53:52,244 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-11 09:53:52,245 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:53:52,289 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:53:52,289 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:53:52,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:53:52 BoogieIcfgContainer [2024-10-11 09:53:52,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:53:52,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:53:52,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:53:52,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:53:52,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:53:51" (1/3) ... [2024-10-11 09:53:52,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc54a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:53:52, skipping insertion in model container [2024-10-11 09:53:52,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:53:51" (2/3) ... [2024-10-11 09:53:52,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc54a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:53:52, skipping insertion in model container [2024-10-11 09:53:52,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:53:52" (3/3) ... [2024-10-11 09:53:52,298 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-68.i [2024-10-11 09:53:52,315 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:53:52,315 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:53:52,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:53:52,389 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;@5384f07a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:53:52,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:53:52,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 69 states have internal predecessors, (105), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:53:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 09:53:52,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:53:52,410 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:52,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:53:52,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:53:52,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2125083251, now seen corresponding path program 1 times [2024-10-11 09:53:52,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:53:52,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95613657] [2024-10-11 09:53:52,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:53:52,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:53:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:53:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:53:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:53:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:53:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:53:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:53:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:53:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:53:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:53:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:53:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:53:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:53:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:53:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:53:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:53:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:53:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:53:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:53:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:53:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:53:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:53:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:53:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:52,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:53:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:53:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:53:53,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:53:53,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95613657] [2024-10-11 09:53:53,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95613657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:53:53,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:53:53,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:53:53,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198499651] [2024-10-11 09:53:53,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:53:53,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:53:53,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:53:53,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:53:53,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:53:53,063 INFO L87 Difference]: Start difference. First operand has 95 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 69 states have internal predecessors, (105), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:53:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:53:53,122 INFO L93 Difference]: Finished difference Result 185 states and 326 transitions. [2024-10-11 09:53:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:53:53,126 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-10-11 09:53:53,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:53:53,135 INFO L225 Difference]: With dead ends: 185 [2024-10-11 09:53:53,135 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 09:53:53,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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:53:53,147 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:53:53,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:53:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 09:53:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 09:53:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.476923076923077) internal successors, (96), 65 states have internal predecessors, (96), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:53:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 144 transitions. [2024-10-11 09:53:53,198 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 144 transitions. Word has length 161 [2024-10-11 09:53:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:53:53,199 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 144 transitions. [2024-10-11 09:53:53,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:53:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 144 transitions. [2024-10-11 09:53:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 09:53:53,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:53:53,207 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:53,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:53:53,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:53:53,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:53:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1079483251, now seen corresponding path program 1 times [2024-10-11 09:53:53,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:53:53,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567491847] [2024-10-11 09:53:53,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:53:53,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:53:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:53:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:53:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:53:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:53:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:53:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:53:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:53:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:53:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:53:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:53:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:53:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:53:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:53:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:53:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:53:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:53:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:53:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:53:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:53:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:53:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:53:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:53:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:53:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:53:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:53:53,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:53:53,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567491847] [2024-10-11 09:53:53,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567491847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:53:53,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:53:53,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:53:53,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412297293] [2024-10-11 09:53:53,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:53:53,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:53:53,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:53:53,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:53:53,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:53:53,785 INFO L87 Difference]: Start difference. First operand 91 states and 144 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:53:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:53:53,997 INFO L93 Difference]: Finished difference Result 181 states and 287 transitions. [2024-10-11 09:53:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:53:53,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-11 09:53:53,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:53:54,000 INFO L225 Difference]: With dead ends: 181 [2024-10-11 09:53:54,000 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 09:53:54,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:53:54,005 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 130 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:53:54,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 198 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:53:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 09:53:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 09:53:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 65 states have internal predecessors, (95), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:53:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 143 transitions. [2024-10-11 09:53:54,029 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 143 transitions. Word has length 161 [2024-10-11 09:53:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:53:54,033 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 143 transitions. [2024-10-11 09:53:54,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:53:54,034 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 143 transitions. [2024-10-11 09:53:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 09:53:54,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:53:54,039 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:54,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:53:54,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:53:54,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:53:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash 775835181, now seen corresponding path program 1 times [2024-10-11 09:53:54,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:53:54,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513984427] [2024-10-11 09:53:54,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:53:54,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:53:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:53:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:53:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:53:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:53:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:53:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:53:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:53:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:53:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:53:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:53:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:53:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:53:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:53:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:53:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:53:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:53:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:53:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:53:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:53:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:53:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:53:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:53:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:53:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:53:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:53:54,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:53:54,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513984427] [2024-10-11 09:53:54,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513984427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:53:54,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:53:54,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 09:53:54,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087172717] [2024-10-11 09:53:54,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:53:54,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 09:53:54,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:53:54,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 09:53:54,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:53:54,362 INFO L87 Difference]: Start difference. First operand 91 states and 143 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:53:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:53:54,563 INFO L93 Difference]: Finished difference Result 187 states and 296 transitions. [2024-10-11 09:53:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 09:53:54,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-10-11 09:53:54,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:53:54,566 INFO L225 Difference]: With dead ends: 187 [2024-10-11 09:53:54,566 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 09:53:54,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:53:54,568 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 160 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:53:54,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 422 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:53:54,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 09:53:54,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-10-11 09:53:54,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 69 states have internal predecessors, (102), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:53:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 150 transitions. [2024-10-11 09:53:54,591 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 150 transitions. Word has length 162 [2024-10-11 09:53:54,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:53:54,591 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 150 transitions. [2024-10-11 09:53:54,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:53:54,592 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 150 transitions. [2024-10-11 09:53:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 09:53:54,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:53:54,598 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:54,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:53:54,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:53:54,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:53:54,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1198537007, now seen corresponding path program 1 times [2024-10-11 09:53:54,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:53:54,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141623407] [2024-10-11 09:53:54,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:53:54,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:53:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:53:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:53:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:53:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:53:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:53:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:53:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:53:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:53:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:53:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:53:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:53:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:53:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:53:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:53:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:53:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:53:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:53:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:53:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:53:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:53:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:53:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:53:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:53:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:53:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:53:55,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:53:55,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141623407] [2024-10-11 09:53:55,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141623407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:53:55,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:53:55,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 09:53:55,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440444801] [2024-10-11 09:53:55,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:53:55,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 09:53:55,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:53:55,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 09:53:55,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:53:55,903 INFO L87 Difference]: Start difference. First operand 95 states and 150 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:53:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:53:56,722 INFO L93 Difference]: Finished difference Result 375 states and 587 transitions. [2024-10-11 09:53:56,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 09:53:56,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 162 [2024-10-11 09:53:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:53:56,727 INFO L225 Difference]: With dead ends: 375 [2024-10-11 09:53:56,730 INFO L226 Difference]: Without dead ends: 281 [2024-10-11 09:53:56,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-11 09:53:56,733 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 446 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:53:56,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 683 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 09:53:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-11 09:53:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 166. [2024-10-11 09:53:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 114 states have (on average 1.4473684210526316) internal successors, (165), 114 states have internal predecessors, (165), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 09:53:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 261 transitions. [2024-10-11 09:53:56,766 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 261 transitions. Word has length 162 [2024-10-11 09:53:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:53:56,766 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 261 transitions. [2024-10-11 09:53:56,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:53:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 261 transitions. [2024-10-11 09:53:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 09:53:56,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:53:56,769 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:56,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:53:56,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:53:56,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:53:56,772 INFO L85 PathProgramCache]: Analyzing trace with hash 69964484, now seen corresponding path program 1 times [2024-10-11 09:53:56,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:53:56,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164774748] [2024-10-11 09:53:56,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:53:56,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:53:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:53:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:53:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:53:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:53:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:53:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:53:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:53:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:53:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:53:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:53:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:53:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:53:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:53:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:53:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:53:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:53:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:53:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:53:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:53:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:53:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:53:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:53:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:53:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:53:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 09:53:57,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:53:57,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164774748] [2024-10-11 09:53:57,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164774748] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:53:57,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201777421] [2024-10-11 09:53:57,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:53:57,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:53:57,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:53:57,301 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:53:57,302 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:53:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:53:57,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 09:53:57,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:53:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 195 proven. 63 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2024-10-11 09:53:57,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:53:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-11 09:53:58,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201777421] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:53:58,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:53:58,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2024-10-11 09:53:58,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042698008] [2024-10-11 09:53:58,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:53:58,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 09:53:58,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:53:58,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 09:53:58,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 09:53:58,138 INFO L87 Difference]: Start difference. First operand 166 states and 261 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-11 09:53:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:53:58,812 INFO L93 Difference]: Finished difference Result 411 states and 627 transitions. [2024-10-11 09:53:58,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 09:53:58,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 163 [2024-10-11 09:53:58,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:53:58,816 INFO L225 Difference]: With dead ends: 411 [2024-10-11 09:53:58,816 INFO L226 Difference]: Without dead ends: 317 [2024-10-11 09:53:58,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 368 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2024-10-11 09:53:58,818 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 394 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:53:58,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 701 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 09:53:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-11 09:53:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 301. [2024-10-11 09:53:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 218 states have (on average 1.426605504587156) internal successors, (311), 219 states have internal predecessors, (311), 74 states have call successors, (74), 8 states have call predecessors, (74), 8 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-11 09:53:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 459 transitions. [2024-10-11 09:53:58,876 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 459 transitions. Word has length 163 [2024-10-11 09:53:58,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:53:58,878 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 459 transitions. [2024-10-11 09:53:58,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-11 09:53:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 459 transitions. [2024-10-11 09:53:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 09:53:58,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:53:58,880 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:58,904 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:53:59,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:53:59,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:53:59,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:53:59,082 INFO L85 PathProgramCache]: Analyzing trace with hash -739382142, now seen corresponding path program 1 times [2024-10-11 09:53:59,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:53:59,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143121693] [2024-10-11 09:53:59,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:53:59,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:53:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:53:59,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2069051733] [2024-10-11 09:53:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:53:59,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:53:59,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:53:59,184 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:53:59,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:53:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:53:59,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:53:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:53:59,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:53:59,508 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:53:59,510 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:53:59,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 09:53:59,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:53:59,716 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 09:53:59,859 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:53:59,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:53:59 BoogieIcfgContainer [2024-10-11 09:53:59,868 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:53:59,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:53:59,869 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:53:59,869 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:53:59,870 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:53:52" (3/4) ... [2024-10-11 09:53:59,871 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:53:59,873 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:53:59,873 INFO L158 Benchmark]: Toolchain (without parser) took 8802.00ms. Allocated memory was 155.2MB in the beginning and 245.4MB in the end (delta: 90.2MB). Free memory was 87.9MB in the beginning and 96.1MB in the end (delta: -8.2MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. [2024-10-11 09:53:59,874 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:53:59,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.43ms. Allocated memory is still 155.2MB. Free memory was 87.6MB in the beginning and 109.3MB in the end (delta: -21.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:53:59,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.19ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 104.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:53:59,874 INFO L158 Benchmark]: Boogie Preprocessor took 70.56ms. Allocated memory is still 155.2MB. Free memory was 104.4MB in the beginning and 99.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:53:59,875 INFO L158 Benchmark]: RCFGBuilder took 679.25ms. Allocated memory is still 155.2MB. Free memory was 99.6MB in the beginning and 65.3MB in the end (delta: 34.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-11 09:53:59,875 INFO L158 Benchmark]: TraceAbstraction took 7576.11ms. Allocated memory was 155.2MB in the beginning and 245.4MB in the end (delta: 90.2MB). Free memory was 64.6MB in the beginning and 96.1MB in the end (delta: -31.5MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2024-10-11 09:53:59,875 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 245.4MB. Free memory is still 96.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:53:59,876 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 100.7MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.43ms. Allocated memory is still 155.2MB. Free memory was 87.6MB in the beginning and 109.3MB in the end (delta: -21.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.19ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 104.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.56ms. Allocated memory is still 155.2MB. Free memory was 104.4MB in the beginning and 99.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 679.25ms. Allocated memory is still 155.2MB. Free memory was 99.6MB in the beginning and 65.3MB in the end (delta: 34.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7576.11ms. Allocated memory was 155.2MB in the beginning and 245.4MB in the end (delta: 90.2MB). Free memory was 64.6MB in the beginning and 96.1MB in the end (delta: -31.5MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 245.4MB. Free memory is still 96.1MB. 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 someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of bitwiseOr at line 182. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 32; [L27] double var_1_9 = 4.6; [L28] double var_1_10 = 9.25; [L29] double var_1_11 = 1.25; [L30] unsigned char var_1_12 = 100; [L31] unsigned char var_1_13 = 64; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 7.5; [L34] signed long int var_1_16 = 0; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_20 = 0; [L38] double var_1_21 = 4.65; [L39] double var_1_23 = 9999999999.1; [L40] double var_1_24 = 5.5; [L41] unsigned short int var_1_25 = 16; [L42] signed long int var_1_27 = 32; [L43] signed char var_1_31 = 32; [L44] signed char var_1_32 = 32; [L45] signed short int var_1_33 = 100; [L46] unsigned char var_1_34 = 1; [L47] double var_1_35 = 3.8; [L48] unsigned char var_1_36 = 0; [L49] signed short int var_1_37 = -256; [L50] unsigned short int var_1_38 = 4; [L51] double last_1_var_1_9 = 4.6; [L52] unsigned char last_1_var_1_12 = 100; [L53] unsigned char last_1_var_1_14 = 0; [L54] signed long int last_1_var_1_16 = 0; [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L176] last_1_var_1_9 = var_1_9 [L177] last_1_var_1_12 = var_1_12 [L178] last_1_var_1_14 = var_1_14 [L179] last_1_var_1_16 = var_1_16 [L189] RET updateLastVariables() [L190] CALL updateVariables() [L137] var_1_5 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L138] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L139] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L139] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L140] var_1_7 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L141] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L142] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L142] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L143] var_1_8 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L144] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L145] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L145] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L146] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L146] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L147] var_1_10 = __VERIFIER_nondet_double() [L148] 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_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L148] 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_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L149] var_1_13 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L150] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L151] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L151] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L152] var_1_18 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L153] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L154] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L154] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L155] var_1_20 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L156] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L157] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L157] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L158] var_1_23 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L159] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L160] var_1_24 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L161] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L162] var_1_31 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L163] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L164] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L164] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L165] var_1_32 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L166] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L167] CALL assume_abort_if_not(var_1_32 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L167] RET assume_abort_if_not(var_1_32 <= 127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L168] var_1_35 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L169] RET assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L170] CALL assume_abort_if_not(var_1_35 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L170] RET assume_abort_if_not(var_1_35 != 0.0F) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L171] var_1_36 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_36 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L172] RET assume_abort_if_not(var_1_36 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L173] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L173] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L190] RET updateVariables() [L191] CALL step() [L58] signed long int stepLocal_4 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L59] COND FALSE !(\read(last_1_var_1_14)) [L70] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L72] var_1_16 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L73] COND FALSE !(var_1_31 >= var_1_32) [L78] var_1_34 = ((var_1_24 >= (var_1_11 / var_1_35)) || var_1_36) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L80] EXPR var_1_12 | var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L80] EXPR var_1_12 ^ (var_1_12 | var_1_16) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L80] EXPR var_1_31 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L80] COND FALSE !((var_1_12 ^ (var_1_12 | var_1_16)) < (var_1_31 ^ var_1_12)) [L83] unsigned long int stepLocal_6 = var_1_13 % (5u + 256u); [L84] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, stepLocal_6=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L85] COND TRUE stepLocal_6 <= var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L86] COND FALSE !(stepLocal_5 >= var_1_16) [L89] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L92] var_1_38 = var_1_12 [L93] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L94] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L94] COND TRUE stepLocal_0 <= (var_1_12 ^ var_1_12) [L95] var_1_1 = (! var_1_5) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L99] unsigned char stepLocal_2 = var_1_12 < (var_1_16 / var_1_8); [L100] signed long int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_1=100, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L101] COND FALSE !(-256 >= stepLocal_1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L104] COND TRUE stepLocal_2 || ((var_1_5 && var_1_7) && var_1_1) [L105] var_1_6 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L108] var_1_25 = var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L109] COND FALSE !(((((var_1_9) > (var_1_24)) ? (var_1_9) : (var_1_24))) > var_1_23) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L122] unsigned char stepLocal_3 = ! var_1_5; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_3=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L123] COND TRUE (var_1_7 && var_1_14) || stepLocal_3 [L124] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L126] COND FALSE !(! var_1_14) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L129] var_1_15 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L130] COND TRUE ((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8) [L131] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L133] var_1_17 = (var_1_18 || (var_1_6 && var_1_20)) [L134] var_1_33 = var_1_31 [L191] RET step() [L192] CALL, EXPR property() [L182] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L182-L183] return ((((((((var_1_12 <= (var_1_12 ^ var_1_12)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_16) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_12 < (var_1_16 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_14) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (last_1_var_1_14 ? ((var_1_10 >= (- last_1_var_1_9)) ? ((var_1_8 != last_1_var_1_16) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_16) ? (((var_1_13 + 16) >= var_1_16) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) last_1_var_1_12)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1135 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1130 mSDsluCounter, 2144 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1492 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1158 IncrementalHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 652 mSDtfsCounter, 1158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 641 GetRequests, 594 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=5, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 133 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1298 NumberOfCodeBlocks, 1298 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1128 ConstructedInterpolants, 0 QuantifiedInterpolants, 4146 SizeOfPredicates, 4 NumberOfNonLiveVariables, 407 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 7539/7728 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:53:59,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 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-pr-co_file-68.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 0767bce9c4099f45ee11cd1ef676ae525a65f96727af97d4487455a7a72fa712 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:54:02,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:54:02,452 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:54:02,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:54:02,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:54:02,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:54:02,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:54:02,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:54:02,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:54:02,501 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:54:02,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:54:02,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:54:02,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:54:02,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:54:02,505 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:54:02,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:54:02,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:54:02,507 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:54:02,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:54:02,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:54:02,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:54:02,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:54:02,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:54:02,509 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:54:02,509 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:54:02,510 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:54:02,510 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:54:02,510 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:54:02,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:54:02,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:54:02,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:54:02,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:54:02,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:54:02,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:54:02,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:54:02,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:54:02,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:54:02,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:54:02,516 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:54:02,517 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:54:02,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:54:02,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:54:02,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:54:02,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:54:02,518 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:54:02,518 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 -> 0767bce9c4099f45ee11cd1ef676ae525a65f96727af97d4487455a7a72fa712 [2024-10-11 09:54:02,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:54:02,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:54:02,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:54:02,929 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:54:02,930 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:54:02,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-68.i [2024-10-11 09:54:04,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:54:04,830 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:54:04,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-68.i [2024-10-11 09:54:04,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/49c84f5da/ecca361d7eea402ab4c6b451fa5f8e52/FLAGafb101be3 [2024-10-11 09:54:04,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/49c84f5da/ecca361d7eea402ab4c6b451fa5f8e52 [2024-10-11 09:54:04,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:54:04,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:54:04,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:54:04,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:54:04,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:54:04,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:54:04" (1/1) ... [2024-10-11 09:54:04,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28962f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:04, skipping insertion in model container [2024-10-11 09:54:04,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:54:04" (1/1) ... [2024-10-11 09:54:04,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:54:05,130 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-pr-co_file-68.i[919,932] [2024-10-11 09:54:05,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:54:05,253 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:54:05,269 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-pr-co_file-68.i[919,932] [2024-10-11 09:54:05,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:54:05,346 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:54:05,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:05 WrapperNode [2024-10-11 09:54:05,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:54:05,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:54:05,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:54:05,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:54:05,356 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:54:05" (1/1) ... [2024-10-11 09:54:05,377 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:54:05" (1/1) ... [2024-10-11 09:54:05,433 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-10-11 09:54:05,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:54:05,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:54:05,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:54:05,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:54:05,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:05" (1/1) ... [2024-10-11 09:54:05,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:05" (1/1) ... [2024-10-11 09:54:05,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:05" (1/1) ... [2024-10-11 09:54:05,482 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:54:05,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:05" (1/1) ... [2024-10-11 09:54:05,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:05" (1/1) ... [2024-10-11 09:54:05,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:05" (1/1) ... [2024-10-11 09:54:05,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:05" (1/1) ... [2024-10-11 09:54:05,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:05" (1/1) ... [2024-10-11 09:54:05,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:05" (1/1) ... [2024-10-11 09:54:05,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:54:05,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:54:05,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:54:05,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:54:05,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:05" (1/1) ... [2024-10-11 09:54:05,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:54:05,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:54:05,558 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:54:05,563 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:54:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:54:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:54:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:54:05,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:54:05,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:54:05,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:54:05,690 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:54:05,693 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:54:11,008 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 09:54:11,009 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:54:11,093 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:54:11,093 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:54:11,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:54:11 BoogieIcfgContainer [2024-10-11 09:54:11,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:54:11,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:54:11,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:54:11,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:54:11,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:54:04" (1/3) ... [2024-10-11 09:54:11,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c73cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:54:11, skipping insertion in model container [2024-10-11 09:54:11,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:05" (2/3) ... [2024-10-11 09:54:11,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c73cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:54:11, skipping insertion in model container [2024-10-11 09:54:11,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:54:11" (3/3) ... [2024-10-11 09:54:11,103 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-68.i [2024-10-11 09:54:11,119 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:54:11,120 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:54:11,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:54:11,195 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;@73954a6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:54:11,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:54:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:54:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 09:54:11,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:11,218 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:11,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:11,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:11,223 INFO L85 PathProgramCache]: Analyzing trace with hash -363445535, now seen corresponding path program 1 times [2024-10-11 09:54:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:54:11,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013996133] [2024-10-11 09:54:11,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:11,237 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:54:11,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:54:11,239 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:54:11,240 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:54:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:12,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:54:12,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:54:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-11 09:54:12,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:54:12,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:54:12,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013996133] [2024-10-11 09:54:12,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013996133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:54:12,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:54:12,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:54:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114707369] [2024-10-11 09:54:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:54:12,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:54:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:54:12,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:54:12,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:54:12,192 INFO L87 Difference]: Start difference. First operand has 75 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:54:12,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:12,436 INFO L93 Difference]: Finished difference Result 147 states and 260 transitions. [2024-10-11 09:54:12,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:54:12,447 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 155 [2024-10-11 09:54:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:12,453 INFO L225 Difference]: With dead ends: 147 [2024-10-11 09:54:12,453 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 09:54:12,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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:54:12,459 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:12,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:54:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 09:54:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 09:54:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:54:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 114 transitions. [2024-10-11 09:54:12,508 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 114 transitions. Word has length 155 [2024-10-11 09:54:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:12,509 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 114 transitions. [2024-10-11 09:54:12,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:54:12,510 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 114 transitions. [2024-10-11 09:54:12,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 09:54:12,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:12,513 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:12,533 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:54:12,714 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:54:12,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:12,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:12,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1541006879, now seen corresponding path program 1 times [2024-10-11 09:54:12,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:54:12,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208168894] [2024-10-11 09:54:12,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:12,717 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:54:12,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:54:12,718 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:54:12,719 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:54:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:13,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:54:13,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:54:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:54:17,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:54:17,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:54:17,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208168894] [2024-10-11 09:54:17,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208168894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:54:17,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:54:17,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 09:54:17,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608174291] [2024-10-11 09:54:17,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:54:17,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 09:54:17,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:54:17,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 09:54:17,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:54:17,071 INFO L87 Difference]: Start difference. First operand 73 states and 114 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:54:25,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:25,712 INFO L93 Difference]: Finished difference Result 331 states and 511 transitions. [2024-10-11 09:54:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 09:54:25,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-10-11 09:54:25,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:25,727 INFO L225 Difference]: With dead ends: 331 [2024-10-11 09:54:25,728 INFO L226 Difference]: Without dead ends: 259 [2024-10-11 09:54:25,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-11 09:54:25,730 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 312 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:25,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 571 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-10-11 09:54:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-11 09:54:25,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 222. [2024-10-11 09:54:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 138 states have internal predecessors, (183), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 09:54:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 343 transitions. [2024-10-11 09:54:25,801 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 343 transitions. Word has length 155 [2024-10-11 09:54:25,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:25,802 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 343 transitions. [2024-10-11 09:54:25,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:54:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 343 transitions. [2024-10-11 09:54:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 09:54:25,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:25,808 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:25,832 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:54:26,009 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:54:26,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:26,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2127812893, now seen corresponding path program 1 times [2024-10-11 09:54:26,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:54:26,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419076851] [2024-10-11 09:54:26,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:26,012 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:54:26,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:54:26,015 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:54:26,017 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:54:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 09:54:26,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:54:27,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:54:27,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:54:27,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:54:27,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419076851] [2024-10-11 09:54:27,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419076851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:54:27,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:54:27,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:54:27,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899867488] [2024-10-11 09:54:27,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:54:27,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:54:27,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:54:27,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:54:27,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:54:27,200 INFO L87 Difference]: Start difference. First operand 222 states and 343 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:54:28,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:28,154 INFO L93 Difference]: Finished difference Result 381 states and 587 transitions. [2024-10-11 09:54:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:54:28,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-10-11 09:54:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:28,172 INFO L225 Difference]: With dead ends: 381 [2024-10-11 09:54:28,172 INFO L226 Difference]: Without dead ends: 222 [2024-10-11 09:54:28,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:54:28,174 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 105 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:28,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 195 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 09:54:28,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-11 09:54:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2024-10-11 09:54:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.3235294117647058) internal successors, (180), 138 states have internal predecessors, (180), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 09:54:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 340 transitions. [2024-10-11 09:54:28,226 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 340 transitions. Word has length 155 [2024-10-11 09:54:28,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:28,227 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 340 transitions. [2024-10-11 09:54:28,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:54:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 340 transitions. [2024-10-11 09:54:28,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 09:54:28,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:28,230 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:28,260 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:54:28,430 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:54:28,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:28,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:28,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1121768384, now seen corresponding path program 1 times [2024-10-11 09:54:28,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:54:28,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719528768] [2024-10-11 09:54:28,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:28,433 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:54:28,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:54:28,436 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:54:28,439 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:54:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:29,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 09:54:29,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:54:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 417 proven. 114 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-10-11 09:54:39,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:54:43,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:54:43,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719528768] [2024-10-11 09:54:43,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719528768] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:54:43,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [49117180] [2024-10-11 09:54:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:43,626 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 09:54:43,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 09:54:43,631 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 09:54:43,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 09:54:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:46,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 09:54:46,317 INFO L278 TraceCheckSpWp]: Computing forward predicates...