./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-9.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 cc64153296dc642c3e2bd44e3ebeef6a189da210d3433ada7ca895121669a4e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:13:30,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:13:30,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:13:30,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:13:30,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:13:30,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:13:30,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:13:30,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:13:30,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:13:30,094 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:13:30,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:13:30,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:13:30,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:13:30,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:13:30,094 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:13:30,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:13:30,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:13:30,094 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:13:30,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:13:30,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:13:30,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:13:30,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:13:30,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:13:30,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:13:30,095 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:13:30,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:13:30,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:13:30,096 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:13:30,096 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:13:30,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:13:30,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:13:30,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:13:30,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:13:30,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:13:30,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:13:30,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:13:30,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:13:30,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:13:30,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:13:30,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:13:30,097 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:13:30,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:13:30,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:13:30,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:13:30,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:13:30,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:13:30,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:13:30,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:13:30,097 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-jdk21/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 -> cc64153296dc642c3e2bd44e3ebeef6a189da210d3433ada7ca895121669a4e6 [2025-01-09 14:13:30,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:13:30,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:13:30,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:13:30,357 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:13:30,358 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:13:30,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-9.i [2025-01-09 14:13:31,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e5c1b0b40/c907b46401644e56aa02ab799f79604b/FLAGba3ddc004 [2025-01-09 14:13:31,807 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:13:31,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-9.i [2025-01-09 14:13:31,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e5c1b0b40/c907b46401644e56aa02ab799f79604b/FLAGba3ddc004 [2025-01-09 14:13:32,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e5c1b0b40/c907b46401644e56aa02ab799f79604b [2025-01-09 14:13:32,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:13:32,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:13:32,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:13:32,113 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:13:32,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:13:32,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf5c4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32, skipping insertion in model container [2025-01-09 14:13:32,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:13:32,229 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-9.i[915,928] [2025-01-09 14:13:32,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:13:32,287 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:13:32,295 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-9.i[915,928] [2025-01-09 14:13:32,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:13:32,365 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:13:32,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32 WrapperNode [2025-01-09 14:13:32,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:13:32,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:13:32,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:13:32,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:13:32,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,434 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2025-01-09 14:13:32,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:13:32,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:13:32,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:13:32,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:13:32,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,478 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-01-09 14:13:32,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,494 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:13:32,521 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:13:32,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:13:32,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:13:32,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32" (1/1) ... [2025-01-09 14:13:32,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:13:32,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:13:32,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:13:32,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:13:32,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:13:32,578 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:13:32,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:13:32,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:13:32,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:13:32,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:13:32,653 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:13:32,654 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:13:33,075 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 14:13:33,075 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:13:33,082 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:13:33,082 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:13:33,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:13:33 BoogieIcfgContainer [2025-01-09 14:13:33,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:13:33,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:13:33,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:13:33,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:13:33,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:13:32" (1/3) ... [2025-01-09 14:13:33,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61224d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:13:33, skipping insertion in model container [2025-01-09 14:13:33,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:32" (2/3) ... [2025-01-09 14:13:33,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61224d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:13:33, skipping insertion in model container [2025-01-09 14:13:33,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:13:33" (3/3) ... [2025-01-09 14:13:33,089 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-9.i [2025-01-09 14:13:33,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:13:33,099 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-9.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:13:33,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:13:33,147 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;@88293f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:13:33,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:13:33,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 14:13:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 14:13:33,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:33,164 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:13:33,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:33,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:33,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1227989575, now seen corresponding path program 1 times [2025-01-09 14:13:33,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:13:33,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207603426] [2025-01-09 14:13:33,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:33,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:13:33,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 14:13:33,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 14:13:33,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:33,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 14:13:33,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:13:33,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207603426] [2025-01-09 14:13:33,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207603426] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:13:33,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452449645] [2025-01-09 14:13:33,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:33,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:13:33,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:13:33,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:13:33,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:13:33,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 14:13:33,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 14:13:33,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:33,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:33,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:13:33,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:13:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 14:13:33,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:13:33,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452449645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:13:33,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:13:33,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:13:33,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64465453] [2025-01-09 14:13:33,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:13:33,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:13:33,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:13:33,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:13:33,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:13:33,690 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:13:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:13:33,712 INFO L93 Difference]: Finished difference Result 207 states and 357 transitions. [2025-01-09 14:13:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:13:33,714 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2025-01-09 14:13:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:13:33,722 INFO L225 Difference]: With dead ends: 207 [2025-01-09 14:13:33,723 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 14:13:33,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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-01-09 14:13:33,727 INFO L435 NwaCegarLoop]: 158 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, 158 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-01-09 14:13:33,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:13:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 14:13:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 14:13:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 14:13:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 158 transitions. [2025-01-09 14:13:33,772 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 158 transitions. Word has length 171 [2025-01-09 14:13:33,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:13:33,776 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 158 transitions. [2025-01-09 14:13:33,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:13:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 158 transitions. [2025-01-09 14:13:33,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 14:13:33,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:33,782 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:13:33,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:13:33,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:13:33,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:33,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:33,985 INFO L85 PathProgramCache]: Analyzing trace with hash -368288513, now seen corresponding path program 1 times [2025-01-09 14:13:33,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:13:33,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145820614] [2025-01-09 14:13:33,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:33,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:13:34,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 14:13:34,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 14:13:34,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:34,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:13:34,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:13:34,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145820614] [2025-01-09 14:13:34,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145820614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:13:34,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:13:34,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:13:34,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114943969] [2025-01-09 14:13:34,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:13:34,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:13:34,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:13:34,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:13:34,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:13:34,275 INFO L87 Difference]: Start difference. First operand 103 states and 158 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:13:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:13:34,366 INFO L93 Difference]: Finished difference Result 247 states and 376 transitions. [2025-01-09 14:13:34,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:13:34,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2025-01-09 14:13:34,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:13:34,372 INFO L225 Difference]: With dead ends: 247 [2025-01-09 14:13:34,372 INFO L226 Difference]: Without dead ends: 147 [2025-01-09 14:13:34,372 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-01-09 14:13:34,373 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 75 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:13:34,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 312 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:13:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-09 14:13:34,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2025-01-09 14:13:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 114 states have internal predecessors, (157), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 14:13:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2025-01-09 14:13:34,398 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 171 [2025-01-09 14:13:34,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:13:34,399 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2025-01-09 14:13:34,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:13:34,399 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2025-01-09 14:13:34,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 14:13:34,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:34,402 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:13:34,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:13:34,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:34,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:34,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1092865210, now seen corresponding path program 1 times [2025-01-09 14:13:34,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:13:34,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555901271] [2025-01-09 14:13:34,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:34,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:13:34,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 14:13:34,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 14:13:34,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:34,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:13:34,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:13:34,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555901271] [2025-01-09 14:13:34,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555901271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:13:34,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:13:34,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:13:34,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097006531] [2025-01-09 14:13:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:13:34,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:13:34,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:13:34,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:13:34,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:13:34,673 INFO L87 Difference]: Start difference. First operand 144 states and 213 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:13:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:13:34,792 INFO L93 Difference]: Finished difference Result 420 states and 626 transitions. [2025-01-09 14:13:34,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:13:34,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2025-01-09 14:13:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:13:34,797 INFO L225 Difference]: With dead ends: 420 [2025-01-09 14:13:34,798 INFO L226 Difference]: Without dead ends: 279 [2025-01-09 14:13:34,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:13:34,799 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 129 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:13:34,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 455 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:13:34,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-01-09 14:13:34,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 192. [2025-01-09 14:13:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 134 states have (on average 1.335820895522388) internal successors, (179), 135 states have internal predecessors, (179), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 14:13:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 287 transitions. [2025-01-09 14:13:34,824 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 287 transitions. Word has length 172 [2025-01-09 14:13:34,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:13:34,828 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 287 transitions. [2025-01-09 14:13:34,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:13:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 287 transitions. [2025-01-09 14:13:34,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 14:13:34,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:34,829 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:13:34,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:13:34,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:34,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:34,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1600907190, now seen corresponding path program 1 times [2025-01-09 14:13:34,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:13:34,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762043848] [2025-01-09 14:13:34,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:34,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:13:34,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 14:13:34,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 14:13:34,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:34,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:13:34,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:13:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762043848] [2025-01-09 14:13:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762043848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:13:34,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:13:34,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:13:34,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893570890] [2025-01-09 14:13:34,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:13:34,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:13:34,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:13:34,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:13:34,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:13:34,930 INFO L87 Difference]: Start difference. First operand 192 states and 287 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:13:34,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:13:34,972 INFO L93 Difference]: Finished difference Result 474 states and 707 transitions. [2025-01-09 14:13:34,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:13:34,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2025-01-09 14:13:34,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:13:34,977 INFO L225 Difference]: With dead ends: 474 [2025-01-09 14:13:34,977 INFO L226 Difference]: Without dead ends: 333 [2025-01-09 14:13:34,978 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-01-09 14:13:34,978 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 100 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:13:34,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 304 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:13:34,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-01-09 14:13:35,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2025-01-09 14:13:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 243 states have (on average 1.3497942386831276) internal successors, (328), 245 states have internal predecessors, (328), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 14:13:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 492 transitions. [2025-01-09 14:13:35,030 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 492 transitions. Word has length 173 [2025-01-09 14:13:35,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:13:35,031 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 492 transitions. [2025-01-09 14:13:35,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:13:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 492 transitions. [2025-01-09 14:13:35,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 14:13:35,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:35,033 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:13:35,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:13:35,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:35,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:35,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1935231411, now seen corresponding path program 1 times [2025-01-09 14:13:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:13:35,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313986940] [2025-01-09 14:13:35,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:35,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:13:35,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 14:13:35,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 14:13:35,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:35,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:13:35,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [207470856] [2025-01-09 14:13:35,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:35,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:13:35,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:13:35,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:13:35,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:13:35,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 14:13:35,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 14:13:35,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:35,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:13:35,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:13:35,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 14:13:35,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 14:13:35,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:35,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:13:35,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:13:35,610 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:13:35,611 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:13:35,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:13:35,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:13:35,816 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 14:13:35,909 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:13:35,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:13:35 BoogieIcfgContainer [2025-01-09 14:13:35,912 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:13:35,912 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:13:35,912 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:13:35,912 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:13:35,913 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:13:33" (3/4) ... [2025-01-09 14:13:35,914 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:13:35,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:13:35,919 INFO L158 Benchmark]: Toolchain (without parser) took 3810.09ms. Allocated memory is still 201.3MB. Free memory was 154.9MB in the beginning and 109.4MB in the end (delta: 45.5MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2025-01-09 14:13:35,919 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 209.7MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:13:35,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.77ms. Allocated memory is still 201.3MB. Free memory was 154.9MB in the beginning and 138.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:13:35,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.03ms. Allocated memory is still 201.3MB. Free memory was 138.6MB in the beginning and 131.4MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:13:35,920 INFO L158 Benchmark]: Boogie Preprocessor took 85.49ms. Allocated memory is still 201.3MB. Free memory was 131.4MB in the beginning and 124.3MB in the end (delta: 7.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:13:35,920 INFO L158 Benchmark]: RCFGBuilder took 561.38ms. Allocated memory is still 201.3MB. Free memory was 124.3MB in the beginning and 85.8MB in the end (delta: 38.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 14:13:35,920 INFO L158 Benchmark]: TraceAbstraction took 2827.65ms. Allocated memory is still 201.3MB. Free memory was 85.3MB in the beginning and 109.4MB in the end (delta: -24.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:13:35,920 INFO L158 Benchmark]: Witness Printer took 5.83ms. Allocated memory is still 201.3MB. Free memory was 109.4MB in the beginning and 109.4MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:13:35,921 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.63ms. Allocated memory is still 209.7MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.77ms. Allocated memory is still 201.3MB. Free memory was 154.9MB in the beginning and 138.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.03ms. Allocated memory is still 201.3MB. Free memory was 138.6MB in the beginning and 131.4MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.49ms. Allocated memory is still 201.3MB. Free memory was 131.4MB in the beginning and 124.3MB in the end (delta: 7.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 561.38ms. Allocated memory is still 201.3MB. Free memory was 124.3MB in the beginning and 85.8MB in the end (delta: 38.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2827.65ms. Allocated memory is still 201.3MB. Free memory was 85.3MB in the beginning and 109.4MB in the end (delta: -24.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.83ms. Allocated memory is still 201.3MB. Free memory was 109.4MB in the beginning and 109.4MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 199, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 199, overapproximation of someBinaryDOUBLEComparisonOperation at line 187. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -128; [L23] double var_1_4 = 99999999999.6; [L24] unsigned char var_1_5 = 1; [L25] signed long int var_1_6 = -5; [L26] signed char var_1_10 = 64; [L27] signed char var_1_11 = 16; [L28] signed char var_1_12 = 4; [L29] signed char var_1_13 = 64; [L30] unsigned short int var_1_14 = 64; [L31] unsigned char var_1_16 = 8; [L32] unsigned char var_1_17 = 200; [L33] unsigned char var_1_18 = 1; [L34] signed long int var_1_19 = 10; [L35] signed long int var_1_20 = -256; [L36] signed char var_1_21 = 25; [L37] signed char var_1_23 = 1; [L38] signed char var_1_24 = 5; [L39] unsigned char var_1_25 = 0; [L40] double var_1_26 = 8.125; [L41] double var_1_27 = 0.875; [L42] double var_1_28 = 15.6; [L43] double var_1_29 = 2.5; [L44] unsigned long int var_1_30 = 25; [L45] signed long int var_1_31 = 50; [L46] signed short int var_1_32 = -8; [L47] unsigned char var_1_33 = 100; [L48] signed long int last_1_var_1_6 = -5; [L49] signed long int last_1_var_1_20 = -256; [L50] signed char last_1_var_1_21 = 25; VAL [isInitial=0, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_4=499999999998/5, var_1_5=1, var_1_6=-5] [L203] isInitial = 1 [L204] FCALL initially() [L206] CALL updateLastVariables() [L194] last_1_var_1_6 = var_1_6 [L195] last_1_var_1_20 = var_1_20 [L196] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_4=499999999998/5, var_1_5=1, var_1_6=-5] [L206] RET updateLastVariables() [L207] CALL updateVariables() [L152] var_1_4 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L153] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L154] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L154] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L155] var_1_5 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L156] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_6=-5] [L157] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L157] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=16, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L158] var_1_11 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L159] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L160] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L160] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L161] var_1_12 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L162] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L163] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L163] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L164] var_1_13 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L165] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L166] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L166] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=200, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L167] var_1_17 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_17 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L168] RET assume_abort_if_not(var_1_17 >= 190) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L169] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L169] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=1, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L170] var_1_18 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L171] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L172] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L172] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=1, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L173] var_1_23 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L174] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L175] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L175] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=5, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L176] var_1_24 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L177] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L178] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L178] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=0, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L180] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L181] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L181] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_27=7/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L182] var_1_27 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L183] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_28=78/5, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L184] var_1_28 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L185] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_29=5/2, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L186] var_1_29 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L187] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=50, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L188] var_1_31 = __VERIFIER_nondet_long() [L189] CALL assume_abort_if_not(var_1_31 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L189] RET assume_abort_if_not(var_1_31 >= -2147483648) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L190] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L190] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L191] CALL assume_abort_if_not(var_1_31 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L191] RET assume_abort_if_not(var_1_31 != 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L207] RET updateVariables() [L208] CALL step() [L54] COND TRUE \read(var_1_5) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L55] COND TRUE (last_1_var_1_6 < 1) || var_1_25 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_26=65/8, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L56] COND TRUE \read(var_1_25) [L57] var_1_26 = ((var_1_27 - var_1_28) + var_1_29) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L65] COND FALSE !((- var_1_26) >= (var_1_26 / var_1_4)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=-8, var_1_33=100, var_1_5=1, var_1_6=-5] [L70] var_1_32 = var_1_23 [L71] var_1_33 = var_1_18 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=64, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L72] COND FALSE !(! var_1_5) [L87] var_1_14 = var_1_13 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L89] unsigned short int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=8, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L90] COND FALSE !(! var_1_5) [L95] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=10, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L97] var_1_19 = var_1_16 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=25, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L98] COND FALSE !(((-32 + var_1_33) / var_1_17) >= ((var_1_13 - var_1_33) / var_1_31)) [L105] var_1_30 = var_1_33 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L107] COND FALSE !(var_1_1 == 0) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-5] [L110] COND FALSE !(var_1_14 < var_1_1) [L113] var_1_6 = var_1_1 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=64, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L116] COND TRUE \read(var_1_5) [L117] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-256, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L125] COND TRUE \read(var_1_5) [L126] var_1_20 = -10000000 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L142] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L143] EXPR last_1_var_1_21 & var_1_10 VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, stepLocal_1=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=25, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L143] COND TRUE ((last_1_var_1_21 & var_1_10) >= var_1_12) && stepLocal_1 [L144] var_1_21 = (var_1_18 + (var_1_23 - var_1_24)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L208] RET step() [L209] CALL, EXPR property() [L199] EXPR ((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14)))) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L199] EXPR (((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14))))) && ((((last_1_var_1_21 & var_1_10) >= var_1_12) && var_1_5) ? (var_1_21 == ((signed char) (var_1_18 + (var_1_23 - var_1_24)))) : ((! var_1_25) ? (var_1_21 == ((signed char) var_1_17)) : 1)) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L199-L200] return (((((((((((((- var_1_26) >= (var_1_26 / var_1_4)) ? (var_1_5 ? (var_1_1 == ((signed long int) 10)) : 1) : 1) && ((var_1_1 == 0) ? (var_1_6 == ((signed long int) (((((var_1_1 + var_1_32)) > (var_1_14)) ? ((var_1_1 + var_1_32)) : (var_1_14))))) : ((var_1_14 < var_1_1) ? (var_1_6 == ((signed long int) var_1_1)) : (var_1_6 == ((signed long int) var_1_1))))) && (var_1_5 ? (var_1_10 == ((signed char) var_1_11)) : ((var_1_33 == ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) ? (var_1_10 == ((signed char) (((((var_1_12 - var_1_13)) < (var_1_11)) ? ((var_1_12 - var_1_13)) : (var_1_11))))) : (var_1_10 == ((signed char) var_1_13))))) && ((! var_1_5) ? ((-4 <= var_1_33) ? (((((((- var_1_33)) > (var_1_33)) ? ((- var_1_33)) : (var_1_33))) >= var_1_33) ? (var_1_14 == ((unsigned short int) (((((var_1_33 + 5)) < (var_1_13)) ? ((var_1_33 + 5)) : (var_1_13))))) : ((! (var_1_26 < var_1_26)) ? (var_1_14 == ((unsigned short int) var_1_13)) : (var_1_14 == ((unsigned short int) var_1_33)))) : (var_1_14 == ((unsigned short int) var_1_13))) : (var_1_14 == ((unsigned short int) var_1_13)))) && ((! var_1_5) ? ((-2 >= var_1_14) ? (var_1_16 == ((unsigned char) (((((var_1_17 - var_1_18) - 32) < 0 ) ? -((var_1_17 - var_1_18) - 32) : ((var_1_17 - var_1_18) - 32))))) : 1) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_19 == ((signed long int) var_1_16))) && (var_1_5 ? (var_1_20 == ((signed long int) -10000000)) : ((var_1_11 <= var_1_10) ? ((last_1_var_1_20 <= ((var_1_14 / var_1_17) & var_1_33)) ? ((var_1_14 > var_1_33) ? (var_1_20 == ((signed long int) (last_1_var_1_20 + var_1_12))) : (var_1_20 == ((signed long int) last_1_var_1_20))) : (var_1_20 == ((signed long int) var_1_16))) : (var_1_20 == ((signed long int) var_1_14))))) && ((((last_1_var_1_21 & var_1_10) >= var_1_12) && var_1_5) ? (var_1_21 == ((signed char) (var_1_18 + (var_1_23 - var_1_24)))) : ((! var_1_25) ? (var_1_21 == ((signed char) var_1_17)) : 1))) && (var_1_5 ? (((last_1_var_1_6 < 1) || var_1_25) ? (var_1_25 ? (var_1_26 == ((double) ((var_1_27 - var_1_28) + var_1_29))) : 1) : (var_1_26 == ((double) var_1_28))) : (var_1_26 == ((double) var_1_28)))) && ((((-32 + var_1_33) / var_1_17) >= ((var_1_13 - var_1_33) / var_1_31)) ? ((var_1_16 > var_1_16) ? (var_1_30 == ((unsigned long int) var_1_18)) : (var_1_30 == ((unsigned long int) var_1_17))) : (var_1_30 == ((unsigned long int) var_1_33)))) && (var_1_32 == ((signed short int) var_1_23))) && (var_1_33 == ((unsigned char) var_1_18)) ; [L209] RET, EXPR property() [L209] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_20=-256, last_1_var_1_21=25, last_1_var_1_6=-5, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=38, var_1_14=38, var_1_16=33, var_1_17=190, var_1_18=33, var_1_19=33, var_1_1=-128, var_1_20=-10000000, var_1_21=0, var_1_23=0, var_1_24=33, var_1_25=1, var_1_30=33, var_1_31=2, var_1_32=0, var_1_33=33, var_1_5=1, var_1_6=-128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 304 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 304 mSDsluCounter, 1229 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 561 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 668 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 92 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1206 NumberOfCodeBlocks, 1206 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 853 ConstructedInterpolants, 0 QuantifiedInterpolants, 1269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 403 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 6450/6500 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-01-09 14:13:35,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-9.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 cc64153296dc642c3e2bd44e3ebeef6a189da210d3433ada7ca895121669a4e6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:13:37,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:13:37,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:13:37,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:13:37,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:13:38,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:13:38,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:13:38,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:13:38,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:13:38,004 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:13:38,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:13:38,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:13:38,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:13:38,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:13:38,004 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:13:38,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:13:38,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:13:38,004 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:13:38,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:13:38,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:13:38,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:13:38,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:13:38,005 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:13:38,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:13:38,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:13:38,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:13:38,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:13:38,006 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:13:38,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:13:38,006 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:13:38,006 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:13:38,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:13:38,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:13:38,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:13:38,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:13:38,006 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-jdk21/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 -> cc64153296dc642c3e2bd44e3ebeef6a189da210d3433ada7ca895121669a4e6 [2025-01-09 14:13:38,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:13:38,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:13:38,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:13:38,283 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:13:38,283 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:13:38,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-9.i [2025-01-09 14:13:39,493 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a022c964f/ed4b139d28f94121a496dfa15ce29210/FLAG2cb63ed5b [2025-01-09 14:13:39,739 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:13:39,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-9.i [2025-01-09 14:13:39,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a022c964f/ed4b139d28f94121a496dfa15ce29210/FLAG2cb63ed5b [2025-01-09 14:13:40,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a022c964f/ed4b139d28f94121a496dfa15ce29210 [2025-01-09 14:13:40,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:13:40,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:13:40,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:13:40,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:13:40,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:13:40,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73bdc75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40, skipping insertion in model container [2025-01-09 14:13:40,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:13:40,203 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-9.i[915,928] [2025-01-09 14:13:40,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:13:40,270 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:13:40,279 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-9.i[915,928] [2025-01-09 14:13:40,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:13:40,321 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:13:40,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40 WrapperNode [2025-01-09 14:13:40,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:13:40,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:13:40,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:13:40,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:13:40,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,371 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2025-01-09 14:13:40,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:13:40,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:13:40,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:13:40,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:13:40,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,397 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-01-09 14:13:40,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:13:40,436 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:13:40,436 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:13:40,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:13:40,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40" (1/1) ... [2025-01-09 14:13:40,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:13:40,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:13:40,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:13:40,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:13:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:13:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:13:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:13:40,498 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:13:40,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:13:40,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:13:40,569 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:13:40,571 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:13:49,577 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-01-09 14:13:49,578 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:13:49,585 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:13:49,585 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:13:49,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:13:49 BoogieIcfgContainer [2025-01-09 14:13:49,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:13:49,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:13:49,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:13:49,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:13:49,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:13:40" (1/3) ... [2025-01-09 14:13:49,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e098dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:13:49, skipping insertion in model container [2025-01-09 14:13:49,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:13:40" (2/3) ... [2025-01-09 14:13:49,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e098dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:13:49, skipping insertion in model container [2025-01-09 14:13:49,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:13:49" (3/3) ... [2025-01-09 14:13:49,592 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-9.i [2025-01-09 14:13:49,601 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:13:49,602 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-9.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:13:49,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:13:49,650 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;@34d6c0d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:13:49,650 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:13:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 14:13:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 14:13:49,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:49,661 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:13:49,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:49,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:49,665 INFO L85 PathProgramCache]: Analyzing trace with hash -52637721, now seen corresponding path program 1 times [2025-01-09 14:13:49,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:13:49,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877638870] [2025-01-09 14:13:49,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:49,678 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-01-09 14:13:49,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:13:49,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 14:13:49,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 14:13:49,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 14:13:50,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 14:13:50,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:50,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:50,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:13:50,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:13:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-01-09 14:13:50,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:13:50,658 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:13:50,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877638870] [2025-01-09 14:13:50,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877638870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:13:50,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:13:50,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:13:50,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413678026] [2025-01-09 14:13:50,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:13:50,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:13:50,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:13:50,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:13:50,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:13:50,684 INFO L87 Difference]: Start difference. First operand has 85 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:13:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:13:50,715 INFO L93 Difference]: Finished difference Result 163 states and 289 transitions. [2025-01-09 14:13:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:13:50,717 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2025-01-09 14:13:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:13:50,722 INFO L225 Difference]: With dead ends: 163 [2025-01-09 14:13:50,723 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 14:13:50,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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-01-09 14:13:50,730 INFO L435 NwaCegarLoop]: 124 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, 124 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-01-09 14:13:50,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:13:50,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 14:13:50,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 14:13:50,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 14:13:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2025-01-09 14:13:50,770 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 166 [2025-01-09 14:13:50,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:13:50,770 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2025-01-09 14:13:50,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 14:13:50,770 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2025-01-09 14:13:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 14:13:50,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:13:50,775 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:13:50,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 14:13:50,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 14:13:50,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:13:50,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:13:50,981 INFO L85 PathProgramCache]: Analyzing trace with hash -956939729, now seen corresponding path program 1 times [2025-01-09 14:13:50,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:13:50,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874518217] [2025-01-09 14:13:50,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:13:50,985 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-01-09 14:13:50,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:13:50,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 14:13:50,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 14:13:51,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 14:13:51,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 14:13:51,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:13:51,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:13:51,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 14:13:51,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:13:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:13:52,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:13:52,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:13:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874518217] [2025-01-09 14:13:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874518217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:13:52,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:13:52,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:13:52,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893323076] [2025-01-09 14:13:52,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:13:52,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:13:52,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:13:52,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:13:52,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:13:52,174 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:13:56,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:14:00,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:14:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:14:00,828 INFO L93 Difference]: Finished difference Result 190 states and 288 transitions. [2025-01-09 14:14:00,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:14:00,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2025-01-09 14:14:00,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:14:00,832 INFO L225 Difference]: With dead ends: 190 [2025-01-09 14:14:00,832 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 14:14:00,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 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-01-09 14:14:00,833 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 39 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:14:00,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 245 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-01-09 14:14:00,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 14:14:00,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2025-01-09 14:14:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 79 states have internal predecessors, (104), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 14:14:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2025-01-09 14:14:00,861 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 166 [2025-01-09 14:14:00,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:14:00,862 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2025-01-09 14:14:00,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:14:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2025-01-09 14:14:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 14:14:00,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:14:00,869 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:14:00,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:14:01,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 14:14:01,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:14:01,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:14:01,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1509142920, now seen corresponding path program 1 times [2025-01-09 14:14:01,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:14:01,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582067054] [2025-01-09 14:14:01,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:14:01,073 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-01-09 14:14:01,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:14:01,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 14:14:01,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 14:14:01,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 14:14:01,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 14:14:01,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:14:01,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:14:01,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 14:14:01,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:14:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:14:05,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:14:05,582 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:14:05,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582067054] [2025-01-09 14:14:05,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582067054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:14:05,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:14:05,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:14:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846067840] [2025-01-09 14:14:05,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:14:05,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:14:05,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:14:05,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:14:05,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:14:05,583 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:14:10,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:14:14,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:14:18,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:14:22,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:14:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:14:22,441 INFO L93 Difference]: Finished difference Result 315 states and 467 transitions. [2025-01-09 14:14:22,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:14:22,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2025-01-09 14:14:22,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:14:22,532 INFO L225 Difference]: With dead ends: 315 [2025-01-09 14:14:22,532 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 14:14:22,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:14:22,533 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 92 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 53 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:14:22,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 355 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 16.7s Time] [2025-01-09 14:14:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 14:14:22,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 157. [2025-01-09 14:14:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 99 states have (on average 1.2727272727272727) internal successors, (126), 100 states have internal predecessors, (126), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 14:14:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 234 transitions. [2025-01-09 14:14:22,574 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 234 transitions. Word has length 167 [2025-01-09 14:14:22,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:14:22,578 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 234 transitions. [2025-01-09 14:14:22,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:14:22,578 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2025-01-09 14:14:22,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 14:14:22,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:14:22,580 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:14:22,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:14:22,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-01-09 14:14:22,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:14:22,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:14:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1311653372, now seen corresponding path program 1 times [2025-01-09 14:14:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:14:22,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232779799] [2025-01-09 14:14:22,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:14:22,782 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-01-09 14:14:22,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:14:22,784 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-01-09 14:14:22,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 14:14:22,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 14:14:23,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 14:14:23,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:14:23,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:14:23,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 14:14:23,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:14:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 14:14:27,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:14:27,247 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:14:27,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232779799] [2025-01-09 14:14:27,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232779799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:14:27,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:14:27,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:14:27,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693190713] [2025-01-09 14:14:27,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:14:27,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:14:27,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:14:27,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:14:27,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:14:27,249 INFO L87 Difference]: Start difference. First operand 157 states and 234 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:14:31,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:14:35,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 14:14:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:14:35,549 INFO L93 Difference]: Finished difference Result 369 states and 548 transitions. [2025-01-09 14:14:35,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:14:35,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2025-01-09 14:14:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:14:35,647 INFO L225 Difference]: With dead ends: 369 [2025-01-09 14:14:35,647 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 14:14:35,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 166 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-01-09 14:14:35,648 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 37 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:14:35,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-01-09 14:14:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 14:14:35,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2025-01-09 14:14:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 173 states have (on average 1.283236994219653) internal successors, (222), 175 states have internal predecessors, (222), 82 states have call successors, (82), 5 states have call predecessors, (82), 5 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 14:14:35,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 386 transitions. [2025-01-09 14:14:35,678 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 386 transitions. Word has length 168 [2025-01-09 14:14:35,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:14:35,678 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 386 transitions. [2025-01-09 14:14:35,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 14:14:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 386 transitions. [2025-01-09 14:14:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 14:14:35,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:14:35,680 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:14:35,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 14:14:35,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-01-09 14:14:35,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:14:35,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:14:35,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1287227883, now seen corresponding path program 1 times [2025-01-09 14:14:35,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:14:35,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272549266] [2025-01-09 14:14:35,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:14:35,886 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-01-09 14:14:35,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:14:35,889 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-01-09 14:14:35,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (6)] Waiting until timeout for monitored process [2025-01-09 14:14:35,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 14:14:36,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 14:14:36,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:14:36,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:14:36,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 14:14:36,957 INFO L279 TraceCheckSpWp]: Computing forward predicates...