./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cfa1db2b7b11c8a5c678532d9720edadc9dcf8095da3555b92876b462fef0528 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:03:59,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:03:59,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:03:59,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:03:59,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:03:59,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:03:59,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:03:59,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:03:59,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:03:59,486 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:03:59,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:03:59,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:03:59,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:03:59,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:03:59,488 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:03:59,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:03:59,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:03:59,488 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:03:59,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:03:59,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:03:59,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:03:59,489 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:03:59,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:03:59,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:03:59,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:03:59,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:03:59,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:03:59,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:03:59,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:03:59,490 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cfa1db2b7b11c8a5c678532d9720edadc9dcf8095da3555b92876b462fef0528 [2025-03-03 19:03:59,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:03:59,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:03:59,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:03:59,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:03:59,707 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:03:59,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i [2025-03-03 19:04:00,831 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f95f528/1edf8580bd55431e8659208db7b9deaa/FLAGd112ade39 [2025-03-03 19:04:01,078 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:04:01,080 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i [2025-03-03 19:04:01,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f95f528/1edf8580bd55431e8659208db7b9deaa/FLAGd112ade39 [2025-03-03 19:04:01,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54f95f528/1edf8580bd55431e8659208db7b9deaa [2025-03-03 19:04:01,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:04:01,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:04:01,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:04:01,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:04:01,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:04:01,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:04:01" (1/1) ... [2025-03-03 19:04:01,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c66aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01, skipping insertion in model container [2025-03-03 19:04:01,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:04:01" (1/1) ... [2025-03-03 19:04:01,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:04:01,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i[917,930] [2025-03-03 19:04:01,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:04:01,594 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:04:01,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i[917,930] [2025-03-03 19:04:01,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:04:01,645 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:04:01,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01 WrapperNode [2025-03-03 19:04:01,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:04:01,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:04:01,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:04:01,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:04:01,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01" (1/1) ... [2025-03-03 19:04:01,660 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01" (1/1) ... [2025-03-03 19:04:01,682 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2025-03-03 19:04:01,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:04:01,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:04:01,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:04:01,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:04:01,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01" (1/1) ... [2025-03-03 19:04:01,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01" (1/1) ... [2025-03-03 19:04:01,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01" (1/1) ... [2025-03-03 19:04:01,701 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:04:01,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01" (1/1) ... [2025-03-03 19:04:01,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01" (1/1) ... [2025-03-03 19:04:01,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01" (1/1) ... [2025-03-03 19:04:01,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01" (1/1) ... [2025-03-03 19:04:01,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01" (1/1) ... [2025-03-03 19:04:01,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01" (1/1) ... [2025-03-03 19:04:01,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:04:01,716 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:04:01,716 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:04:01,716 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:04:01,717 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01" (1/1) ... [2025-03-03 19:04:01,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:04:01,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:04:01,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:04:01,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:04:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:04:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:04:01,760 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:04:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:04:01,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:04:01,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:04:01,818 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:04:01,819 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:04:02,066 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:04:02,066 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:04:02,076 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:04:02,076 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:04:02,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:04:02 BoogieIcfgContainer [2025-03-03 19:04:02,076 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:04:02,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:04:02,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:04:02,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:04:02,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:04:01" (1/3) ... [2025-03-03 19:04:02,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195bcad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:04:02, skipping insertion in model container [2025-03-03 19:04:02,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:01" (2/3) ... [2025-03-03 19:04:02,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195bcad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:04:02, skipping insertion in model container [2025-03-03 19:04:02,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:04:02" (3/3) ... [2025-03-03 19:04:02,084 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-58.i [2025-03-03 19:04:02,093 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:04:02,095 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-58.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:04:02,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:04:02,151 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;@3dc2ecd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:04:02,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:04:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:04:02,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 19:04:02,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:02,166 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:02,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:02,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:02,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1168699156, now seen corresponding path program 1 times [2025-03-03 19:04:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:04:02,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906831379] [2025-03-03 19:04:02,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:02,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:04:02,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 19:04:02,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 19:04:02,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:02,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 19:04:02,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:04:02,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906831379] [2025-03-03 19:04:02,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906831379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:04:02,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568105471] [2025-03-03 19:04:02,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:02,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:04:02,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:04:02,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:04:02,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:04:02,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 19:04:02,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 19:04:02,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:02,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:02,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:04:02,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:04:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-03 19:04:02,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:04:02,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568105471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:04:02,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:04:02,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:04:02,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390921549] [2025-03-03 19:04:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:04:02,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:04:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:04:02,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:04:02,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:04:02,666 INFO L87 Difference]: Start difference. First operand has 75 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 19:04:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:02,681 INFO L93 Difference]: Finished difference Result 144 states and 253 transitions. [2025-03-03 19:04:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:04:02,682 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, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 173 [2025-03-03 19:04:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:02,686 INFO L225 Difference]: With dead ends: 144 [2025-03-03 19:04:02,686 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 19:04:02,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:04:02,689 INFO L435 NwaCegarLoop]: 109 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, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:02,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:04:02,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 19:04:02,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-03 19:04:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:04:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2025-03-03 19:04:02,724 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 173 [2025-03-03 19:04:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:02,724 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2025-03-03 19:04:02,724 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, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 19:04:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2025-03-03 19:04:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 19:04:02,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:02,731 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:02,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:04:02,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:04:02,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:02,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:02,933 INFO L85 PathProgramCache]: Analyzing trace with hash 287384684, now seen corresponding path program 1 times [2025-03-03 19:04:02,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:04:02,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975999143] [2025-03-03 19:04:02,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:02,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:04:02,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 19:04:03,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 19:04:03,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:03,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:04:08,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:04:08,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975999143] [2025-03-03 19:04:08,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975999143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:04:08,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:04:08,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 19:04:08,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907128411] [2025-03-03 19:04:08,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:04:08,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 19:04:08,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:04:08,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 19:04:08,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-03 19:04:08,805 INFO L87 Difference]: Start difference. First operand 72 states and 109 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:04:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:09,421 INFO L93 Difference]: Finished difference Result 148 states and 204 transitions. [2025-03-03 19:04:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:04:09,422 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2025-03-03 19:04:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:09,424 INFO L225 Difference]: With dead ends: 148 [2025-03-03 19:04:09,424 INFO L226 Difference]: Without dead ends: 146 [2025-03-03 19:04:09,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:04:09,425 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 234 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:09,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 497 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:04:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-03 19:04:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 106. [2025-03-03 19:04:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 73 states have internal predecessors, (94), 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-03-03 19:04:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2025-03-03 19:04:09,437 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 173 [2025-03-03 19:04:09,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:09,439 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2025-03-03 19:04:09,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:04:09,439 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2025-03-03 19:04:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 19:04:09,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:09,440 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:09,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:04:09,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:09,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:09,441 INFO L85 PathProgramCache]: Analyzing trace with hash 316013835, now seen corresponding path program 1 times [2025-03-03 19:04:09,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:04:09,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048104310] [2025-03-03 19:04:09,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:09,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:04:09,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 19:04:09,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 19:04:09,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:09,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:04:12,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:04:12,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048104310] [2025-03-03 19:04:12,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048104310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:04:12,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:04:12,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 19:04:12,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103036002] [2025-03-03 19:04:12,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:04:12,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 19:04:12,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:04:12,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 19:04:12,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-03 19:04:12,368 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:04:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:13,057 INFO L93 Difference]: Finished difference Result 167 states and 229 transitions. [2025-03-03 19:04:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:04:13,058 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2025-03-03 19:04:13,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:13,060 INFO L225 Difference]: With dead ends: 167 [2025-03-03 19:04:13,061 INFO L226 Difference]: Without dead ends: 165 [2025-03-03 19:04:13,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:04:13,063 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 175 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:13,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 680 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:04:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-03 19:04:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 106. [2025-03-03 19:04:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 73 states have internal predecessors, (94), 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-03-03 19:04:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2025-03-03 19:04:13,081 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 173 [2025-03-03 19:04:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:13,082 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2025-03-03 19:04:13,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:04:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2025-03-03 19:04:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 19:04:13,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:13,084 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:13,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:04:13,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:13,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2030195019, now seen corresponding path program 1 times [2025-03-03 19:04:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:04:13,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498342460] [2025-03-03 19:04:13,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:04:13,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 19:04:13,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 19:04:13,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:13,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:04:16,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:04:16,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498342460] [2025-03-03 19:04:16,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498342460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:04:16,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:04:16,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 19:04:16,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600933500] [2025-03-03 19:04:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:04:16,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 19:04:16,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:04:16,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 19:04:16,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-03 19:04:16,771 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:04:17,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:17,211 INFO L93 Difference]: Finished difference Result 151 states and 207 transitions. [2025-03-03 19:04:17,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:04:17,211 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2025-03-03 19:04:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:17,214 INFO L225 Difference]: With dead ends: 151 [2025-03-03 19:04:17,214 INFO L226 Difference]: Without dead ends: 149 [2025-03-03 19:04:17,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:04:17,215 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 160 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:17,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 640 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:04:17,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-03 19:04:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 108. [2025-03-03 19:04:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 75 states have internal predecessors, (97), 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-03-03 19:04:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2025-03-03 19:04:17,230 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 173 [2025-03-03 19:04:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:17,231 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2025-03-03 19:04:17,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:04:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2025-03-03 19:04:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 19:04:17,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:17,233 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:17,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:04:17,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:17,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2058824170, now seen corresponding path program 1 times [2025-03-03 19:04:17,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:04:17,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410410722] [2025-03-03 19:04:17,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:17,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:04:17,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 19:04:17,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 19:04:17,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:17,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:04:19,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:04:19,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410410722] [2025-03-03 19:04:19,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410410722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:04:19,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:04:19,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 19:04:19,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221220686] [2025-03-03 19:04:19,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:04:19,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 19:04:19,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:04:19,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 19:04:19,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-03 19:04:19,066 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:04:19,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:19,473 INFO L93 Difference]: Finished difference Result 170 states and 232 transitions. [2025-03-03 19:04:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:04:19,474 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2025-03-03 19:04:19,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:19,475 INFO L225 Difference]: With dead ends: 170 [2025-03-03 19:04:19,475 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 19:04:19,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:04:19,475 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 147 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:19,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 789 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:04:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 19:04:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 106. [2025-03-03 19:04:19,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 73 states have internal predecessors, (94), 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-03-03 19:04:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2025-03-03 19:04:19,492 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 173 [2025-03-03 19:04:19,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:19,492 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2025-03-03 19:04:19,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:04:19,493 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2025-03-03 19:04:19,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 19:04:19,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:19,494 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:19,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:04:19,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:19,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:19,494 INFO L85 PathProgramCache]: Analyzing trace with hash 416467403, now seen corresponding path program 1 times [2025-03-03 19:04:19,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:04:19,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146146097] [2025-03-03 19:04:19,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:19,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:04:19,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 19:04:19,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 19:04:19,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:19,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:04:21,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:04:21,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146146097] [2025-03-03 19:04:21,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146146097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:04:21,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:04:21,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 19:04:21,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604768857] [2025-03-03 19:04:21,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:04:21,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 19:04:21,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:04:21,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 19:04:21,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:04:21,267 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:04:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:22,689 INFO L93 Difference]: Finished difference Result 228 states and 324 transitions. [2025-03-03 19:04:22,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 19:04:22,689 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2025-03-03 19:04:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:22,692 INFO L225 Difference]: With dead ends: 228 [2025-03-03 19:04:22,692 INFO L226 Difference]: Without dead ends: 226 [2025-03-03 19:04:22,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2025-03-03 19:04:22,692 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 329 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:22,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 714 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:04:22,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-03 19:04:22,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 185. [2025-03-03 19:04:22,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 122 states have internal predecessors, (157), 58 states have call successors, (58), 5 states have call predecessors, (58), 5 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 19:04:22,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 273 transitions. [2025-03-03 19:04:22,712 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 273 transitions. Word has length 173 [2025-03-03 19:04:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:22,712 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 273 transitions. [2025-03-03 19:04:22,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:04:22,713 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 273 transitions. [2025-03-03 19:04:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 19:04:22,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:22,714 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:22,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:04:22,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:22,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash 445096554, now seen corresponding path program 1 times [2025-03-03 19:04:22,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:04:22,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251042846] [2025-03-03 19:04:22,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:22,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:04:22,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 19:04:22,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 19:04:22,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:22,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:04:28,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:04:28,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251042846] [2025-03-03 19:04:28,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251042846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:04:28,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:04:28,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 19:04:28,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646238692] [2025-03-03 19:04:28,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:04:28,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 19:04:28,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:04:28,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 19:04:28,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:04:28,346 INFO L87 Difference]: Start difference. First operand 185 states and 273 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:04:31,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:31,873 INFO L93 Difference]: Finished difference Result 267 states and 373 transitions. [2025-03-03 19:04:31,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 19:04:31,874 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2025-03-03 19:04:31,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:31,875 INFO L225 Difference]: With dead ends: 267 [2025-03-03 19:04:31,875 INFO L226 Difference]: Without dead ends: 265 [2025-03-03 19:04:31,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=342, Invalid=1140, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 19:04:31,876 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 339 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:31,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 776 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:04:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-03 19:04:31,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 206. [2025-03-03 19:04:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 136 states have (on average 1.2941176470588236) internal successors, (176), 137 states have internal predecessors, (176), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-03 19:04:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 302 transitions. [2025-03-03 19:04:31,901 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 302 transitions. Word has length 173 [2025-03-03 19:04:31,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:31,902 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 302 transitions. [2025-03-03 19:04:31,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:04:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 302 transitions. [2025-03-03 19:04:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 19:04:31,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:31,903 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:31,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:04:31,903 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:31,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:31,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2135689558, now seen corresponding path program 1 times [2025-03-03 19:04:31,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:04:31,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773631588] [2025-03-03 19:04:31,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:31,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:04:31,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 19:04:31,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 19:04:31,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:31,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-03 19:04:33,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:04:33,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773631588] [2025-03-03 19:04:33,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773631588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:04:33,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:04:33,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 19:04:33,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920328368] [2025-03-03 19:04:33,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:04:33,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 19:04:33,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:04:33,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 19:04:33,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:04:33,413 INFO L87 Difference]: Start difference. First operand 206 states and 302 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:04:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:34,743 INFO L93 Difference]: Finished difference Result 300 states and 413 transitions. [2025-03-03 19:04:34,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 19:04:34,745 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2025-03-03 19:04:34,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:34,746 INFO L225 Difference]: With dead ends: 300 [2025-03-03 19:04:34,746 INFO L226 Difference]: Without dead ends: 298 [2025-03-03 19:04:34,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2025-03-03 19:04:34,747 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 247 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:34,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 847 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:04:34,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-03 19:04:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 206. [2025-03-03 19:04:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 136 states have (on average 1.2941176470588236) internal successors, (176), 137 states have internal predecessors, (176), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-03 19:04:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 302 transitions. [2025-03-03 19:04:34,768 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 302 transitions. Word has length 173 [2025-03-03 19:04:34,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:34,768 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 302 transitions. [2025-03-03 19:04:34,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-03 19:04:34,769 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 302 transitions. [2025-03-03 19:04:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 19:04:34,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:34,770 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:34,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:04:34,770 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:34,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:34,770 INFO L85 PathProgramCache]: Analyzing trace with hash 293193565, now seen corresponding path program 1 times [2025-03-03 19:04:34,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:04:34,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418192500] [2025-03-03 19:04:34,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:34,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:04:34,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 19:04:34,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 19:04:34,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:34,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 19:04:34,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:04:34,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418192500] [2025-03-03 19:04:34,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418192500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:04:34,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750612463] [2025-03-03 19:04:34,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:34,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:04:34,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:04:34,870 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:04:34,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:04:34,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 19:04:34,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 19:04:34,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:34,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:34,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:04:34,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:04:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2025-03-03 19:04:35,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:04:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-03 19:04:35,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750612463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:04:35,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:04:35,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 19:04:35,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103126329] [2025-03-03 19:04:35,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:04:35,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 19:04:35,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:04:35,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 19:04:35,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:04:35,154 INFO L87 Difference]: Start difference. First operand 206 states and 302 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-03-03 19:04:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:35,316 INFO L93 Difference]: Finished difference Result 418 states and 608 transitions. [2025-03-03 19:04:35,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 19:04:35,317 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 174 [2025-03-03 19:04:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:35,319 INFO L225 Difference]: With dead ends: 418 [2025-03-03 19:04:35,319 INFO L226 Difference]: Without dead ends: 215 [2025-03-03 19:04:35,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:04:35,321 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 94 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:35,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 166 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:04:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-03 19:04:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 113. [2025-03-03 19:04:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 73 states have internal predecessors, (87), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-03 19:04:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2025-03-03 19:04:35,347 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 174 [2025-03-03 19:04:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:35,348 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2025-03-03 19:04:35,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2025-03-03 19:04:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2025-03-03 19:04:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 19:04:35,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:35,350 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:35,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:04:35,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 19:04:35,550 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:35,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash 528680136, now seen corresponding path program 1 times [2025-03-03 19:04:35,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:04:35,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746948228] [2025-03-03 19:04:35,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:35,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:04:35,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:04:35,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:04:35,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:35,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:04:35,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106399908] [2025-03-03 19:04:35,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:35,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:04:35,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:04:35,586 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:04:35,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:04:35,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:04:35,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:04:35,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:35,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:04:35,898 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:04:35,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 19:04:35,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 19:04:35,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:35,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:04:36,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:04:36,015 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:04:36,016 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:04:36,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:04:36,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:04:36,220 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:36,291 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:04:36,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:04:36 BoogieIcfgContainer [2025-03-03 19:04:36,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:04:36,294 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:04:36,294 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:04:36,294 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:04:36,295 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:04:02" (3/4) ... [2025-03-03 19:04:36,296 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:04:36,296 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:04:36,297 INFO L158 Benchmark]: Toolchain (without parser) took 34888.54ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 104.1MB in the beginning and 626.8MB in the end (delta: -522.7MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2025-03-03 19:04:36,297 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:04:36,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.35ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 89.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:04:36,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.33ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 85.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:04:36,297 INFO L158 Benchmark]: Boogie Preprocessor took 32.89ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 81.0MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:04:36,298 INFO L158 Benchmark]: IcfgBuilder took 360.28ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 56.8MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:04:36,298 INFO L158 Benchmark]: TraceAbstraction took 34215.69ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 56.8MB in the beginning and 627.1MB in the end (delta: -570.3MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2025-03-03 19:04:36,298 INFO L158 Benchmark]: Witness Printer took 2.44ms. Allocated memory is still 729.8MB. Free memory was 627.1MB in the beginning and 626.8MB in the end (delta: 235.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:04:36,299 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.90ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.35ms. Allocated memory is still 142.6MB. Free memory was 104.1MB in the beginning and 89.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.33ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 85.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.89ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 81.0MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 360.28ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 56.8MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 34215.69ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 56.8MB in the beginning and 627.1MB in the end (delta: -570.3MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Witness Printer took 2.44ms. Allocated memory is still 729.8MB. Free memory was 627.1MB in the beginning and 626.8MB in the end (delta: 235.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryFLOATComparisonOperation at line 140. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 16; [L25] unsigned char var_1_4 = 4; [L26] unsigned char var_1_5 = 200; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_9 = 0; [L31] signed short int var_1_10 = 128; [L32] signed short int var_1_11 = 5; [L33] signed char var_1_12 = -2; [L34] signed char var_1_13 = -32; [L35] signed char var_1_14 = 2; [L36] signed char var_1_15 = 25; [L37] signed char var_1_16 = 1; [L38] signed char var_1_17 = 0; [L39] signed long int var_1_18 = -16; [L40] float var_1_19 = 2.775; [L41] unsigned long int var_1_20 = 2381110720; [L42] float var_1_21 = 10000000000000.5; VAL [isInitial=0, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_2=25, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L144] isInitial = 1 [L145] FCALL initially() [L146] COND TRUE 1 [L147] FCALL updateLastVariables() [L148] CALL updateVariables() [L94] var_1_2 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L97] var_1_3 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L101] var_1_4 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L103] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L104] var_1_5 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L106] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L107] var_1_6 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_7=0, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_7=0, var_1_8=0, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L110] var_1_7 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_8=0, var_1_9=0] [L111] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_8=0, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L112] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L113] var_1_8 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_9=0] [L114] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_9=0] [L115] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L115] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L116] var_1_9 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1] [L117] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1] [L118] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L118] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L119] var_1_13 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L120] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L121] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L121] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L122] var_1_14 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_14 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L123] RET assume_abort_if_not(var_1_14 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L124] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L124] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L125] var_1_16 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L126] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L127] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L127] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L128] var_1_17 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L129] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L130] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L130] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L131] var_1_20 = __VERIFIER_nondet_ulong() [L132] CALL assume_abort_if_not(var_1_20 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=6442450943, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=6442450943, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L132] RET assume_abort_if_not(var_1_20 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=6442450943, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L133] CALL assume_abort_if_not(var_1_20 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=6442450943, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=6442450943, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L133] RET assume_abort_if_not(var_1_20 <= 4294967295) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=6442450943, var_1_21=20000000000001/2, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L134] var_1_21 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=6442450943, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=6442450943, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L135] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=6442450943, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L148] RET updateVariables() [L149] CALL step() [L46] COND FALSE !((var_1_2 / var_1_3) <= 2) [L57] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=6442450943, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L59] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=85, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=6442450943, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L60] COND TRUE stepLocal_0 <= var_1_2 [L61] var_1_10 = ((((var_1_5) < (var_1_3)) ? (var_1_5) : (var_1_3))) VAL [isInitial=1, var_1_10=0, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=6442450943, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L63] signed long int stepLocal_1 = ((((var_1_2) < (var_1_10)) ? (var_1_2) : (var_1_10))) + var_1_5; VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=6442450943, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L64] COND TRUE var_1_1 >= stepLocal_1 [L65] var_1_11 = ((var_1_5 + var_1_2) + var_1_3) VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=6442450943, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L71] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=6442450943, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L72] COND TRUE \read(var_1_7) [L73] var_1_15 = (((((32) < ((16 + var_1_16))) ? (32) : ((16 + var_1_16)))) - var_1_17) VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=6442450943, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L75] signed char stepLocal_2 = var_1_16; VAL [isInitial=1, stepLocal_2=32, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=6442450943, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L76] COND TRUE stepLocal_2 <= ((((var_1_13) > (var_1_3)) ? (var_1_13) : (var_1_3))) [L77] var_1_18 = (((((64 - var_1_16)) > (var_1_17)) ? ((64 - var_1_16)) : (var_1_17))) VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=-256, var_1_20=6442450943, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L81] COND TRUE 100000000u < (((((4160981528u) < (var_1_20)) ? (4160981528u) : (var_1_20))) - var_1_1) VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=-256, var_1_20=6442450943, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L82] COND TRUE var_1_20 > 1u VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=-256, var_1_20=6442450943, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L83] COND TRUE \read(var_1_9) [L84] var_1_19 = var_1_21 VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=-256, var_1_20=6442450943, var_1_21=2, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L149] RET step() [L150] CALL, EXPR property() [L140-L141] return ((((((((var_1_2 / var_1_3) <= 2) ? ((var_1_3 < (((((~ var_1_2)) < (var_1_4)) ? ((~ var_1_2)) : (var_1_4)))) ? (var_1_1 == ((unsigned char) ((((var_1_5) < (16)) ? (var_1_5) : (16))))) : ((((var_1_6 || var_1_7) && var_1_8) || var_1_9) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_5)))) : (var_1_1 == ((unsigned char) var_1_5))) && ((var_1_3 <= var_1_2) ? (var_1_10 == ((signed short int) ((((var_1_5) < (var_1_3)) ? (var_1_5) : (var_1_3))))) : 1)) && ((var_1_1 >= (((((var_1_2) < (var_1_10)) ? (var_1_2) : (var_1_10))) + var_1_5)) ? (var_1_11 == ((signed short int) ((var_1_5 + var_1_2) + var_1_3))) : (var_1_8 ? (var_1_11 == ((signed short int) var_1_3)) : 1))) && (var_1_12 == ((signed char) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) && (var_1_7 ? (var_1_15 == ((signed char) (((((32) < ((16 + var_1_16))) ? (32) : ((16 + var_1_16)))) - var_1_17))) : 1)) && ((var_1_16 <= ((((var_1_13) > (var_1_3)) ? (var_1_13) : (var_1_3)))) ? (var_1_18 == ((signed long int) (((((64 - var_1_16)) > (var_1_17)) ? ((64 - var_1_16)) : (var_1_17))))) : (var_1_18 == ((signed long int) 4)))) && ((100000000u < (((((4160981528u) < (var_1_20)) ? (4160981528u) : (var_1_20))) - var_1_1)) ? ((var_1_20 > 1u) ? (var_1_9 ? (var_1_19 == ((float) var_1_21)) : (var_1_19 == ((float) var_1_21))) : (var_1_19 == ((float) var_1_21))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=-256, var_1_20=6442450943, var_1_21=2, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L150] RET, EXPR property() [L150] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=-256, var_1_20=6442450943, var_1_21=2, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=340, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=-256, var_1_20=6442450943, var_1_21=2, var_1_2=255, var_1_3=85, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.1s, OverallIterations: 10, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1750 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1725 mSDsluCounter, 5218 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4153 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2665 IncrementalHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 1065 mSDtfsCounter, 2665 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 699 GetRequests, 548 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=7, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 496 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 2255 NumberOfCodeBlocks, 2255 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2067 ConstructedInterpolants, 0 QuantifiedInterpolants, 12184 SizeOfPredicates, 0 NumberOfNonLiveVariables, 757 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 18072/18144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 19:04:36,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cfa1db2b7b11c8a5c678532d9720edadc9dcf8095da3555b92876b462fef0528 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:04:38,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:04:38,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:04:38,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:04:38,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:04:38,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:04:38,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:04:38,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:04:38,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:04:38,167 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:04:38,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:04:38,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:04:38,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:04:38,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:04:38,168 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:04:38,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:04:38,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:04:38,169 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:04:38,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:04:38,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:04:38,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:04:38,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:04:38,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:04:38,170 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:04:38,170 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:04:38,170 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:04:38,170 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:04:38,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:04:38,170 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:04:38,170 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:04:38,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:04:38,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:04:38,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:04:38,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:04:38,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:04:38,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:04:38,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:04:38,171 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:04:38,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:04:38,171 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:04:38,171 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:04:38,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:04:38,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:04:38,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:04:38,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:04:38,171 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cfa1db2b7b11c8a5c678532d9720edadc9dcf8095da3555b92876b462fef0528 [2025-03-03 19:04:38,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:04:38,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:04:38,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:04:38,401 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:04:38,402 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:04:38,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i [2025-03-03 19:04:39,559 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7510a4e12/68b062075f104b00b6c4756e90d596b0/FLAGe26ca745e [2025-03-03 19:04:39,712 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:04:39,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i [2025-03-03 19:04:39,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7510a4e12/68b062075f104b00b6c4756e90d596b0/FLAGe26ca745e [2025-03-03 19:04:39,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7510a4e12/68b062075f104b00b6c4756e90d596b0 [2025-03-03 19:04:39,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:04:39,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:04:39,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:04:39,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:04:39,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:04:39,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:04:39" (1/1) ... [2025-03-03 19:04:39,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39a0cd62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39, skipping insertion in model container [2025-03-03 19:04:39,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:04:39" (1/1) ... [2025-03-03 19:04:39,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:04:39,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i[917,930] [2025-03-03 19:04:39,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:04:39,889 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:04:39,896 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i[917,930] [2025-03-03 19:04:39,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:04:39,930 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:04:39,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39 WrapperNode [2025-03-03 19:04:39,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:04:39,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:04:39,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:04:39,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:04:39,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39" (1/1) ... [2025-03-03 19:04:39,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39" (1/1) ... [2025-03-03 19:04:39,957 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2025-03-03 19:04:39,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:04:39,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:04:39,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:04:39,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:04:39,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39" (1/1) ... [2025-03-03 19:04:39,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39" (1/1) ... [2025-03-03 19:04:39,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39" (1/1) ... [2025-03-03 19:04:39,984 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:04:39,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39" (1/1) ... [2025-03-03 19:04:39,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39" (1/1) ... [2025-03-03 19:04:39,998 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39" (1/1) ... [2025-03-03 19:04:39,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39" (1/1) ... [2025-03-03 19:04:40,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39" (1/1) ... [2025-03-03 19:04:40,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39" (1/1) ... [2025-03-03 19:04:40,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:04:40,011 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:04:40,011 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:04:40,011 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:04:40,011 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39" (1/1) ... [2025-03-03 19:04:40,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:04:40,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:04:40,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:04:40,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:04:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:04:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:04:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:04:40,067 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:04:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:04:40,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:04:40,139 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:04:40,141 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:04:40,443 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:04:40,443 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:04:40,451 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:04:40,451 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:04:40,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:04:40 BoogieIcfgContainer [2025-03-03 19:04:40,451 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:04:40,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:04:40,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:04:40,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:04:40,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:04:39" (1/3) ... [2025-03-03 19:04:40,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6507f6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:04:40, skipping insertion in model container [2025-03-03 19:04:40,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:04:39" (2/3) ... [2025-03-03 19:04:40,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6507f6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:04:40, skipping insertion in model container [2025-03-03 19:04:40,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:04:40" (3/3) ... [2025-03-03 19:04:40,476 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-58.i [2025-03-03 19:04:40,485 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:04:40,486 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-58.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:04:40,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:04:40,533 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;@433a48dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:04:40,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:04:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:04:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 19:04:40,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:40,543 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:40,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:40,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:40,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1168699156, now seen corresponding path program 1 times [2025-03-03 19:04:40,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:04:40,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729784300] [2025-03-03 19:04:40,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:40,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:04:40,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:04:40,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:04:40,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 19:04:40,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 19:04:40,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 19:04:40,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:40,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:40,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:04:40,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:04:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2025-03-03 19:04:40,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:04:40,782 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:04:40,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729784300] [2025-03-03 19:04:40,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729784300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:04:40,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:04:40,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:04:40,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302162532] [2025-03-03 19:04:40,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:04:40,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:04:40,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:04:40,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:04:40,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:04:40,802 INFO L87 Difference]: Start difference. First operand has 75 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 19:04:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:04:40,827 INFO L93 Difference]: Finished difference Result 144 states and 253 transitions. [2025-03-03 19:04:40,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:04:40,829 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 173 [2025-03-03 19:04:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:04:40,835 INFO L225 Difference]: With dead ends: 144 [2025-03-03 19:04:40,835 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 19:04:40,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:04:40,841 INFO L435 NwaCegarLoop]: 109 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, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:04:40,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:04:40,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 19:04:40,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-03 19:04:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 19:04:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2025-03-03 19:04:40,881 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 173 [2025-03-03 19:04:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:04:40,882 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2025-03-03 19:04:40,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 19:04:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2025-03-03 19:04:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 19:04:40,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:04:40,886 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:04:40,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:04:41,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:04:41,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:04:41,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:04:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash 287384684, now seen corresponding path program 1 times [2025-03-03 19:04:41,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:04:41,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662789694] [2025-03-03 19:04:41,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:41,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:04:41,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:04:41,092 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:04:41,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 19:04:41,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 19:04:41,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 19:04:41,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:41,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:41,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 19:04:41,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:04:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2025-03-03 19:04:41,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:04:41,508 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:04:41,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662789694] [2025-03-03 19:04:41,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662789694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:04:41,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [425849236] [2025-03-03 19:04:41,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:04:41,509 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 19:04:41,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 19:04:41,534 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 19:04:41,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-03 19:04:41,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 19:04:42,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 19:04:42,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:04:42,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:04:42,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 19:04:42,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:04:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2025-03-03 19:04:44,101 INFO L312 TraceCheckSpWp]: Computing backward predicates...