./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-93.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 72006f0e0119dbb436ff3eb0610d23abbaee42e3643f2bc291ef949bbdad90db --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:07:21,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:07:21,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:07:21,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:07:21,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:07:21,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:07:21,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:07:21,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:07:21,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:07:21,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:07:21,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:07:21,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:07:21,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:07:21,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:07:21,164 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:07:21,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:07:21,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:07:21,165 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:07:21,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:07:21,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:07:21,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:07:21,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:07:21,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:07:21,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:07:21,166 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:07:21,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:07:21,166 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:07:21,166 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:07:21,166 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:07:21,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:07:21,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:07:21,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:07:21,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:07:21,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:07:21,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:07:21,168 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:07:21,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:07:21,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:07:21,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:07:21,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:07:21,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:07:21,168 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:07:21,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:07:21,168 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 -> 72006f0e0119dbb436ff3eb0610d23abbaee42e3643f2bc291ef949bbdad90db [2025-02-06 02:07:21,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:07:21,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:07:21,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:07:21,490 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:07:21,490 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:07:21,492 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-93.i [2025-02-06 02:07:22,819 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d0f45d25/daa6454fe8144d99b8eab5a5a94c817b/FLAG007183d97 [2025-02-06 02:07:23,072 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:07:23,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-93.i [2025-02-06 02:07:23,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d0f45d25/daa6454fe8144d99b8eab5a5a94c817b/FLAG007183d97 [2025-02-06 02:07:23,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d0f45d25/daa6454fe8144d99b8eab5a5a94c817b [2025-02-06 02:07:23,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:07:23,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:07:23,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:07:23,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:07:23,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:07:23,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:07:23" (1/1) ... [2025-02-06 02:07:23,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311e5e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23, skipping insertion in model container [2025-02-06 02:07:23,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:07:23" (1/1) ... [2025-02-06 02:07:23,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:07:23,266 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-93.i[916,929] [2025-02-06 02:07:23,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:07:23,384 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:07:23,395 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-93.i[916,929] [2025-02-06 02:07:23,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:07:23,459 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:07:23,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23 WrapperNode [2025-02-06 02:07:23,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:07:23,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:07:23,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:07:23,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:07:23,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23" (1/1) ... [2025-02-06 02:07:23,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23" (1/1) ... [2025-02-06 02:07:23,525 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2025-02-06 02:07:23,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:07:23,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:07:23,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:07:23,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:07:23,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23" (1/1) ... [2025-02-06 02:07:23,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23" (1/1) ... [2025-02-06 02:07:23,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23" (1/1) ... [2025-02-06 02:07:23,573 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-02-06 02:07:23,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23" (1/1) ... [2025-02-06 02:07:23,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23" (1/1) ... [2025-02-06 02:07:23,594 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23" (1/1) ... [2025-02-06 02:07:23,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23" (1/1) ... [2025-02-06 02:07:23,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23" (1/1) ... [2025-02-06 02:07:23,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23" (1/1) ... [2025-02-06 02:07:23,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:07:23,609 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:07:23,610 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:07:23,610 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:07:23,611 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23" (1/1) ... [2025-02-06 02:07:23,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:07:23,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:07:23,642 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-02-06 02:07:23,647 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-02-06 02:07:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:07:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:07:23,665 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:07:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:07:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:07:23,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:07:23,729 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:07:23,731 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:07:24,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L187: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-02-06 02:07:24,269 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-06 02:07:24,269 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:07:24,290 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:07:24,291 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:07:24,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:07:24 BoogieIcfgContainer [2025-02-06 02:07:24,291 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:07:24,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:07:24,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:07:24,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:07:24,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:07:23" (1/3) ... [2025-02-06 02:07:24,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac72e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:07:24, skipping insertion in model container [2025-02-06 02:07:24,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:23" (2/3) ... [2025-02-06 02:07:24,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac72e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:07:24, skipping insertion in model container [2025-02-06 02:07:24,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:07:24" (3/3) ... [2025-02-06 02:07:24,301 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-93.i [2025-02-06 02:07:24,314 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:07:24,317 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-93.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:07:24,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:07:24,386 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;@4d6dbdfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:07:24,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:07:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 61 states have internal predecessors, (89), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 02:07:24,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 02:07:24,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:07:24,404 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:07:24,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:07:24,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:07:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1327524051, now seen corresponding path program 1 times [2025-02-06 02:07:24,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:07:24,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913918813] [2025-02-06 02:07:24,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:07:24,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:07:24,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 02:07:24,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 02:07:24,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:24,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:07:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-06 02:07:24,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:07:24,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913918813] [2025-02-06 02:07:24,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913918813] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:07:24,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671535686] [2025-02-06 02:07:24,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:07:24,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:07:24,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:07:24,713 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-02-06 02:07:24,716 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-02-06 02:07:24,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 02:07:24,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 02:07:24,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:24,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:07:24,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:07:24,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:07:24,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-06 02:07:24,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:07:24,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671535686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:07:24,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:07:24,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:07:24,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996332604] [2025-02-06 02:07:24,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:07:24,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:07:24,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:07:24,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:07:24,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:07:24,970 INFO L87 Difference]: Start difference. First operand has 86 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 61 states have internal predecessors, (89), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 02:07:25,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:07:25,001 INFO L93 Difference]: Finished difference Result 164 states and 284 transitions. [2025-02-06 02:07:25,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:07:25,003 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2025-02-06 02:07:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:07:25,012 INFO L225 Difference]: With dead ends: 164 [2025-02-06 02:07:25,013 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 02:07:25,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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-02-06 02:07:25,018 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:07:25,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:07:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 02:07:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 02:07:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 02:07:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2025-02-06 02:07:25,065 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 155 [2025-02-06 02:07:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:07:25,066 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2025-02-06 02:07:25,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 02:07:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2025-02-06 02:07:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 02:07:25,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:07:25,069 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:07:25,076 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-02-06 02:07:25,269 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-02-06 02:07:25,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:07:25,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:07:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash 406364182, now seen corresponding path program 1 times [2025-02-06 02:07:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:07:25,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553296663] [2025-02-06 02:07:25,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:07:25,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:07:25,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 02:07:25,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 02:07:25,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:25,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:07:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 02:07:25,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:07:25,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553296663] [2025-02-06 02:07:25,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553296663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:07:25,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:07:25,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:07:25,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356252765] [2025-02-06 02:07:25,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:07:25,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:07:25,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:07:25,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:07:25,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:07:25,593 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 02:07:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:07:25,706 INFO L93 Difference]: Finished difference Result 234 states and 358 transitions. [2025-02-06 02:07:25,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:07:25,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2025-02-06 02:07:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:07:25,710 INFO L225 Difference]: With dead ends: 234 [2025-02-06 02:07:25,711 INFO L226 Difference]: Without dead ends: 156 [2025-02-06 02:07:25,712 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-02-06 02:07:25,712 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 111 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:07:25,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 326 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:07:25,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-06 02:07:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 82. [2025-02-06 02:07:25,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 02:07:25,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2025-02-06 02:07:25,733 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 155 [2025-02-06 02:07:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:07:25,735 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2025-02-06 02:07:25,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 02:07:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2025-02-06 02:07:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 02:07:25,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:07:25,737 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:07:25,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:07:25,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:07:25,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:07:25,741 INFO L85 PathProgramCache]: Analyzing trace with hash -99194443, now seen corresponding path program 1 times [2025-02-06 02:07:25,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:07:25,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90305414] [2025-02-06 02:07:25,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:07:25,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:07:25,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 02:07:25,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 02:07:25,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:25,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:07:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 02:07:25,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:07:25,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90305414] [2025-02-06 02:07:25,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90305414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:07:25,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:07:25,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:07:25,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210031035] [2025-02-06 02:07:25,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:07:25,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:07:25,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:07:25,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:07:25,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:07:25,948 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 02:07:26,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:07:26,052 INFO L93 Difference]: Finished difference Result 240 states and 366 transitions. [2025-02-06 02:07:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:07:26,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2025-02-06 02:07:26,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:07:26,057 INFO L225 Difference]: With dead ends: 240 [2025-02-06 02:07:26,059 INFO L226 Difference]: Without dead ends: 161 [2025-02-06 02:07:26,061 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-02-06 02:07:26,064 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 110 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:07:26,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 307 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:07:26,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-06 02:07:26,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2025-02-06 02:07:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-06 02:07:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 241 transitions. [2025-02-06 02:07:26,096 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 241 transitions. Word has length 155 [2025-02-06 02:07:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:07:26,097 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 241 transitions. [2025-02-06 02:07:26,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 02:07:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 241 transitions. [2025-02-06 02:07:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 02:07:26,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:07:26,101 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:07:26,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:07:26,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:07:26,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:07:26,102 INFO L85 PathProgramCache]: Analyzing trace with hash 29888276, now seen corresponding path program 1 times [2025-02-06 02:07:26,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:07:26,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498430954] [2025-02-06 02:07:26,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:07:26,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:07:26,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 02:07:26,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 02:07:26,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:26,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:07:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 02:07:26,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:07:26,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498430954] [2025-02-06 02:07:26,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498430954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:07:26,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:07:26,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:07:26,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614881708] [2025-02-06 02:07:26,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:07:26,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:07:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:07:26,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:07:26,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:07:26,387 INFO L87 Difference]: Start difference. First operand 159 states and 241 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 02:07:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:07:26,579 INFO L93 Difference]: Finished difference Result 421 states and 638 transitions. [2025-02-06 02:07:26,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:07:26,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2025-02-06 02:07:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:07:26,583 INFO L225 Difference]: With dead ends: 421 [2025-02-06 02:07:26,583 INFO L226 Difference]: Without dead ends: 265 [2025-02-06 02:07:26,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:07:26,587 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 112 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:07:26,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 575 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:07:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-02-06 02:07:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 205. [2025-02-06 02:07:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 132 states have (on average 1.303030303030303) internal successors, (172), 132 states have internal predecessors, (172), 69 states have call successors, (69), 3 states have call predecessors, (69), 3 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 02:07:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 310 transitions. [2025-02-06 02:07:26,638 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 310 transitions. Word has length 155 [2025-02-06 02:07:26,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:07:26,638 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 310 transitions. [2025-02-06 02:07:26,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 02:07:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 310 transitions. [2025-02-06 02:07:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 02:07:26,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:07:26,642 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:07:26,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:07:26,643 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:07:26,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:07:26,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1031132437, now seen corresponding path program 1 times [2025-02-06 02:07:26,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:07:26,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273500658] [2025-02-06 02:07:26,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:07:26,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:07:26,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 02:07:26,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 02:07:26,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:26,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:07:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 02:07:26,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:07:26,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273500658] [2025-02-06 02:07:26,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273500658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:07:26,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:07:26,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:07:26,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276824236] [2025-02-06 02:07:26,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:07:26,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:07:26,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:07:26,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:07:26,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:07:26,929 INFO L87 Difference]: Start difference. First operand 205 states and 310 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 02:07:27,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:07:27,131 INFO L93 Difference]: Finished difference Result 422 states and 638 transitions. [2025-02-06 02:07:27,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:07:27,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2025-02-06 02:07:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:07:27,135 INFO L225 Difference]: With dead ends: 422 [2025-02-06 02:07:27,135 INFO L226 Difference]: Without dead ends: 265 [2025-02-06 02:07:27,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-06 02:07:27,139 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 79 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:07:27,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 330 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:07:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-02-06 02:07:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2025-02-06 02:07:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 174 states have (on average 1.3735632183908046) internal successors, (239), 174 states have internal predecessors, (239), 69 states have call successors, (69), 3 states have call predecessors, (69), 3 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 02:07:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 377 transitions. [2025-02-06 02:07:27,179 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 377 transitions. Word has length 155 [2025-02-06 02:07:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:07:27,179 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 377 transitions. [2025-02-06 02:07:27,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 02:07:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 377 transitions. [2025-02-06 02:07:27,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-06 02:07:27,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:07:27,181 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:07:27,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:07:27,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:07:27,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:07:27,184 INFO L85 PathProgramCache]: Analyzing trace with hash -41072366, now seen corresponding path program 1 times [2025-02-06 02:07:27,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:07:27,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705059760] [2025-02-06 02:07:27,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:07:27,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:07:27,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 02:07:27,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 02:07:27,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:27,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:07:27,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 02:07:27,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:07:27,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705059760] [2025-02-06 02:07:27,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705059760] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:07:27,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257002099] [2025-02-06 02:07:27,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:07:27,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:07:27,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:07:27,868 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-02-06 02:07:27,870 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-02-06 02:07:27,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-06 02:07:28,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-06 02:07:28,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:28,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:07:28,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 02:07:28,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:07:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 481 proven. 36 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-02-06 02:07:28,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:07:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2025-02-06 02:07:29,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257002099] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:07:29,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:07:29,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 25 [2025-02-06 02:07:29,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645499834] [2025-02-06 02:07:29,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:07:29,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 02:07:29,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:07:29,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 02:07:29,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-02-06 02:07:29,344 INFO L87 Difference]: Start difference. First operand 247 states and 377 transitions. Second operand has 25 states, 24 states have (on average 4.541666666666667) internal successors, (109), 23 states have internal predecessors, (109), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 8 states have call predecessors, (69), 8 states have call successors, (69) [2025-02-06 02:07:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:07:30,542 INFO L93 Difference]: Finished difference Result 601 states and 902 transitions. [2025-02-06 02:07:30,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 02:07:30,543 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.541666666666667) internal successors, (109), 23 states have internal predecessors, (109), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 8 states have call predecessors, (69), 8 states have call successors, (69) Word has length 157 [2025-02-06 02:07:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:07:30,546 INFO L225 Difference]: With dead ends: 601 [2025-02-06 02:07:30,546 INFO L226 Difference]: Without dead ends: 405 [2025-02-06 02:07:30,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=439, Invalid=1201, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 02:07:30,548 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 767 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:07:30,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 804 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:07:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-02-06 02:07:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 255. [2025-02-06 02:07:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 180 states have (on average 1.3555555555555556) internal successors, (244), 180 states have internal predecessors, (244), 69 states have call successors, (69), 5 states have call predecessors, (69), 5 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 02:07:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 382 transitions. [2025-02-06 02:07:30,588 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 382 transitions. Word has length 157 [2025-02-06 02:07:30,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:07:30,589 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 382 transitions. [2025-02-06 02:07:30,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.541666666666667) internal successors, (109), 23 states have internal predecessors, (109), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 8 states have call predecessors, (69), 8 states have call successors, (69) [2025-02-06 02:07:30,589 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 382 transitions. [2025-02-06 02:07:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 02:07:30,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:07:30,591 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:07:30,600 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-02-06 02:07:30,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:07:30,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:07:30,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:07:30,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1404703387, now seen corresponding path program 1 times [2025-02-06 02:07:30,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:07:30,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270002708] [2025-02-06 02:07:30,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:07:30,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:07:30,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 02:07:30,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 02:07:30,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:30,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:07:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 02:07:31,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:07:31,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270002708] [2025-02-06 02:07:31,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270002708] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:07:31,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843000331] [2025-02-06 02:07:31,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:07:31,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:07:31,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:07:31,201 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:07:31,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:07:31,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 02:07:31,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 02:07:31,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:31,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:07:31,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 02:07:31,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:07:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 372 proven. 51 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2025-02-06 02:07:31,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:07:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 02:07:32,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843000331] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:07:32,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:07:32,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 19 [2025-02-06 02:07:32,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911613423] [2025-02-06 02:07:32,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:07:32,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 02:07:32,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:07:32,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 02:07:32,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-02-06 02:07:32,037 INFO L87 Difference]: Start difference. First operand 255 states and 382 transitions. Second operand has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 19 states have internal predecessors, (101), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2025-02-06 02:07:32,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:07:32,825 INFO L93 Difference]: Finished difference Result 549 states and 813 transitions. [2025-02-06 02:07:32,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 02:07:32,825 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 19 states have internal predecessors, (101), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) Word has length 158 [2025-02-06 02:07:32,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:07:32,828 INFO L225 Difference]: With dead ends: 549 [2025-02-06 02:07:32,828 INFO L226 Difference]: Without dead ends: 353 [2025-02-06 02:07:32,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=1014, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 02:07:32,830 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 623 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:07:32,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 908 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:07:32,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-06 02:07:32,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 301. [2025-02-06 02:07:32,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 213 states have (on average 1.295774647887324) internal successors, (276), 215 states have internal predecessors, (276), 79 states have call successors, (79), 8 states have call predecessors, (79), 8 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2025-02-06 02:07:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 434 transitions. [2025-02-06 02:07:32,868 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 434 transitions. Word has length 158 [2025-02-06 02:07:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:07:32,869 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 434 transitions. [2025-02-06 02:07:32,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 19 states have internal predecessors, (101), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2025-02-06 02:07:32,869 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 434 transitions. [2025-02-06 02:07:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 02:07:32,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:07:32,871 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:07:32,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 02:07:33,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:07:33,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:07:33,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:07:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash 995879162, now seen corresponding path program 1 times [2025-02-06 02:07:33,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:07:33,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832501530] [2025-02-06 02:07:33,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:07:33,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:07:33,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 02:07:33,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 02:07:33,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:33,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:07:33,224 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 02:07:33,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 02:07:33,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 02:07:33,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:33,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 02:07:33,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 02:07:33,719 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 02:07:33,720 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:07:33,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:07:33,723 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:07:33,851 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:07:33,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:07:33 BoogieIcfgContainer [2025-02-06 02:07:33,857 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:07:33,858 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:07:33,858 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:07:33,858 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:07:33,859 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:07:24" (3/4) ... [2025-02-06 02:07:33,861 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 02:07:33,862 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:07:33,863 INFO L158 Benchmark]: Toolchain (without parser) took 10762.55ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 64.3MB in the end (delta: 93.7MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB. [2025-02-06 02:07:33,863 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:07:33,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.42ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 141.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 02:07:33,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.39ms. Allocated memory is still 201.3MB. Free memory was 141.6MB in the beginning and 135.7MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:07:33,864 INFO L158 Benchmark]: Boogie Preprocessor took 82.74ms. Allocated memory is still 201.3MB. Free memory was 135.7MB in the beginning and 125.3MB in the end (delta: 10.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:07:33,864 INFO L158 Benchmark]: IcfgBuilder took 682.02ms. Allocated memory is still 201.3MB. Free memory was 125.3MB in the beginning and 93.2MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 02:07:33,865 INFO L158 Benchmark]: TraceAbstraction took 9563.10ms. Allocated memory is still 201.3MB. Free memory was 92.4MB in the beginning and 64.3MB in the end (delta: 28.1MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2025-02-06 02:07:33,865 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 201.3MB. Free memory was 64.3MB in the beginning and 64.3MB in the end (delta: 39.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:07:33,866 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.23ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.42ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 141.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.39ms. Allocated memory is still 201.3MB. Free memory was 141.6MB in the beginning and 135.7MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.74ms. Allocated memory is still 201.3MB. Free memory was 135.7MB in the beginning and 125.3MB in the end (delta: 10.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 682.02ms. Allocated memory is still 201.3MB. Free memory was 125.3MB in the beginning and 93.2MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9563.10ms. Allocated memory is still 201.3MB. Free memory was 92.4MB in the beginning and 64.3MB in the end (delta: 28.1MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 201.3MB. Free memory was 64.3MB in the beginning and 64.3MB in the end (delta: 39.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of bitwiseOr at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 151. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] unsigned char var_1_4 = 1; [L24] double var_1_7 = 31.25; [L25] double var_1_8 = 7.6; [L26] double var_1_9 = 8.9; [L27] double var_1_10 = 256.8; [L28] signed short int var_1_11 = 0; [L29] unsigned long int var_1_15 = 64; [L30] signed short int var_1_18 = 16; [L31] signed short int var_1_19 = 22006; [L32] unsigned char var_1_21 = 1; [L33] unsigned char var_1_22 = 0; [L34] float var_1_23 = 2.25; [L35] signed long int var_1_24 = -1; [L36] unsigned char var_1_26 = 32; [L37] unsigned char var_1_27 = 200; [L38] unsigned char var_1_28 = 5; [L39] unsigned char var_1_29 = 64; [L40] unsigned char var_1_30 = 64; [L41] unsigned char var_1_31 = 32; [L42] unsigned char var_1_32 = 5; [L43] signed char var_1_33 = 2; [L44] signed char var_1_34 = 32; [L45] unsigned short int var_1_35 = 16; [L46] float var_1_37 = 63.5; [L47] signed long int last_1_var_1_24 = -1; [L48] unsigned char last_1_var_1_26 = 32; [L49] signed char last_1_var_1_33 = 2; [L50] unsigned short int last_1_var_1_35 = 16; VAL [isInitial=0, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L181] last_1_var_1_24 = var_1_24 [L182] last_1_var_1_26 = var_1_26 [L183] last_1_var_1_33 = var_1_33 [L184] last_1_var_1_35 = var_1_35 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L194] RET updateLastVariables() [L195] CALL updateVariables() [L143] var_1_4 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L144] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L145] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L145] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L146] var_1_8 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_9=89/10] [L147] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_9=89/10] [L148] var_1_9 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L149] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L150] var_1_10 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L151] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L152] var_1_19 = __VERIFIER_nondet_short() [L153] CALL assume_abort_if_not(var_1_19 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L153] RET assume_abort_if_not(var_1_19 >= 16383) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L154] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L154] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L155] var_1_22 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L156] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L157] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L157] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L158] var_1_27 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_27 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L159] RET assume_abort_if_not(var_1_27 >= 190) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L160] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L160] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L161] var_1_28 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L162] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L163] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L163] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L164] var_1_29 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_29 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L165] RET assume_abort_if_not(var_1_29 >= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L166] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L166] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L167] var_1_30 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_30 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L168] RET assume_abort_if_not(var_1_30 >= 31) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L169] CALL assume_abort_if_not(var_1_30 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L169] RET assume_abort_if_not(var_1_30 <= 64) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L171] RET assume_abort_if_not(var_1_31 >= 32) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L172] CALL assume_abort_if_not(var_1_31 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L172] RET assume_abort_if_not(var_1_31 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L173] var_1_32 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L174] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L175] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L175] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L176] var_1_34 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L177] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L178] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L178] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L195] RET updateVariables() [L196] CALL step() [L54] signed long int stepLocal_6 = last_1_var_1_24; [L55] unsigned char stepLocal_5 = var_1_30; [L56] signed long int stepLocal_4 = last_1_var_1_24; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=-225, stepLocal_6=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L57] EXPR last_1_var_1_35 | 100000000 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=-225, stepLocal_6=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L57] COND TRUE stepLocal_6 < (last_1_var_1_35 | 100000000) [L58] COND TRUE stepLocal_5 > last_1_var_1_35 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=63, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L59] COND FALSE !(var_1_19 < stepLocal_4) [L62] var_1_35 = (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33)))))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=63, var_1_35=95, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L74] COND TRUE \read(var_1_4) [L75] var_1_21 = (! var_1_22) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=63, var_1_35=95, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L77] COND TRUE ! var_1_21 [L78] var_1_23 = var_1_8 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=-1, var_1_26=32, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=63, var_1_35=95, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=658439168] [L80] COND TRUE (var_1_8 + 199.375) <= 10.5 [L81] var_1_26 = ((var_1_27 - var_1_28) - (var_1_29 - 1)) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=-1, var_1_26=94, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=2, var_1_34=63, var_1_35=95, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=658439168] [L89] COND TRUE \read(var_1_22) [L90] var_1_33 = ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=-1, var_1_26=94, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=4, var_1_34=63, var_1_35=95, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=658439168] [L92] var_1_37 = var_1_10 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=658439169, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=-1, var_1_26=94, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=4, var_1_34=63, var_1_35=95, var_1_37=658439169, var_1_4=1, var_1_7=125/4, var_1_8=658439168] [L93] COND FALSE !((- var_1_8) != var_1_23) [L96] var_1_11 = ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=658439169, var_1_11=94, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=-1, var_1_26=94, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=4, var_1_34=63, var_1_35=95, var_1_37=658439169, var_1_4=1, var_1_7=125/4, var_1_8=658439168] [L98] COND TRUE var_1_26 == var_1_11 [L99] var_1_15 = ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=658439169, var_1_11=94, var_1_15=95, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=-1, var_1_26=94, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=4, var_1_34=63, var_1_35=95, var_1_37=658439169, var_1_4=1, var_1_7=125/4, var_1_8=658439168] [L107] COND FALSE !((var_1_11 == var_1_15) && var_1_21) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=658439169, var_1_11=94, var_1_15=95, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=-1, var_1_26=94, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=4, var_1_34=63, var_1_35=95, var_1_37=658439169, var_1_4=1, var_1_7=125/4, var_1_8=658439168] [L110] signed short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_3=94, var_1_10=658439169, var_1_11=94, var_1_15=95, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=-1, var_1_26=94, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=4, var_1_34=63, var_1_35=95, var_1_37=658439169, var_1_4=1, var_1_7=125/4, var_1_8=658439168] [L111] COND TRUE var_1_1 != stepLocal_3 [L112] var_1_18 = (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=658439169, var_1_11=94, var_1_15=95, var_1_18=-32664, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=-1, var_1_26=94, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=4, var_1_34=63, var_1_35=95, var_1_37=658439169, var_1_4=1, var_1_7=125/4, var_1_8=658439168] [L114] COND FALSE !(var_1_18 != var_1_18) [L123] var_1_24 = var_1_26 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=658439169, var_1_11=94, var_1_15=95, var_1_18=-32664, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=94, var_1_26=94, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=4, var_1_34=63, var_1_35=95, var_1_37=658439169, var_1_4=1, var_1_7=125/4, var_1_8=658439168] [L125] signed short int stepLocal_2 = var_1_11; [L126] signed long int stepLocal_1 = var_1_1; [L127] unsigned short int stepLocal_0 = var_1_35; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_0=95, stepLocal_1=-256, stepLocal_2=94, var_1_10=658439169, var_1_11=94, var_1_15=95, var_1_18=-32664, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=94, var_1_26=94, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=4, var_1_34=63, var_1_35=95, var_1_37=658439169, var_1_4=1, var_1_7=125/4, var_1_8=658439168] [L128] COND FALSE !(stepLocal_0 == var_1_1) [L139] var_1_7 = var_1_10 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_1=-256, stepLocal_2=94, var_1_10=658439169, var_1_11=94, var_1_15=95, var_1_18=-32664, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=94, var_1_26=94, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=4, var_1_34=63, var_1_35=95, var_1_37=658439169, var_1_4=1, var_1_7=658439169, var_1_8=658439168] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR ((((((((((((var_1_11 == var_1_15) && var_1_21) ? (var_1_1 == ((signed long int) ((((var_1_33) < (var_1_33)) ? (var_1_33) : (var_1_33))))) : 1) && ((var_1_35 == var_1_1) ? ((var_1_11 < var_1_1) ? (var_1_7 == ((double) ((var_1_8 - var_1_9) + var_1_10))) : ((var_1_1 >= 25) ? (var_1_7 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_7 == ((double) var_1_10)))) : (var_1_7 == ((double) var_1_10)))) && (((- var_1_8) != var_1_23) ? (var_1_11 == ((signed short int) (500 + var_1_26))) : (var_1_11 == ((signed short int) ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))))))) && ((var_1_26 == var_1_11) ? (var_1_15 == ((unsigned long int) ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))))) : ((var_1_9 < var_1_37) ? (var_1_15 == ((unsigned long int) var_1_35)) : (var_1_15 == ((unsigned long int) var_1_35))))) && ((var_1_1 != var_1_11) ? (var_1_18 == ((signed short int) (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))))) : 1)) && (var_1_4 ? (var_1_21 == ((unsigned char) (! var_1_22))) : 1)) && ((! var_1_21) ? (var_1_23 == ((float) var_1_8)) : 1)) && ((var_1_18 != var_1_18) ? (((1u ^ var_1_19) > (- var_1_35)) ? (var_1_24 == ((signed long int) var_1_26)) : (var_1_22 ? (var_1_24 == ((signed long int) last_1_var_1_24)) : 1)) : (var_1_24 == ((signed long int) var_1_26)))) && (((var_1_8 + 199.375) <= 10.5) ? (var_1_26 == ((unsigned char) ((var_1_27 - var_1_28) - (var_1_29 - 1)))) : (var_1_21 ? (var_1_26 == ((unsigned char) ((var_1_29 - var_1_28) + ((var_1_30 + var_1_31) - var_1_32)))) : (var_1_26 == ((unsigned char) var_1_28))))) && (var_1_22 ? (var_1_33 == ((signed char) ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)))) : 1)) && ((last_1_var_1_24 < (last_1_var_1_35 | 100000000)) ? ((var_1_30 > last_1_var_1_35) ? ((var_1_19 < last_1_var_1_24) ? (var_1_35 == ((unsigned short int) ((var_1_29 + var_1_28) + var_1_31))) : (var_1_35 == ((unsigned short int) (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))))))) : (var_1_35 == ((unsigned short int) ((((var_1_32) > (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))) ? (var_1_32) : (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))))))) : ((var_1_8 != var_1_10) ? (var_1_35 == ((unsigned short int) ((((last_1_var_1_33) > (last_1_var_1_26)) ? (last_1_var_1_33) : (last_1_var_1_26))))) : (var_1_35 == ((unsigned short int) var_1_28)))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=658439169, var_1_11=94, var_1_15=95, var_1_18=-32664, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=94, var_1_26=94, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=4, var_1_34=63, var_1_35=95, var_1_37=658439169, var_1_4=1, var_1_7=658439169, var_1_8=658439168] [L187-L188] return (((((((((((((var_1_11 == var_1_15) && var_1_21) ? (var_1_1 == ((signed long int) ((((var_1_33) < (var_1_33)) ? (var_1_33) : (var_1_33))))) : 1) && ((var_1_35 == var_1_1) ? ((var_1_11 < var_1_1) ? (var_1_7 == ((double) ((var_1_8 - var_1_9) + var_1_10))) : ((var_1_1 >= 25) ? (var_1_7 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_7 == ((double) var_1_10)))) : (var_1_7 == ((double) var_1_10)))) && (((- var_1_8) != var_1_23) ? (var_1_11 == ((signed short int) (500 + var_1_26))) : (var_1_11 == ((signed short int) ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))))))) && ((var_1_26 == var_1_11) ? (var_1_15 == ((unsigned long int) ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))))) : ((var_1_9 < var_1_37) ? (var_1_15 == ((unsigned long int) var_1_35)) : (var_1_15 == ((unsigned long int) var_1_35))))) && ((var_1_1 != var_1_11) ? (var_1_18 == ((signed short int) (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))))) : 1)) && (var_1_4 ? (var_1_21 == ((unsigned char) (! var_1_22))) : 1)) && ((! var_1_21) ? (var_1_23 == ((float) var_1_8)) : 1)) && ((var_1_18 != var_1_18) ? (((1u ^ var_1_19) > (- var_1_35)) ? (var_1_24 == ((signed long int) var_1_26)) : (var_1_22 ? (var_1_24 == ((signed long int) last_1_var_1_24)) : 1)) : (var_1_24 == ((signed long int) var_1_26)))) && (((var_1_8 + 199.375) <= 10.5) ? (var_1_26 == ((unsigned char) ((var_1_27 - var_1_28) - (var_1_29 - 1)))) : (var_1_21 ? (var_1_26 == ((unsigned char) ((var_1_29 - var_1_28) + ((var_1_30 + var_1_31) - var_1_32)))) : (var_1_26 == ((unsigned char) var_1_28))))) && (var_1_22 ? (var_1_33 == ((signed char) ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)))) : 1)) && ((last_1_var_1_24 < (last_1_var_1_35 | 100000000)) ? ((var_1_30 > last_1_var_1_35) ? ((var_1_19 < last_1_var_1_24) ? (var_1_35 == ((unsigned short int) ((var_1_29 + var_1_28) + var_1_31))) : (var_1_35 == ((unsigned short int) (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))))))) : (var_1_35 == ((unsigned short int) ((((var_1_32) > (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))) ? (var_1_32) : (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))))))) : ((var_1_8 != var_1_10) ? (var_1_35 == ((unsigned short int) ((((last_1_var_1_33) > (last_1_var_1_26)) ? (last_1_var_1_33) : (last_1_var_1_26))))) : (var_1_35 == ((unsigned short int) var_1_28))))) && (var_1_37 == ((float) var_1_10)) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=658439169, var_1_11=94, var_1_15=95, var_1_18=-32664, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=94, var_1_26=94, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=4, var_1_34=63, var_1_35=95, var_1_37=658439169, var_1_4=1, var_1_7=658439169, var_1_8=658439168] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=658439169, var_1_11=94, var_1_15=95, var_1_18=-32664, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=658439168, var_1_24=94, var_1_26=94, var_1_27=658439163, var_1_28=10271, var_1_29=-2592385, var_1_30=-225, var_1_31=38948, var_1_32=-256, var_1_33=4, var_1_34=63, var_1_35=95, var_1_37=658439169, var_1_4=1, var_1_7=658439169, var_1_8=658439168] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 8, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1803 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1802 mSDsluCounter, 3371 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2399 mSDsCounter, 738 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1545 IncrementalHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 738 mSolverCounterUnsat, 972 mSDtfsCounter, 1545 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 864 GetRequests, 778 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=7, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 356 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1718 NumberOfCodeBlocks, 1718 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1863 ConstructedInterpolants, 0 QuantifiedInterpolants, 5394 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1155 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 11851/12144 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-02-06 02:07:33,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-93.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 72006f0e0119dbb436ff3eb0610d23abbaee42e3643f2bc291ef949bbdad90db --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:07:36,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:07:36,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 02:07:36,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:07:36,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:07:36,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:07:36,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:07:36,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:07:36,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:07:36,258 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:07:36,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:07:36,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:07:36,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:07:36,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:07:36,260 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:07:36,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:07:36,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:07:36,260 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:07:36,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:07:36,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:07:36,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:07:36,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:07:36,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:07:36,261 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 02:07:36,261 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 02:07:36,261 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 02:07:36,261 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:07:36,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:07:36,261 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:07:36,262 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:07:36,262 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:07:36,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:07:36,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:07:36,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:07:36,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:07:36,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:07:36,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:07:36,263 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:07:36,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:07:36,263 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 02:07:36,263 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 02:07:36,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:07:36,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:07:36,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:07:36,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:07:36,264 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 -> 72006f0e0119dbb436ff3eb0610d23abbaee42e3643f2bc291ef949bbdad90db [2025-02-06 02:07:36,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:07:36,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:07:36,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:07:36,602 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:07:36,602 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:07:36,603 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-93.i [2025-02-06 02:07:37,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d1aa15c6/4eb16eda7a9d4d51bd1bfd740d32faf1/FLAGb850316e4 [2025-02-06 02:07:38,242 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:07:38,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-93.i [2025-02-06 02:07:38,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d1aa15c6/4eb16eda7a9d4d51bd1bfd740d32faf1/FLAGb850316e4 [2025-02-06 02:07:38,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d1aa15c6/4eb16eda7a9d4d51bd1bfd740d32faf1 [2025-02-06 02:07:38,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:07:38,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:07:38,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:07:38,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:07:38,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:07:38,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:07:38" (1/1) ... [2025-02-06 02:07:38,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53731e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38, skipping insertion in model container [2025-02-06 02:07:38,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:07:38" (1/1) ... [2025-02-06 02:07:38,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:07:38,664 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-93.i[916,929] [2025-02-06 02:07:38,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:07:38,747 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:07:38,757 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-93.i[916,929] [2025-02-06 02:07:38,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:07:38,802 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:07:38,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38 WrapperNode [2025-02-06 02:07:38,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:07:38,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:07:38,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:07:38,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:07:38,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38" (1/1) ... [2025-02-06 02:07:38,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38" (1/1) ... [2025-02-06 02:07:38,846 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2025-02-06 02:07:38,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:07:38,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:07:38,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:07:38,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:07:38,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38" (1/1) ... [2025-02-06 02:07:38,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38" (1/1) ... [2025-02-06 02:07:38,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38" (1/1) ... [2025-02-06 02:07:38,879 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-02-06 02:07:38,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38" (1/1) ... [2025-02-06 02:07:38,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38" (1/1) ... [2025-02-06 02:07:38,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38" (1/1) ... [2025-02-06 02:07:38,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38" (1/1) ... [2025-02-06 02:07:38,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38" (1/1) ... [2025-02-06 02:07:38,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38" (1/1) ... [2025-02-06 02:07:38,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:07:38,898 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:07:38,898 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:07:38,898 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:07:38,899 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38" (1/1) ... [2025-02-06 02:07:38,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:07:38,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:07:38,934 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-02-06 02:07:38,937 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-02-06 02:07:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:07:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 02:07:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:07:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:07:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:07:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:07:39,057 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:07:39,060 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:07:46,397 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-06 02:07:46,398 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:07:46,412 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:07:46,413 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:07:46,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:07:46 BoogieIcfgContainer [2025-02-06 02:07:46,413 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:07:46,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:07:46,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:07:46,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:07:46,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:07:38" (1/3) ... [2025-02-06 02:07:46,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372e6561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:07:46, skipping insertion in model container [2025-02-06 02:07:46,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:07:38" (2/3) ... [2025-02-06 02:07:46,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372e6561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:07:46, skipping insertion in model container [2025-02-06 02:07:46,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:07:46" (3/3) ... [2025-02-06 02:07:46,423 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-93.i [2025-02-06 02:07:46,435 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:07:46,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-93.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:07:46,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:07:46,498 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;@7701a80b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:07:46,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:07:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 02:07:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 02:07:46,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:07:46,514 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:07:46,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:07:46,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:07:46,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1847481794, now seen corresponding path program 1 times [2025-02-06 02:07:46,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:07:46,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402128380] [2025-02-06 02:07:46,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:07:46,533 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-02-06 02:07:46,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:07:46,537 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-02-06 02:07:46,539 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-02-06 02:07:46,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 02:07:46,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 02:07:46,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:46,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:07:46,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:07:46,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:07:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2025-02-06 02:07:46,990 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:07:46,990 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:07:46,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402128380] [2025-02-06 02:07:46,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402128380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:07:46,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:07:46,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 02:07:46,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215419145] [2025-02-06 02:07:46,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:07:46,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:07:46,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:07:47,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:07:47,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:07:47,015 INFO L87 Difference]: Start difference. First operand has 77 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 02:07:47,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:07:47,044 INFO L93 Difference]: Finished difference Result 146 states and 256 transitions. [2025-02-06 02:07:47,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:07:47,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2025-02-06 02:07:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:07:47,051 INFO L225 Difference]: With dead ends: 146 [2025-02-06 02:07:47,052 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 02:07:47,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-02-06 02:07:47,057 INFO L435 NwaCegarLoop]: 111 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, 111 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-02-06 02:07:47,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:07:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 02:07:47,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-06 02:07:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 02:07:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 111 transitions. [2025-02-06 02:07:47,092 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 111 transitions. Word has length 152 [2025-02-06 02:07:47,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:07:47,092 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 111 transitions. [2025-02-06 02:07:47,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 02:07:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 111 transitions. [2025-02-06 02:07:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 02:07:47,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:07:47,096 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:07:47,108 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-02-06 02:07:47,298 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-02-06 02:07:47,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:07:47,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:07:47,300 INFO L85 PathProgramCache]: Analyzing trace with hash 363076959, now seen corresponding path program 1 times [2025-02-06 02:07:47,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:07:47,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973172428] [2025-02-06 02:07:47,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:07:47,301 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-02-06 02:07:47,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:07:47,303 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-02-06 02:07:47,306 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-02-06 02:07:47,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 02:07:47,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 02:07:47,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:47,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:07:47,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 02:07:47,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:07:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 02:07:47,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:07:47,797 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:07:47,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973172428] [2025-02-06 02:07:47,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973172428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:07:47,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:07:47,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:07:47,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340592855] [2025-02-06 02:07:47,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:07:47,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:07:47,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:07:47,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:07:47,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:07:47,804 INFO L87 Difference]: Start difference. First operand 72 states and 111 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 02:07:51,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:07:51,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:07:51,428 INFO L93 Difference]: Finished difference Result 207 states and 322 transitions. [2025-02-06 02:07:51,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:07:51,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2025-02-06 02:07:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:07:51,432 INFO L225 Difference]: With dead ends: 207 [2025-02-06 02:07:51,432 INFO L226 Difference]: Without dead ends: 138 [2025-02-06 02:07:51,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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-02-06 02:07:51,433 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 99 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:07:51,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 296 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-06 02:07:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-06 02:07:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 73. [2025-02-06 02:07:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 02:07:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2025-02-06 02:07:51,446 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 152 [2025-02-06 02:07:51,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:07:51,447 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2025-02-06 02:07:51,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 02:07:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2025-02-06 02:07:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 02:07:51,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:07:51,470 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:07:51,483 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 (3)] Ended with exit code 0 [2025-02-06 02:07:51,671 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-02-06 02:07:51,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:07:51,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:07:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash 492159678, now seen corresponding path program 1 times [2025-02-06 02:07:51,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:07:51,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086233178] [2025-02-06 02:07:51,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:07:51,673 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-02-06 02:07:51,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:07:51,677 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-02-06 02:07:51,678 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-02-06 02:07:51,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 02:07:52,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 02:07:52,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:07:52,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:07:52,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 02:07:52,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:07:53,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 456 proven. 45 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2025-02-06 02:07:53,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:07:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 02:07:54,095 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:07:54,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086233178] [2025-02-06 02:07:54,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086233178] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:07:54,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:07:54,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-02-06 02:07:54,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862676956] [2025-02-06 02:07:54,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:07:54,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:07:54,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:07:54,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:07:54,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:07:54,099 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-02-06 02:07:59,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:08:03,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:08:07,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:08:09,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 02:08:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:08:11,388 INFO L93 Difference]: Finished difference Result 241 states and 363 transitions. [2025-02-06 02:08:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 02:08:11,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 152 [2025-02-06 02:08:11,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:08:11,391 INFO L225 Difference]: With dead ends: 241 [2025-02-06 02:08:11,391 INFO L226 Difference]: Without dead ends: 171 [2025-02-06 02:08:11,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2025-02-06 02:08:11,396 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 232 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 94 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:08:11,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 377 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 312 Invalid, 3 Unknown, 0 Unchecked, 16.7s Time] [2025-02-06 02:08:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-06 02:08:11,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 162. [2025-02-06 02:08:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 105 states have internal predecessors, (135), 53 states have call successors, (53), 4 states have call predecessors, (53), 4 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-06 02:08:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 241 transitions. [2025-02-06 02:08:11,442 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 241 transitions. Word has length 152 [2025-02-06 02:08:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:08:11,443 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 241 transitions. [2025-02-06 02:08:11,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-02-06 02:08:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 241 transitions. [2025-02-06 02:08:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 02:08:11,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:08:11,447 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:08:11,460 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 (4)] Ended with exit code 0 [2025-02-06 02:08:11,647 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-02-06 02:08:11,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:08:11,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:08:11,648 INFO L85 PathProgramCache]: Analyzing trace with hash 295646173, now seen corresponding path program 1 times [2025-02-06 02:08:11,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 02:08:11,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385058283] [2025-02-06 02:08:11,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:08:11,649 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-02-06 02:08:11,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 02:08:11,652 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-02-06 02:08:11,653 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-02-06 02:08:11,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 02:08:12,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 02:08:12,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:08:12,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:08:12,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:08:12,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:08:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 186 proven. 60 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-02-06 02:08:20,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:08:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 02:08:38,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 02:08:38,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385058283] [2025-02-06 02:08:38,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385058283] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:08:38,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 02:08:38,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-06 02:08:38,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716919207] [2025-02-06 02:08:38,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 02:08:38,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:08:38,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 02:08:38,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:08:38,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:08:38,567 INFO L87 Difference]: Start difference. First operand 162 states and 241 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46)