./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 12bb580d008789dc82bd22e84ab6c6fa66b09798075ab5a16232b78d93de6996 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:38:49,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:38:49,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:38:49,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:38:49,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:38:49,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:38:49,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:38:49,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:38:49,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:38:49,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:38:49,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:38:49,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:38:49,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:38:49,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:38:49,864 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:38:49,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:38:49,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:38:49,864 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:38:49,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:38:49,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:38:49,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:38:49,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:38:49,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:38:49,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:38:49,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:38:49,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:38:49,864 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:38:49,864 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:38:49,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:38:49,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:38:49,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:38:49,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:38:49,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:38:49,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:38:49,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:38:49,865 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:38:49,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:38:49,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:38:49,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:38:49,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:38:49,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:38:49,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:38:49,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:38:49,865 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/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 -> 12bb580d008789dc82bd22e84ab6c6fa66b09798075ab5a16232b78d93de6996 [2025-03-03 19:38:50,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:38:50,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:38:50,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:38:50,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:38:50,093 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:38:50,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i [2025-03-03 19:38:51,238 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2b524a8/004224a856024ed9b76e2fdf8c739434/FLAG592a5c1f2 [2025-03-03 19:38:51,466 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:38:51,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i [2025-03-03 19:38:51,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2b524a8/004224a856024ed9b76e2fdf8c739434/FLAG592a5c1f2 [2025-03-03 19:38:51,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2b524a8/004224a856024ed9b76e2fdf8c739434 [2025-03-03 19:38:51,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:38:51,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:38:51,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:38:51,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:38:51,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:38:51,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:38:51" (1/1) ... [2025-03-03 19:38:51,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328aab61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:51, skipping insertion in model container [2025-03-03 19:38:51,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:38:51" (1/1) ... [2025-03-03 19:38:51,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:38:51,916 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i[915,928] [2025-03-03 19:38:51,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:38:51,973 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:38:51,981 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i[915,928] [2025-03-03 19:38:52,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:38:52,034 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:38:52,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:52 WrapperNode [2025-03-03 19:38:52,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:38:52,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:38:52,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:38:52,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:38:52,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:52" (1/1) ... [2025-03-03 19:38:52,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:52" (1/1) ... [2025-03-03 19:38:52,083 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2025-03-03 19:38:52,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:38:52,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:38:52,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:38:52,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:38:52,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:52" (1/1) ... [2025-03-03 19:38:52,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:52" (1/1) ... [2025-03-03 19:38:52,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:52" (1/1) ... [2025-03-03 19:38:52,118 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]. [2025-03-03 19:38:52,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:52" (1/1) ... [2025-03-03 19:38:52,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:52" (1/1) ... [2025-03-03 19:38:52,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:52" (1/1) ... [2025-03-03 19:38:52,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:52" (1/1) ... [2025-03-03 19:38:52,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:52" (1/1) ... [2025-03-03 19:38:52,130 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:52" (1/1) ... [2025-03-03 19:38:52,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:38:52,133 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:38:52,134 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:38:52,134 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:38:52,138 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:52" (1/1) ... [2025-03-03 19:38:52,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:38:52,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:38:52,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:38:52,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:38:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:38:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:38:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:38:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:38:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:38:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:38:52,254 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:38:52,256 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:38:52,611 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 19:38:52,614 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:38:52,623 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:38:52,625 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:38:52,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:38:52 BoogieIcfgContainer [2025-03-03 19:38:52,625 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:38:52,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:38:52,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:38:52,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:38:52,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:38:51" (1/3) ... [2025-03-03 19:38:52,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ccab39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:38:52, skipping insertion in model container [2025-03-03 19:38:52,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:38:52" (2/3) ... [2025-03-03 19:38:52,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ccab39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:38:52, skipping insertion in model container [2025-03-03 19:38:52,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:38:52" (3/3) ... [2025-03-03 19:38:52,635 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-66.i [2025-03-03 19:38:52,647 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:38:52,650 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-66.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:38:52,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:38:52,711 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;@b85d57f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:38:52,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:38:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 19:38:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 19:38:52,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:52,730 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:38:52,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:52,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:52,735 INFO L85 PathProgramCache]: Analyzing trace with hash -700602216, now seen corresponding path program 1 times [2025-03-03 19:38:52,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:38:52,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688522308] [2025-03-03 19:38:52,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:52,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:38:52,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 19:38:52,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 19:38:52,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:52,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-03 19:38:53,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:38:53,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688522308] [2025-03-03 19:38:53,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688522308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:38:53,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766718968] [2025-03-03 19:38:53,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:53,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:38:53,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:38:53,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:38:53,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:38:53,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 19:38:53,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 19:38:53,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:53,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:38:53,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:38:53,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:38:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-03 19:38:53,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:38:53,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766718968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:38:53,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:38:53,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:38:53,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281914053] [2025-03-03 19:38:53,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:38:53,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:38:53,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:38:53,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:38:53,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:38:53,271 INFO L87 Difference]: Start difference. First operand has 86 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) 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, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 19:38:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:38:53,297 INFO L93 Difference]: Finished difference Result 166 states and 296 transitions. [2025-03-03 19:38:53,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:38:53,299 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, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2025-03-03 19:38:53,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:38:53,304 INFO L225 Difference]: With dead ends: 166 [2025-03-03 19:38:53,305 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 19:38:53,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:38:53,311 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:38:53,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:38:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 19:38:53,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 19:38:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 19:38:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2025-03-03 19:38:53,352 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 204 [2025-03-03 19:38:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:38:53,353 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2025-03-03 19:38:53,353 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, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 19:38:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2025-03-03 19:38:53,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 19:38:53,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:38:53,355 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:38:53,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:38:53,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:38:53,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:38:53,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:38:53,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1165162329, now seen corresponding path program 1 times [2025-03-03 19:38:53,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:38:53,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497571187] [2025-03-03 19:38:53,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:38:53,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:38:53,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 19:38:53,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 19:38:53,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:38:53,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:39:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:39:19,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:39:19,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497571187] [2025-03-03 19:39:19,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497571187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:39:19,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:39:19,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 19:39:19,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401274602] [2025-03-03 19:39:19,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:39:19,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 19:39:19,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:39:19,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 19:39:19,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:39:19,629 INFO L87 Difference]: Start difference. First operand 83 states and 129 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:39:20,750 INFO L93 Difference]: Finished difference Result 248 states and 376 transitions. [2025-03-03 19:39:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 19:39:20,751 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-03 19:39:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:39:20,758 INFO L225 Difference]: With dead ends: 248 [2025-03-03 19:39:20,758 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 19:39:20,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:39:20,759 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 190 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:39:20,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 614 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:39:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 19:39:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 103. [2025-03-03 19:39:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.338235294117647) internal successors, (91), 68 states have internal predecessors, (91), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 19:39:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2025-03-03 19:39:20,776 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 204 [2025-03-03 19:39:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:39:20,779 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2025-03-03 19:39:20,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2025-03-03 19:39:20,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 19:39:20,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:39:20,784 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:39:20,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:39:20,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:39:20,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:39:20,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1166085850, now seen corresponding path program 1 times [2025-03-03 19:39:20,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:39:20,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511917598] [2025-03-03 19:39:20,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:39:20,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:39:20,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 19:39:20,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 19:39:20,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:20,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:39:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:39:24,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:39:24,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511917598] [2025-03-03 19:39:24,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511917598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:39:24,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:39:24,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 19:39:24,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800294752] [2025-03-03 19:39:24,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:39:24,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 19:39:24,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:39:24,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 19:39:24,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:39:24,277 INFO L87 Difference]: Start difference. First operand 103 states and 157 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:39:25,318 INFO L93 Difference]: Finished difference Result 207 states and 288 transitions. [2025-03-03 19:39:25,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 19:39:25,318 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-03 19:39:25,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:39:25,321 INFO L225 Difference]: With dead ends: 207 [2025-03-03 19:39:25,321 INFO L226 Difference]: Without dead ends: 205 [2025-03-03 19:39:25,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:39:25,322 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 168 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:39:25,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 956 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:39:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-03 19:39:25,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 131. [2025-03-03 19:39:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 92 states have internal predecessors, (125), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 19:39:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2025-03-03 19:39:25,336 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 204 [2025-03-03 19:39:25,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:39:25,336 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2025-03-03 19:39:25,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2025-03-03 19:39:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 19:39:25,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:39:25,338 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:39:25,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:39:25,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:39:25,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:39:25,339 INFO L85 PathProgramCache]: Analyzing trace with hash -642292134, now seen corresponding path program 1 times [2025-03-03 19:39:25,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:39:25,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253734136] [2025-03-03 19:39:25,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:39:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:39:25,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 19:39:25,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 19:39:25,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:25,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:39:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:39:28,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:39:28,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253734136] [2025-03-03 19:39:28,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253734136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:39:28,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:39:28,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 19:39:28,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909425581] [2025-03-03 19:39:28,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:39:28,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 19:39:28,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:39:28,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 19:39:28,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:39:28,358 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:39:29,073 INFO L93 Difference]: Finished difference Result 211 states and 293 transitions. [2025-03-03 19:39:29,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 19:39:29,074 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-03 19:39:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:39:29,075 INFO L225 Difference]: With dead ends: 211 [2025-03-03 19:39:29,076 INFO L226 Difference]: Without dead ends: 209 [2025-03-03 19:39:29,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:39:29,076 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 219 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:39:29,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 958 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:39:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-03 19:39:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 133. [2025-03-03 19:39:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 94 states have internal predecessors, (128), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 19:39:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions. [2025-03-03 19:39:29,093 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 204 [2025-03-03 19:39:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:39:29,094 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 202 transitions. [2025-03-03 19:39:29,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2025-03-03 19:39:29,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 19:39:29,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:39:29,097 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:39:29,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:39:29,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:39:29,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:39:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash -641368613, now seen corresponding path program 1 times [2025-03-03 19:39:29,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:39:29,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411992737] [2025-03-03 19:39:29,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:39:29,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:39:29,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 19:39:29,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 19:39:29,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:29,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:39:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:39:32,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:39:32,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411992737] [2025-03-03 19:39:32,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411992737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:39:32,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:39:32,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 19:39:32,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021843250] [2025-03-03 19:39:32,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:39:32,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 19:39:32,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:39:32,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 19:39:32,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:39:32,753 INFO L87 Difference]: Start difference. First operand 133 states and 202 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:39:33,832 INFO L93 Difference]: Finished difference Result 209 states and 291 transitions. [2025-03-03 19:39:33,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 19:39:33,833 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-03 19:39:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:39:33,835 INFO L225 Difference]: With dead ends: 209 [2025-03-03 19:39:33,835 INFO L226 Difference]: Without dead ends: 207 [2025-03-03 19:39:33,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-03 19:39:33,836 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 186 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:39:33,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 843 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:39:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-03 19:39:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 133. [2025-03-03 19:39:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 94 states have internal predecessors, (128), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 19:39:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 202 transitions. [2025-03-03 19:39:33,846 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 202 transitions. Word has length 204 [2025-03-03 19:39:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:39:33,847 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 202 transitions. [2025-03-03 19:39:33,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 202 transitions. [2025-03-03 19:39:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 19:39:33,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:39:33,849 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:39:33,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:39:33,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:39:33,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:39:33,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1294245048, now seen corresponding path program 1 times [2025-03-03 19:39:33,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:39:33,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522748824] [2025-03-03 19:39:33,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:39:33,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:39:33,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 19:39:33,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 19:39:33,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:33,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:39:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:39:33,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:39:33,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522748824] [2025-03-03 19:39:33,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522748824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:39:33,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:39:33,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:39:33,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208171666] [2025-03-03 19:39:33,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:39:33,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:39:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:39:33,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:39:33,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:39:33,904 INFO L87 Difference]: Start difference. First operand 133 states and 202 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:39:33,934 INFO L93 Difference]: Finished difference Result 369 states and 565 transitions. [2025-03-03 19:39:33,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:39:33,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-03 19:39:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:39:33,938 INFO L225 Difference]: With dead ends: 369 [2025-03-03 19:39:33,939 INFO L226 Difference]: Without dead ends: 239 [2025-03-03 19:39:33,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:39:33,941 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 116 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:39:33,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 351 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:39:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-03 19:39:33,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2025-03-03 19:39:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 158 states have (on average 1.3101265822784811) internal successors, (207), 160 states have internal predecessors, (207), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 19:39:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 355 transitions. [2025-03-03 19:39:33,975 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 355 transitions. Word has length 204 [2025-03-03 19:39:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:39:33,975 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 355 transitions. [2025-03-03 19:39:33,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 355 transitions. [2025-03-03 19:39:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 19:39:33,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:39:33,977 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:39:33,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:39:33,978 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:39:33,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:39:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1257911913, now seen corresponding path program 1 times [2025-03-03 19:39:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:39:33,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160993319] [2025-03-03 19:39:33,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:39:33,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:39:33,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 19:39:33,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 19:39:33,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:33,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:39:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:39:34,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:39:34,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160993319] [2025-03-03 19:39:34,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160993319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:39:34,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:39:34,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:39:34,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717871314] [2025-03-03 19:39:34,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:39:34,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:39:34,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:39:34,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:39:34,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:39:34,068 INFO L87 Difference]: Start difference. First operand 237 states and 355 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:39:34,260 INFO L93 Difference]: Finished difference Result 696 states and 1033 transitions. [2025-03-03 19:39:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:39:34,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-03 19:39:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:39:34,264 INFO L225 Difference]: With dead ends: 696 [2025-03-03 19:39:34,264 INFO L226 Difference]: Without dead ends: 462 [2025-03-03 19:39:34,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:39:34,265 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 89 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:39:34,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 374 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:39:34,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-03 19:39:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 417. [2025-03-03 19:39:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 264 states have (on average 1.2803030303030303) internal successors, (338), 267 states have internal predecessors, (338), 144 states have call successors, (144), 8 states have call predecessors, (144), 8 states have return successors, (144), 141 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-03 19:39:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 626 transitions. [2025-03-03 19:39:34,299 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 626 transitions. Word has length 204 [2025-03-03 19:39:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:39:34,300 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 626 transitions. [2025-03-03 19:39:34,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 626 transitions. [2025-03-03 19:39:34,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 19:39:34,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:39:34,302 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:39:34,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:39:34,302 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:39:34,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:39:34,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1229600920, now seen corresponding path program 1 times [2025-03-03 19:39:34,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:39:34,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699413855] [2025-03-03 19:39:34,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:39:34,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:39:34,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 19:39:34,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 19:39:34,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:34,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:39:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:39:35,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:39:35,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699413855] [2025-03-03 19:39:35,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699413855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:39:35,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:39:35,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 19:39:35,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506792272] [2025-03-03 19:39:35,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:39:35,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 19:39:35,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:39:35,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 19:39:35,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:39:35,661 INFO L87 Difference]: Start difference. First operand 417 states and 626 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:39:36,357 INFO L93 Difference]: Finished difference Result 563 states and 793 transitions. [2025-03-03 19:39:36,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 19:39:36,357 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-03 19:39:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:39:36,362 INFO L225 Difference]: With dead ends: 563 [2025-03-03 19:39:36,362 INFO L226 Difference]: Without dead ends: 561 [2025-03-03 19:39:36,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:39:36,363 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 250 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:39:36,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 718 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:39:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-03 19:39:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 473. [2025-03-03 19:39:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 309 states have (on average 1.2653721682847896) internal successors, (391), 314 states have internal predecessors, (391), 152 states have call successors, (152), 11 states have call predecessors, (152), 11 states have return successors, (152), 147 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-03 19:39:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 695 transitions. [2025-03-03 19:39:36,414 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 695 transitions. Word has length 204 [2025-03-03 19:39:36,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:39:36,415 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 695 transitions. [2025-03-03 19:39:36,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 695 transitions. [2025-03-03 19:39:36,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 19:39:36,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:39:36,417 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:39:36,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:39:36,417 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:39:36,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:39:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1230524441, now seen corresponding path program 1 times [2025-03-03 19:39:36,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:39:36,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110367466] [2025-03-03 19:39:36,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:39:36,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:39:36,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 19:39:36,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 19:39:36,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:36,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:39:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:39:38,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:39:38,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110367466] [2025-03-03 19:39:38,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110367466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:39:38,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:39:38,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 19:39:38,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140575559] [2025-03-03 19:39:38,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:39:38,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 19:39:38,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:39:38,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 19:39:38,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:39:38,838 INFO L87 Difference]: Start difference. First operand 473 states and 695 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:39,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:39:39,742 INFO L93 Difference]: Finished difference Result 561 states and 791 transitions. [2025-03-03 19:39:39,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 19:39:39,742 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-03 19:39:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:39:39,745 INFO L225 Difference]: With dead ends: 561 [2025-03-03 19:39:39,745 INFO L226 Difference]: Without dead ends: 559 [2025-03-03 19:39:39,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:39:39,746 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 251 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:39:39,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 786 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 19:39:39,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-03 19:39:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 473. [2025-03-03 19:39:39,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 309 states have (on average 1.2653721682847896) internal successors, (391), 314 states have internal predecessors, (391), 152 states have call successors, (152), 11 states have call predecessors, (152), 11 states have return successors, (152), 147 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-03 19:39:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 695 transitions. [2025-03-03 19:39:39,781 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 695 transitions. Word has length 204 [2025-03-03 19:39:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:39:39,781 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 695 transitions. [2025-03-03 19:39:39,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-03 19:39:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 695 transitions. [2025-03-03 19:39:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 19:39:39,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:39:39,783 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:39:39,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:39:39,783 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:39:39,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:39:39,783 INFO L85 PathProgramCache]: Analyzing trace with hash 871759322, now seen corresponding path program 1 times [2025-03-03 19:39:39,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:39:39,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776674534] [2025-03-03 19:39:39,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:39:39,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:39:39,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 19:39:39,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 19:39:39,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:39,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:39:40,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-03 19:39:40,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:39:40,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776674534] [2025-03-03 19:39:40,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776674534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:39:40,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:39:40,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:39:40,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536072950] [2025-03-03 19:39:40,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:39:40,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:39:40,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:39:40,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:39:40,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:39:40,007 INFO L87 Difference]: Start difference. First operand 473 states and 695 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 19:39:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:39:40,189 INFO L93 Difference]: Finished difference Result 881 states and 1280 transitions. [2025-03-03 19:39:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:39:40,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2025-03-03 19:39:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:39:40,192 INFO L225 Difference]: With dead ends: 881 [2025-03-03 19:39:40,192 INFO L226 Difference]: Without dead ends: 480 [2025-03-03 19:39:40,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:39:40,194 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 143 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:39:40,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 207 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:39:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-03 19:39:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 471. [2025-03-03 19:39:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 301 states have (on average 1.2292358803986712) internal successors, (370), 306 states have internal predecessors, (370), 156 states have call successors, (156), 13 states have call predecessors, (156), 13 states have return successors, (156), 151 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-03 19:39:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 682 transitions. [2025-03-03 19:39:40,231 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 682 transitions. Word has length 204 [2025-03-03 19:39:40,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:39:40,231 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 682 transitions. [2025-03-03 19:39:40,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 19:39:40,232 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 682 transitions. [2025-03-03 19:39:40,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 19:39:40,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:39:40,233 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:39:40,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:39:40,233 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:39:40,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:39:40,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1361001720, now seen corresponding path program 1 times [2025-03-03 19:39:40,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:39:40,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519560110] [2025-03-03 19:39:40,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:39:40,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:39:40,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 19:39:40,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 19:39:40,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:40,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:39:40,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [711344086] [2025-03-03 19:39:40,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:39:40,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:39:40,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:39:40,308 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:39:40,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:39:40,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 19:39:40,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 19:39:40,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:40,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:39:40,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 19:39:40,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:39:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 900 proven. 321 refuted. 0 times theorem prover too weak. 891 trivial. 0 not checked. [2025-03-03 19:39:42,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:39:44,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:39:44,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519560110] [2025-03-03 19:39:44,675 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 19:39:44,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711344086] [2025-03-03 19:39:44,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711344086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:39:44,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:39:44,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2025-03-03 19:39:44,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052928318] [2025-03-03 19:39:44,675 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 19:39:44,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 19:39:44,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:39:44,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 19:39:44,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-03-03 19:39:44,676 INFO L87 Difference]: Start difference. First operand 471 states and 682 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 20 states have internal predecessors, (67), 7 states have call successors, (33), 7 states have call predecessors, (33), 9 states have return successors, (33), 6 states have call predecessors, (33), 7 states have call successors, (33) [2025-03-03 19:39:45,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:39:45,642 INFO L93 Difference]: Finished difference Result 908 states and 1221 transitions. [2025-03-03 19:39:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-03 19:39:45,643 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 20 states have internal predecessors, (67), 7 states have call successors, (33), 7 states have call predecessors, (33), 9 states have return successors, (33), 6 states have call predecessors, (33), 7 states have call successors, (33) Word has length 205 [2025-03-03 19:39:45,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:39:45,646 INFO L225 Difference]: With dead ends: 908 [2025-03-03 19:39:45,646 INFO L226 Difference]: Without dead ends: 671 [2025-03-03 19:39:45,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=402, Invalid=1320, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 19:39:45,647 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 199 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:39:45,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 476 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:39:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-03 19:39:45,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 547. [2025-03-03 19:39:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 359 states have (on average 1.1838440111420614) internal successors, (425), 364 states have internal predecessors, (425), 154 states have call successors, (154), 33 states have call predecessors, (154), 33 states have return successors, (154), 149 states have call predecessors, (154), 154 states have call successors, (154) [2025-03-03 19:39:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 733 transitions. [2025-03-03 19:39:45,699 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 733 transitions. Word has length 205 [2025-03-03 19:39:45,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:39:45,699 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 733 transitions. [2025-03-03 19:39:45,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 20 states have internal predecessors, (67), 7 states have call successors, (33), 7 states have call predecessors, (33), 9 states have return successors, (33), 6 states have call predecessors, (33), 7 states have call successors, (33) [2025-03-03 19:39:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 733 transitions. [2025-03-03 19:39:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 19:39:45,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:39:45,700 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:39:45,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:39:45,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 19:39:45,901 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:39:45,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:39:45,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1360078199, now seen corresponding path program 1 times [2025-03-03 19:39:45,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:39:45,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503698180] [2025-03-03 19:39:45,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:39:45,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:39:45,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 19:39:45,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 19:39:45,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:45,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:39:45,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1320099147] [2025-03-03 19:39:45,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:39:45,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:39:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:39:45,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:39:45,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:39:46,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 19:39:46,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 19:39:46,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:46,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:39:46,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:39:46,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 19:39:46,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 19:39:46,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:46,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:39:46,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:39:46,351 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:39:46,351 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:39:46,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:39:46,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:39:46,557 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:39:46,657 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:39:46,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:39:46 BoogieIcfgContainer [2025-03-03 19:39:46,659 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:39:46,659 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:39:46,659 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:39:46,659 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:39:46,660 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:38:52" (3/4) ... [2025-03-03 19:39:46,661 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:39:46,662 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:39:46,662 INFO L158 Benchmark]: Toolchain (without parser) took 54871.83ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 111.2MB in the beginning and 61.5MB in the end (delta: 49.7MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2025-03-03 19:39:46,662 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:39:46,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.14ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 97.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:39:46,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.12ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:39:46,663 INFO L158 Benchmark]: Boogie Preprocessor took 42.76ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 89.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:39:46,663 INFO L158 Benchmark]: IcfgBuilder took 491.64ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 66.4MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:39:46,663 INFO L158 Benchmark]: TraceAbstraction took 54030.50ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 65.4MB in the beginning and 61.7MB in the end (delta: 3.7MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2025-03-03 19:39:46,663 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 167.8MB. Free memory was 61.7MB in the beginning and 61.5MB in the end (delta: 195.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:39:46,664 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.14ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 97.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.12ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 94.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.76ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 89.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 491.64ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 66.4MB in the end (delta: 23.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 54030.50ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 65.4MB in the beginning and 61.7MB in the end (delta: 3.7MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 167.8MB. Free memory was 61.7MB in the beginning and 61.5MB in the end (delta: 195.3kB). Peak memory consumption was 8.4MB. 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 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 157. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] signed long int var_1_22 = -8; [L40] unsigned char var_1_23 = 1; [L41] signed long int var_1_24 = 5; [L42] signed long int var_1_25 = -128; [L43] unsigned long int var_1_26 = 10; [L44] unsigned long int var_1_27 = 5; [L45] signed long int var_1_28 = -10000; [L46] signed long int var_1_29 = 256; [L47] double var_1_30 = 2.75; [L48] double var_1_31 = 10.5; [L49] unsigned short int var_1_32 = 25; [L50] unsigned short int var_1_33 = 5; [L51] unsigned short int var_1_34 = 16; [L52] signed short int var_1_35 = 4; [L53] signed short int var_1_36 = 8; [L54] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] CALL updateLastVariables() [L166] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L176] RET updateLastVariables() [L177] CALL updateVariables() [L114] var_1_3 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L115] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L116] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L116] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L117] var_1_4 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L118] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L119] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L119] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L120] var_1_6 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=2, var_1_8=256] [L121] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=2, var_1_8=256] [L122] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=2, var_1_8=256] [L122] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=2, var_1_8=256] [L123] var_1_7 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L124] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L125] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L125] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L126] var_1_10 = __VERIFIER_nondet_ushort() [L127] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L127] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L128] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L128] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L129] var_1_11 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L130] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L131] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L131] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L132] var_1_14 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L133] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L134] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L134] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L135] var_1_20 = __VERIFIER_nondet_short() [L136] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L136] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L137] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L137] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L138] var_1_21 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L139] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L140] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L140] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=1, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L141] var_1_23 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L142] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L143] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L143] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=5, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L144] var_1_24 = __VERIFIER_nondet_long() [L145] CALL assume_abort_if_not(var_1_24 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L145] RET assume_abort_if_not(var_1_24 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L146] CALL assume_abort_if_not(var_1_24 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L146] RET assume_abort_if_not(var_1_24 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-128, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L147] var_1_25 = __VERIFIER_nondet_long() [L148] CALL assume_abort_if_not(var_1_25 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L148] RET assume_abort_if_not(var_1_25 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L149] CALL assume_abort_if_not(var_1_25 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L149] RET assume_abort_if_not(var_1_25 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=5, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L150] var_1_27 = __VERIFIER_nondet_ulong() [L151] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L151] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L152] CALL assume_abort_if_not(var_1_27 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L152] RET assume_abort_if_not(var_1_27 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=256, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L153] var_1_29 = __VERIFIER_nondet_long() [L154] CALL assume_abort_if_not(var_1_29 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L154] RET assume_abort_if_not(var_1_29 >= -2147483647) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L155] CALL assume_abort_if_not(var_1_29 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L155] RET assume_abort_if_not(var_1_29 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_31=21/2, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L156] var_1_31 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L157] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=5, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L158] var_1_33 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L159] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L160] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L160] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=8, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L161] var_1_36 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_36 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L162] RET assume_abort_if_not(var_1_36 >= -32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L163] CALL assume_abort_if_not(var_1_36 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L163] RET assume_abort_if_not(var_1_36 <= 32766) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L177] RET updateVariables() [L178] CALL step() [L58] COND FALSE !(var_1_24 > var_1_25) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=10, var_1_27=0, var_1_28=-10000, var_1_29=-2147483647, var_1_30=11/4, var_1_32=25, var_1_33=0, var_1_34=16, var_1_35=4, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L63] var_1_26 = var_1_27 [L64] var_1_28 = var_1_29 [L65] var_1_30 = var_1_31 [L66] var_1_32 = var_1_33 [L67] var_1_34 = var_1_33 [L68] var_1_35 = var_1_36 [L69] signed char stepLocal_1 = var_1_6; [L70] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=31, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=256] [L71] COND FALSE !(-25 == stepLocal_1) [L76] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=32767] [L78] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=127, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=32767] [L79] COND TRUE var_1_8 >= stepLocal_2 [L80] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=32767] [L82] COND TRUE \read(var_1_12) [L83] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=32767] [L85] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/2, var_1_6=31, var_1_7=127, var_1_8=32767] [L86] COND TRUE \read(var_1_12) [L87] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L90] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=31, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L91] COND TRUE var_1_1 < stepLocal_4 [L92] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-96, var_1_19=25, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L96] COND TRUE \read(var_1_12) [L97] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-96, var_1_19=-16225, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L99] COND TRUE -64 > (var_1_6 + var_1_19) [L100] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-96, var_1_19=-16225, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L108] signed long int stepLocal_3 = ((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10); VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_3=32767, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-96, var_1_19=-16225, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L109] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-96, var_1_19=-16225, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-96, var_1_19=-16225, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-96, var_1_19=-16225, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-96, var_1_19=-16225, var_1_1=30, var_1_20=16383, var_1_21=16383, var_1_22=-8, var_1_23=0, var_1_24=-2147483648, var_1_25=-2147483648, var_1_26=0, var_1_27=0, var_1_28=-2147483647, var_1_29=-2147483647, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=-32767, var_1_36=-32767, var_1_3=-33, var_1_4=63, var_1_5=33/4, var_1_6=31, var_1_7=127, var_1_8=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.9s, OverallIterations: 12, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1819 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1811 mSDsluCounter, 6412 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4904 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4046 IncrementalHoareTripleChecker+Invalid, 4222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 1508 mSDtfsCounter, 4046 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 572 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=547occurred in iteration=11, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 643 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 44.3s InterpolantComputationTime, 3064 NumberOfCodeBlocks, 3064 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2437 ConstructedInterpolants, 1 QuantifiedInterpolants, 18024 SizeOfPredicates, 9 NumberOfNonLiveVariables, 957 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 24959/25344 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 19:39:46,874 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-03 19:39:46,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 12bb580d008789dc82bd22e84ab6c6fa66b09798075ab5a16232b78d93de6996 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:39:48,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:39:48,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:39:48,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:39:48,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:39:48,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:39:48,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:39:48,480 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:39:48,480 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:39:48,480 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:39:48,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:39:48,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:39:48,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:39:48,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:39:48,480 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:39:48,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:39:48,481 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:39:48,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:39:48,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:39:48,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:39:48,482 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:39:48,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:39:48,482 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:39:48,482 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:39:48,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:39:48,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:39:48,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:39:48,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:39:48,482 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/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 -> 12bb580d008789dc82bd22e84ab6c6fa66b09798075ab5a16232b78d93de6996 [2025-03-03 19:39:48,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:39:48,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:39:48,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:39:48,727 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:39:48,727 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:39:48,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i [2025-03-03 19:39:49,863 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec65ae7c/e8215b303dcb4b2e93b6f548e45e3b53/FLAG1e5ad9c09 [2025-03-03 19:39:50,026 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:39:50,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i [2025-03-03 19:39:50,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec65ae7c/e8215b303dcb4b2e93b6f548e45e3b53/FLAG1e5ad9c09 [2025-03-03 19:39:50,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec65ae7c/e8215b303dcb4b2e93b6f548e45e3b53 [2025-03-03 19:39:50,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:39:50,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:39:50,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:39:50,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:39:50,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:39:50,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:39:50" (1/1) ... [2025-03-03 19:39:50,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f4af3a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50, skipping insertion in model container [2025-03-03 19:39:50,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:39:50" (1/1) ... [2025-03-03 19:39:50,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:39:50,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i[915,928] [2025-03-03 19:39:50,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:39:50,248 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:39:50,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-66.i[915,928] [2025-03-03 19:39:50,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:39:50,300 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:39:50,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50 WrapperNode [2025-03-03 19:39:50,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:39:50,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:39:50,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:39:50,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:39:50,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50" (1/1) ... [2025-03-03 19:39:50,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50" (1/1) ... [2025-03-03 19:39:50,345 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2025-03-03 19:39:50,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:39:50,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:39:50,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:39:50,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:39:50,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50" (1/1) ... [2025-03-03 19:39:50,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50" (1/1) ... [2025-03-03 19:39:50,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50" (1/1) ... [2025-03-03 19:39:50,376 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]. [2025-03-03 19:39:50,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50" (1/1) ... [2025-03-03 19:39:50,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50" (1/1) ... [2025-03-03 19:39:50,386 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50" (1/1) ... [2025-03-03 19:39:50,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50" (1/1) ... [2025-03-03 19:39:50,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50" (1/1) ... [2025-03-03 19:39:50,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50" (1/1) ... [2025-03-03 19:39:50,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:39:50,399 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:39:50,399 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:39:50,399 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:39:50,399 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50" (1/1) ... [2025-03-03 19:39:50,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:39:50,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:39:50,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:39:50,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:39:50,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:39:50,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:39:50,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:39:50,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:39:50,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:39:50,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:39:50,523 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:39:50,525 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:39:50,793 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 19:39:50,795 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:39:50,804 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:39:50,805 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:39:50,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:39:50 BoogieIcfgContainer [2025-03-03 19:39:50,805 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:39:50,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:39:50,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:39:50,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:39:50,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:39:50" (1/3) ... [2025-03-03 19:39:50,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa871d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:39:50, skipping insertion in model container [2025-03-03 19:39:50,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:39:50" (2/3) ... [2025-03-03 19:39:50,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa871d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:39:50, skipping insertion in model container [2025-03-03 19:39:50,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:39:50" (3/3) ... [2025-03-03 19:39:50,813 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-66.i [2025-03-03 19:39:50,823 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:39:50,824 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-66.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:39:50,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:39:50,868 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;@6a19ab74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:39:50,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:39:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 19:39:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 19:39:50,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:39:50,879 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:39:50,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:39:50,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:39:50,883 INFO L85 PathProgramCache]: Analyzing trace with hash -700602216, now seen corresponding path program 1 times [2025-03-03 19:39:50,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:39:50,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090319610] [2025-03-03 19:39:50,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:39:50,890 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 [2025-03-03 19:39:50,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:39:50,892 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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) [2025-03-03 19:39:50,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2025-03-03 19:39:50,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 19:39:51,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 19:39:51,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:51,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:39:51,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:39:51,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:39:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2025-03-03 19:39:51,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:39:51,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:39:51,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090319610] [2025-03-03 19:39:51,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090319610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:39:51,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:39:51,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:39:51,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31548969] [2025-03-03 19:39:51,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:39:51,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:39:51,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:39:51,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:39:51,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:39:51,150 INFO L87 Difference]: Start difference. First operand has 86 states, 50 states have (on average 1.36) internal successors, (68), 51 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 19:39:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:39:51,176 INFO L93 Difference]: Finished difference Result 166 states and 296 transitions. [2025-03-03 19:39:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:39:51,179 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2025-03-03 19:39:51,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:39:51,186 INFO L225 Difference]: With dead ends: 166 [2025-03-03 19:39:51,186 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 19:39:51,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:39:51,190 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:39:51,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:39:51,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 19:39:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 19:39:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 19:39:51,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2025-03-03 19:39:51,226 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 204 [2025-03-03 19:39:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:39:51,226 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2025-03-03 19:39:51,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-03 19:39:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2025-03-03 19:39:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 19:39:51,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:39:51,229 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:39:51,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2025-03-03 19:39:51,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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 [2025-03-03 19:39:51,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:39:51,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:39:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1165162329, now seen corresponding path program 1 times [2025-03-03 19:39:51,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:39:51,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683247101] [2025-03-03 19:39:51,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:39:51,431 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 [2025-03-03 19:39:51,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:39:51,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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) [2025-03-03 19:39:51,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 [2025-03-03 19:39:51,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 19:39:51,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 19:39:51,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:39:51,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:39:51,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 19:39:51,622 INFO L279 TraceCheckSpWp]: Computing forward predicates...