./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.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_codestructure_steplocals_file-77.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 26d624a9f364a3ec6745ec9e53f7f0150e248a4fcfa20eb8b3a2dbc29bb66a03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:51:51,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:51:51,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:51:51,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:51:51,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:51:51,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:51:51,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:51:51,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:51:51,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:51:51,334 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:51:51,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:51:51,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:51:51,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:51:51,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:51:51,336 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:51:51,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:51:51,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:51:51,336 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:51:51,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:51:51,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:51:51,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:51:51,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:51:51,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:51:51,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:51:51,337 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:51:51,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:51:51,337 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:51:51,337 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:51:51,337 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:51:51,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:51:51,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:51:51,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:51:51,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:51:51,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:51:51,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:51:51,338 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:51:51,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:51:51,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:51:51,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:51:51,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:51:51,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:51:51,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:51:51,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:51:51,339 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 -> 26d624a9f364a3ec6745ec9e53f7f0150e248a4fcfa20eb8b3a2dbc29bb66a03 [2025-02-05 20:51:51,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:51:51,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:51:51,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:51:51,580 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:51:51,580 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:51:51,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2025-02-05 20:51:52,731 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bd423db3/543dc0fd5dcc4c35927f8771a5d73ba0/FLAG1fc918a4e [2025-02-05 20:51:52,974 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:51:52,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2025-02-05 20:51:52,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bd423db3/543dc0fd5dcc4c35927f8771a5d73ba0/FLAG1fc918a4e [2025-02-05 20:51:52,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bd423db3/543dc0fd5dcc4c35927f8771a5d73ba0 [2025-02-05 20:51:53,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:51:53,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:51:53,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:51:53,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:51:53,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:51:53,006 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:51:52" (1/1) ... [2025-02-05 20:51:53,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d31ac5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53, skipping insertion in model container [2025-02-05 20:51:53,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:51:52" (1/1) ... [2025-02-05 20:51:53,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:51:53,168 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_codestructure_steplocals_file-77.i[917,930] [2025-02-05 20:51:53,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:51:53,212 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:51:53,230 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_codestructure_steplocals_file-77.i[917,930] [2025-02-05 20:51:53,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:51:53,281 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:51:53,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53 WrapperNode [2025-02-05 20:51:53,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:51:53,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:51:53,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:51:53,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:51:53,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53" (1/1) ... [2025-02-05 20:51:53,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53" (1/1) ... [2025-02-05 20:51:53,331 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2025-02-05 20:51:53,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:51:53,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:51:53,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:51:53,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:51:53,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53" (1/1) ... [2025-02-05 20:51:53,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53" (1/1) ... [2025-02-05 20:51:53,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53" (1/1) ... [2025-02-05 20:51:53,359 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-05 20:51:53,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53" (1/1) ... [2025-02-05 20:51:53,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53" (1/1) ... [2025-02-05 20:51:53,372 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53" (1/1) ... [2025-02-05 20:51:53,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53" (1/1) ... [2025-02-05 20:51:53,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53" (1/1) ... [2025-02-05 20:51:53,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53" (1/1) ... [2025-02-05 20:51:53,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:51:53,383 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:51:53,383 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:51:53,383 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:51:53,384 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53" (1/1) ... [2025-02-05 20:51:53,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:51:53,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:51:53,408 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-05 20:51:53,410 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-05 20:51:53,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:51:53,425 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:51:53,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:51:53,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:51:53,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:51:53,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:51:53,472 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:51:53,473 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:51:53,718 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 20:51:53,719 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:51:53,728 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:51:53,729 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:51:53,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:51:53 BoogieIcfgContainer [2025-02-05 20:51:53,729 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:51:53,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:51:53,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:51:53,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:51:53,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:51:52" (1/3) ... [2025-02-05 20:51:53,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5216e480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:51:53, skipping insertion in model container [2025-02-05 20:51:53,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:53" (2/3) ... [2025-02-05 20:51:53,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5216e480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:51:53, skipping insertion in model container [2025-02-05 20:51:53,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:51:53" (3/3) ... [2025-02-05 20:51:53,736 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-77.i [2025-02-05 20:51:53,746 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:51:53,748 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-77.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:51:53,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:51:53,795 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;@628b8972, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:51:53,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:51:53,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 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-05 20:51:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 20:51:53,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:51:53,811 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] [2025-02-05 20:51:53,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:51:53,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:51:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1565288917, now seen corresponding path program 1 times [2025-02-05 20:51:53,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:51:53,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938123781] [2025-02-05 20:51:53,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:51:53,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:51:53,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:51:53,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:51:53,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:51:53,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:51:54,069 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-05 20:51:54,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:51:54,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938123781] [2025-02-05 20:51:54,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938123781] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:51:54,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267856634] [2025-02-05 20:51:54,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:51:54,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:51:54,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:51:54,073 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-05 20:51:54,078 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-05 20:51:54,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:51:54,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:51:54,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:51:54,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:51:54,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:51:54,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:51:54,226 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-05 20:51:54,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:51:54,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267856634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:51:54,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:51:54,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:51:54,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120051772] [2025-02-05 20:51:54,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:51:54,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:51:54,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:51:54,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:51:54,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:51:54,256 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-05 20:51:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:51:54,279 INFO L93 Difference]: Finished difference Result 128 states and 220 transitions. [2025-02-05 20:51:54,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:51:54,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 146 [2025-02-05 20:51:54,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:51:54,287 INFO L225 Difference]: With dead ends: 128 [2025-02-05 20:51:54,287 INFO L226 Difference]: Without dead ends: 64 [2025-02-05 20:51:54,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 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-05 20:51:54,293 INFO L435 NwaCegarLoop]: 96 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, 96 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-05 20:51:54,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:51:54,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-05 20:51:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-05 20:51:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 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-05 20:51:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2025-02-05 20:51:54,321 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 146 [2025-02-05 20:51:54,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:51:54,321 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 96 transitions. [2025-02-05 20:51:54,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-05 20:51:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 96 transitions. [2025-02-05 20:51:54,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 20:51:54,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:51:54,323 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] [2025-02-05 20:51:54,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:51:54,528 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-05 20:51:54,528 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:51:54,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:51:54,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1104968936, now seen corresponding path program 1 times [2025-02-05 20:51:54,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:51:54,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885001245] [2025-02-05 20:51:54,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:51:54,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:51:54,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:51:54,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:51:54,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:51:54,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:51:54,912 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-05 20:51:54,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:51:54,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885001245] [2025-02-05 20:51:54,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885001245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:51:54,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:51:54,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:51:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782505605] [2025-02-05 20:51:54,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:51:54,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:51:54,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:51:54,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:51:54,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:51:54,914 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:51:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:51:55,137 INFO L93 Difference]: Finished difference Result 164 states and 240 transitions. [2025-02-05 20:51:55,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:51:55,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 146 [2025-02-05 20:51:55,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:51:55,141 INFO L225 Difference]: With dead ends: 164 [2025-02-05 20:51:55,142 INFO L226 Difference]: Without dead ends: 103 [2025-02-05 20:51:55,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:51:55,143 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 130 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:51:55,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 199 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:51:55,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-05 20:51:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2025-02-05 20:51:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 66 states have internal predecessors, (83), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 20:51:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 143 transitions. [2025-02-05 20:51:55,168 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 143 transitions. Word has length 146 [2025-02-05 20:51:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:51:55,168 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 143 transitions. [2025-02-05 20:51:55,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 20:51:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 143 transitions. [2025-02-05 20:51:55,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 20:51:55,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:51:55,170 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] [2025-02-05 20:51:55,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:51:55,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:51:55,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:51:55,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1104045415, now seen corresponding path program 1 times [2025-02-05 20:51:55,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:51:55,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435018481] [2025-02-05 20:51:55,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:51:55,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:51:55,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:51:55,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:51:55,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:51:55,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:51:55,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478431604] [2025-02-05 20:51:55,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:51:55,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:51:55,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:51:55,329 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-05 20:51:55,330 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-05 20:51:55,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:51:55,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:51:55,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:51:55,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:51:55,464 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:51:55,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:51:55,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:51:55,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:51:55,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:51:55,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:51:55,558 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:51:55,559 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:51:55,570 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-05 20:51:55,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:51:55,763 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-05 20:51:55,816 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:51:55,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:51:55 BoogieIcfgContainer [2025-02-05 20:51:55,819 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:51:55,819 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:51:55,819 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:51:55,819 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:51:55,820 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:51:53" (3/4) ... [2025-02-05 20:51:55,823 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:51:55,824 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:51:55,825 INFO L158 Benchmark]: Toolchain (without parser) took 2823.82ms. Allocated memory was 528.5MB in the beginning and 167.8MB in the end (delta: -360.7MB). Free memory was 484.1MB in the beginning and 95.7MB in the end (delta: 388.3MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2025-02-05 20:51:55,825 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:51:55,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.64ms. Allocated memory was 528.5MB in the beginning and 167.8MB in the end (delta: -360.7MB). Free memory was 484.1MB in the beginning and 109.7MB in the end (delta: 374.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:51:55,828 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.40ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 106.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:51:55,828 INFO L158 Benchmark]: Boogie Preprocessor took 50.94ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 102.2MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:51:55,828 INFO L158 Benchmark]: IcfgBuilder took 346.29ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 81.6MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 20:51:55,828 INFO L158 Benchmark]: TraceAbstraction took 2087.87ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 95.8MB in the end (delta: -14.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:51:55,828 INFO L158 Benchmark]: Witness Printer took 5.16ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 95.7MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:51:55,829 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.64ms. Allocated memory was 528.5MB in the beginning and 167.8MB in the end (delta: -360.7MB). Free memory was 484.1MB in the beginning and 109.7MB in the end (delta: 374.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.40ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 106.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.94ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 102.2MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 346.29ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 81.6MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2087.87ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 95.8MB in the end (delta: -14.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.16ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 95.7MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 66. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] float var_1_2 = 255.5; [L24] float var_1_3 = 99.8; [L25] signed char var_1_4 = -25; [L26] signed long int var_1_5 = -16; [L27] float var_1_6 = 255.25; [L28] unsigned short int var_1_7 = 16; [L29] signed char var_1_8 = -10; [L30] signed char var_1_9 = -8; [L31] unsigned short int var_1_10 = 8; [L32] unsigned short int var_1_11 = 10000; [L33] unsigned short int var_1_12 = 5; [L34] signed short int var_1_13 = 200; [L35] unsigned char var_1_14 = 0; [L36] unsigned char var_1_15 = 0; [L37] unsigned short int var_1_16 = 35895; [L38] unsigned short int var_1_17 = 18336; [L39] unsigned char var_1_18 = 0; [L40] signed long int var_1_19 = -50; VAL [isInitial=0, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_2=511/2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] FCALL updateLastVariables() [L139] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L92] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_3=499/5, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L93] var_1_3 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L94] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=-25, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L95] var_1_4 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L96] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L97] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L97] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-16, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L98] var_1_5 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L99] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L100] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L100] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_6=1021/4, var_1_7=16, var_1_8=-10, var_1_9=-8] [L101] var_1_6 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16, var_1_8=-10, var_1_9=-8] [L102] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16, var_1_8=-10, var_1_9=-8] [L103] var_1_7 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_8=-10, var_1_9=-8] [L104] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_8=-10, var_1_9=-8] [L105] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-8] [L105] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=-8] [L106] var_1_9 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L107] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L108] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L108] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=8, var_1_11=10000, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L109] var_1_11 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_11 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L110] RET assume_abort_if_not(var_1_11 >= 8191) VAL [isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L111] CALL assume_abort_if_not(var_1_11 <= 16384) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L111] RET assume_abort_if_not(var_1_11 <= 16384) VAL [isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=5, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L112] var_1_12 = __VERIFIER_nondet_ushort() [L113] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L113] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=139263, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L114] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L114] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=0, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L115] var_1_14 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L116] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L117] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L117] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=35895, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L118] var_1_16 = __VERIFIER_nondet_ushort() [L119] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L119] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L120] CALL assume_abort_if_not(var_1_16 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L120] RET assume_abort_if_not(var_1_16 <= 65535) VAL [isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=18336, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L121] var_1_17 = __VERIFIER_nondet_ushort() [L122] CALL assume_abort_if_not(var_1_17 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L122] RET assume_abort_if_not(var_1_17 >= 16383) VAL [isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L123] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L123] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L124] var_1_18 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L125] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L126] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L126] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L139] RET updateVariables() [L140] CALL step() [L44] signed long int stepLocal_0 = (((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)); VAL [isInitial=1, stepLocal_0=2, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=2, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L45] COND FALSE !(stepLocal_0 <= var_1_5) [L52] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=-10, var_1_9=126] [L54] COND TRUE (- var_1_7) < (var_1_5 * var_1_4) [L55] var_1_8 = var_1_9 VAL [isInitial=1, var_1_10=8, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=126, var_1_9=126] [L57] var_1_10 = (50 + ((var_1_11 + 10000) - var_1_12)) VAL [isInitial=1, var_1_10=8190, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=126, var_1_9=126] [L58] COND FALSE !((var_1_6 * var_1_2) <= var_1_3) VAL [isInitial=1, var_1_10=8190, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=126, var_1_9=126] [L65] signed long int stepLocal_1 = var_1_16 - (var_1_17 - 256); VAL [isInitial=1, stepLocal_1=16640, var_1_10=8190, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=126, var_1_9=126] [L66] COND FALSE !(var_1_3 != var_1_6) [L73] var_1_15 = var_1_18 VAL [isInitial=1, stepLocal_1=16640, var_1_10=8190, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=126, var_1_9=126] [L75] signed long int stepLocal_4 = - var_1_5; [L76] signed long int stepLocal_3 = var_1_7 + (128 + var_1_10); [L77] signed long int stepLocal_2 = ((((var_1_5) < (var_1_17)) ? (var_1_5) : (var_1_17))) / var_1_11; VAL [isInitial=1, stepLocal_1=16640, stepLocal_2=-1, stepLocal_3=24701, stepLocal_4=8191, var_1_10=8190, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=126, var_1_9=126] [L78] COND TRUE var_1_10 < stepLocal_4 VAL [isInitial=1, stepLocal_1=16640, stepLocal_2=-1, stepLocal_3=24701, var_1_10=8190, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=126, var_1_9=126] [L79] COND FALSE !(stepLocal_3 <= var_1_8) VAL [isInitial=1, stepLocal_1=16640, stepLocal_2=-1, var_1_10=8190, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=126, var_1_9=126] [L140] RET step() [L141] CALL, EXPR property() [L131-L132] return ((((((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) <= var_1_5) ? (((- var_1_3) > ((((var_1_2) > (var_1_6)) ? (var_1_2) : (var_1_6)))) ? (var_1_1 == ((unsigned short int) var_1_7)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) && (((- var_1_7) < (var_1_5 * var_1_4)) ? (var_1_8 == ((signed char) var_1_9)) : 1)) && (var_1_10 == ((unsigned short int) (50 + ((var_1_11 + 10000) - var_1_12))))) && (((var_1_6 * var_1_2) <= var_1_3) ? (var_1_14 ? (var_1_13 == ((signed short int) (-10 + var_1_12))) : (var_1_13 == ((signed short int) var_1_4))) : 1)) && ((var_1_3 != var_1_6) ? ((var_1_1 >= (var_1_16 - (var_1_17 - 256))) ? (var_1_15 == ((unsigned char) var_1_18)) : (var_1_15 == ((unsigned char) var_1_18))) : (var_1_15 == ((unsigned char) var_1_18)))) && ((var_1_10 < (- var_1_5)) ? (((var_1_7 + (128 + var_1_10)) <= var_1_8) ? (var_1_19 == ((signed long int) var_1_4)) : 1) : ((var_1_10 < (((((var_1_5) < (var_1_17)) ? (var_1_5) : (var_1_17))) / var_1_11)) ? (var_1_19 == ((signed long int) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : (var_1_19 == ((signed long int) var_1_16)))) ; VAL [\result=0, isInitial=1, var_1_10=8190, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=126, var_1_9=126] [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=8190, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=126, var_1_9=126] [L19] reach_error() VAL [isInitial=1, var_1_10=8190, var_1_11=139263, var_1_12=10051, var_1_13=200, var_1_14=1, var_1_15=0, var_1_16=32767, var_1_17=16383, var_1_18=0, var_1_19=-50, var_1_1=16383, var_1_4=2, var_1_5=-8191, var_1_7=16383, var_1_8=126, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 98 IncrementalHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 181 mSDtfsCounter, 98 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 730 NumberOfCodeBlocks, 730 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 435 ConstructedInterpolants, 0 QuantifiedInterpolants, 611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 327 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2992/3036 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-05 20:51:55,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.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 26d624a9f364a3ec6745ec9e53f7f0150e248a4fcfa20eb8b3a2dbc29bb66a03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:51:57,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:51:57,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:51:57,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:51:57,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:51:57,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:51:57,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:51:57,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:51:57,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:51:57,932 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:51:57,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:51:57,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:51:57,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:51:57,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:51:57,934 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:51:57,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:51:57,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:51:57,934 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:51:57,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:51:57,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:51:57,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:51:57,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:51:57,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:51:57,935 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:51:57,935 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:51:57,935 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:51:57,935 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:51:57,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:51:57,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:51:57,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:51:57,936 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:51:57,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:51:57,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:51:57,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:51:57,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:51:57,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:51:57,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:51:57,937 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:51:57,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:51:57,937 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:51:57,937 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:51:57,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:51:57,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:51:57,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:51:57,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:51:57,937 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 -> 26d624a9f364a3ec6745ec9e53f7f0150e248a4fcfa20eb8b3a2dbc29bb66a03 [2025-02-05 20:51:58,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:51:58,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:51:58,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:51:58,220 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:51:58,221 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:51:58,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2025-02-05 20:51:59,491 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20c373b5a/48f3c221e7ca4d99a9ed93757a2e2d07/FLAGc03c39972 [2025-02-05 20:51:59,701 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:51:59,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-77.i [2025-02-05 20:51:59,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20c373b5a/48f3c221e7ca4d99a9ed93757a2e2d07/FLAGc03c39972 [2025-02-05 20:51:59,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/20c373b5a/48f3c221e7ca4d99a9ed93757a2e2d07 [2025-02-05 20:51:59,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:51:59,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:51:59,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:51:59,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:51:59,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:51:59,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:51:59" (1/1) ... [2025-02-05 20:51:59,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b952a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59, skipping insertion in model container [2025-02-05 20:51:59,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:51:59" (1/1) ... [2025-02-05 20:51:59,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:51:59,850 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_codestructure_steplocals_file-77.i[917,930] [2025-02-05 20:51:59,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:51:59,918 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:51:59,928 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_codestructure_steplocals_file-77.i[917,930] [2025-02-05 20:51:59,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:51:59,974 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:51:59,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59 WrapperNode [2025-02-05 20:51:59,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:51:59,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:51:59,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:51:59,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:51:59,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59" (1/1) ... [2025-02-05 20:51:59,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59" (1/1) ... [2025-02-05 20:52:00,013 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2025-02-05 20:52:00,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:52:00,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:52:00,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:52:00,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:52:00,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59" (1/1) ... [2025-02-05 20:52:00,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59" (1/1) ... [2025-02-05 20:52:00,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59" (1/1) ... [2025-02-05 20:52:00,036 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-05 20:52:00,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59" (1/1) ... [2025-02-05 20:52:00,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59" (1/1) ... [2025-02-05 20:52:00,044 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59" (1/1) ... [2025-02-05 20:52:00,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59" (1/1) ... [2025-02-05 20:52:00,046 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59" (1/1) ... [2025-02-05 20:52:00,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59" (1/1) ... [2025-02-05 20:52:00,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:52:00,049 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:52:00,050 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:52:00,050 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:52:00,050 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59" (1/1) ... [2025-02-05 20:52:00,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:52:00,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:52:00,077 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-05 20:52:00,079 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-05 20:52:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:52:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:52:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:52:00,095 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:52:00,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:52:00,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:52:00,143 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:52:00,149 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:52:00,717 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 20:52:00,718 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:52:00,726 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:52:00,728 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:52:00,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:52:00 BoogieIcfgContainer [2025-02-05 20:52:00,728 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:52:00,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:52:00,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:52:00,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:52:00,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:51:59" (1/3) ... [2025-02-05 20:52:00,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47282a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:52:00, skipping insertion in model container [2025-02-05 20:52:00,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:51:59" (2/3) ... [2025-02-05 20:52:00,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47282a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:52:00, skipping insertion in model container [2025-02-05 20:52:00,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:52:00" (3/3) ... [2025-02-05 20:52:00,738 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-77.i [2025-02-05 20:52:00,767 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:52:00,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-77.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:52:00,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:52:00,820 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;@ed56a78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:52:00,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:52:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 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-05 20:52:00,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 20:52:00,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:52:00,836 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] [2025-02-05 20:52:00,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:52:00,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:52:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1565288917, now seen corresponding path program 1 times [2025-02-05 20:52:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:52:00,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697651422] [2025-02-05 20:52:00,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:52:00,852 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-05 20:52:00,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:52:00,858 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-05 20:52:00,862 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-05 20:52:00,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:52:01,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:52:01,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:52:01,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:52:01,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:52:01,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:52:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2025-02-05 20:52:01,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:52:01,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:52:01,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697651422] [2025-02-05 20:52:01,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697651422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:52:01,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:52:01,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:52:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933197757] [2025-02-05 20:52:01,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:52:01,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:52:01,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:52:01,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:52:01,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:52:01,124 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 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 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-05 20:52:01,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:52:01,140 INFO L93 Difference]: Finished difference Result 128 states and 220 transitions. [2025-02-05 20:52:01,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:52:01,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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 146 [2025-02-05 20:52:01,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:52:01,145 INFO L225 Difference]: With dead ends: 128 [2025-02-05 20:52:01,146 INFO L226 Difference]: Without dead ends: 64 [2025-02-05 20:52:01,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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-05 20:52:01,150 INFO L435 NwaCegarLoop]: 96 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, 96 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-05 20:52:01,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:52:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-05 20:52:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-05 20:52:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 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-05 20:52:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2025-02-05 20:52:01,176 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 146 [2025-02-05 20:52:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:52:01,176 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 96 transitions. [2025-02-05 20:52:01,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-05 20:52:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 96 transitions. [2025-02-05 20:52:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 20:52:01,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:52:01,180 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] [2025-02-05 20:52:01,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:52:01,384 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-05 20:52:01,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:52:01,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:52:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1104968936, now seen corresponding path program 1 times [2025-02-05 20:52:01,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:52:01,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186060209] [2025-02-05 20:52:01,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:52:01,386 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-05 20:52:01,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:52:01,388 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-05 20:52:01,390 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-05 20:52:01,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:52:01,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:52:01,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:52:01,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:52:01,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 20:52:01,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:52:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 590 proven. 78 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-02-05 20:52:02,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:52:02,670 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-05 20:52:02,671 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:52:02,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186060209] [2025-02-05 20:52:02,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186060209] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:52:02,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:52:02,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2025-02-05 20:52:02,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804212738] [2025-02-05 20:52:02,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:52:02,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:52:02,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:52:02,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:52:02,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:52:02,673 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-05 20:52:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:52:03,114 INFO L93 Difference]: Finished difference Result 126 states and 190 transitions. [2025-02-05 20:52:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:52:03,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 146 [2025-02-05 20:52:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:52:03,127 INFO L225 Difference]: With dead ends: 126 [2025-02-05 20:52:03,127 INFO L226 Difference]: Without dead ends: 65 [2025-02-05 20:52:03,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:52:03,131 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:52:03,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 182 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:52:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-05 20:52:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2025-02-05 20:52:03,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 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-05 20:52:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2025-02-05 20:52:03,139 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 146 [2025-02-05 20:52:03,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:52:03,140 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2025-02-05 20:52:03,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-05 20:52:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2025-02-05 20:52:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 20:52:03,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:52:03,142 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] [2025-02-05 20:52:03,150 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-05 20:52:03,346 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-05 20:52:03,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:52:03,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:52:03,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1104045415, now seen corresponding path program 1 times [2025-02-05 20:52:03,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:52:03,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868211179] [2025-02-05 20:52:03,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:52:03,347 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-05 20:52:03,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:52:03,349 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-05 20:52:03,351 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-05 20:52:03,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:52:03,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:52:03,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:52:03,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:52:03,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 20:52:03,585 INFO L279 TraceCheckSpWp]: Computing forward predicates...