./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-59.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 bd989104ff103e9b5ed152f8842800410e6bde451d7ac2b024a1b80da691bd1b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:48:01,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:48:01,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:48:02,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:48:02,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:48:02,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:48:02,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:48:02,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:48:02,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:48:02,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:48:02,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:48:02,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:48:02,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:48:02,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:48:02,027 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:48:02,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:48:02,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:48:02,027 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:48:02,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:48:02,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:48:02,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:48:02,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:48:02,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:48:02,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:48:02,028 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:48:02,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:48:02,028 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:48:02,028 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:48:02,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:48:02,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:48:02,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:48:02,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:48:02,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:48:02,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:48:02,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:48:02,029 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:48:02,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:48:02,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:48:02,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:48:02,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:48:02,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:48:02,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:48:02,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:48:02,030 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 -> bd989104ff103e9b5ed152f8842800410e6bde451d7ac2b024a1b80da691bd1b [2025-03-17 01:48:02,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:48:02,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:48:02,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:48:02,257 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:48:02,257 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:48:02,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i [2025-03-17 01:48:03,445 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b0de19aa/fa0a09c8fda94d5fa76137867156f4a4/FLAGe727441e2 [2025-03-17 01:48:03,723 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:48:03,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i [2025-03-17 01:48:03,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b0de19aa/fa0a09c8fda94d5fa76137867156f4a4/FLAGe727441e2 [2025-03-17 01:48:03,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b0de19aa/fa0a09c8fda94d5fa76137867156f4a4 [2025-03-17 01:48:03,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:48:03,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:48:03,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:48:03,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:48:03,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:48:03,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:48:03" (1/1) ... [2025-03-17 01:48:03,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4017ef47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:03, skipping insertion in model container [2025-03-17 01:48:03,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:48:03" (1/1) ... [2025-03-17 01:48:03,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:48:03,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i[919,932] [2025-03-17 01:48:03,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:48:03,972 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:48:03,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i[919,932] [2025-03-17 01:48:04,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:48:04,061 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:48:04,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:04 WrapperNode [2025-03-17 01:48:04,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:48:04,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:48:04,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:48:04,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:48:04,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:04" (1/1) ... [2025-03-17 01:48:04,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:04" (1/1) ... [2025-03-17 01:48:04,122 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2025-03-17 01:48:04,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:48:04,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:48:04,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:48:04,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:48:04,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:04" (1/1) ... [2025-03-17 01:48:04,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:04" (1/1) ... [2025-03-17 01:48:04,137 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:04" (1/1) ... [2025-03-17 01:48:04,156 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-17 01:48:04,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:04" (1/1) ... [2025-03-17 01:48:04,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:04" (1/1) ... [2025-03-17 01:48:04,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:04" (1/1) ... [2025-03-17 01:48:04,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:04" (1/1) ... [2025-03-17 01:48:04,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:04" (1/1) ... [2025-03-17 01:48:04,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:04" (1/1) ... [2025-03-17 01:48:04,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:48:04,187 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:48:04,188 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:48:04,188 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:48:04,189 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:04" (1/1) ... [2025-03-17 01:48:04,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:48:04,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:48:04,217 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-17 01:48:04,221 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-17 01:48:04,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:48:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:48:04,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:48:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:48:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:48:04,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:48:04,319 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:48:04,321 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:48:04,821 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-17 01:48:04,822 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:48:04,842 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:48:04,845 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:48:04,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:48:04 BoogieIcfgContainer [2025-03-17 01:48:04,845 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:48:04,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:48:04,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:48:04,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:48:04,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:48:03" (1/3) ... [2025-03-17 01:48:04,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148c376d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:48:04, skipping insertion in model container [2025-03-17 01:48:04,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:48:04" (2/3) ... [2025-03-17 01:48:04,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148c376d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:48:04, skipping insertion in model container [2025-03-17 01:48:04,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:48:04" (3/3) ... [2025-03-17 01:48:04,854 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i [2025-03-17 01:48:04,867 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:48:04,868 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-59.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:48:04,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:48:04,929 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;@609c6491, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:48:04,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:48:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 58 states have internal predecessors, (87), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 01:48:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 01:48:04,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:04,949 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:48:04,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:04,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:04,954 INFO L85 PathProgramCache]: Analyzing trace with hash -296332301, now seen corresponding path program 1 times [2025-03-17 01:48:04,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:04,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745315895] [2025-03-17 01:48:04,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:04,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:05,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 01:48:05,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 01:48:05,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:05,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-17 01:48:05,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:05,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745315895] [2025-03-17 01:48:05,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745315895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:48:05,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026258497] [2025-03-17 01:48:05,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:05,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:48:05,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:48:05,264 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-17 01:48:05,265 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-17 01:48:05,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 01:48:05,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 01:48:05,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:05,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:05,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:48:05,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:48:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-17 01:48:05,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:48:05,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026258497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:05,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:48:05,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:48:05,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016595523] [2025-03-17 01:48:05,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:05,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:48:05,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:05,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:48:05,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:48:05,515 INFO L87 Difference]: Start difference. First operand has 87 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 58 states have internal predecessors, (87), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 01:48:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:05,544 INFO L93 Difference]: Finished difference Result 171 states and 307 transitions. [2025-03-17 01:48:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:48:05,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 172 [2025-03-17 01:48:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:05,551 INFO L225 Difference]: With dead ends: 171 [2025-03-17 01:48:05,551 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 01:48:05,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 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-17 01:48:05,556 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:05,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:48:05,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 01:48:05,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 01:48:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 01:48:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2025-03-17 01:48:05,586 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 172 [2025-03-17 01:48:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:05,586 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2025-03-17 01:48:05,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 01:48:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2025-03-17 01:48:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 01:48:05,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:05,590 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:48:05,602 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-17 01:48:05,791 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-17 01:48:05,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:05,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:05,793 INFO L85 PathProgramCache]: Analyzing trace with hash 626614638, now seen corresponding path program 1 times [2025-03-17 01:48:05,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:05,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076445201] [2025-03-17 01:48:05,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:05,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:05,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 01:48:05,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 01:48:05,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:05,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:48:06,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:06,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076445201] [2025-03-17 01:48:06,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076445201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:06,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:48:06,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:48:06,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194571165] [2025-03-17 01:48:06,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:06,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:48:06,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:06,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:48:06,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:48:06,187 INFO L87 Difference]: Start difference. First operand 85 states and 134 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:48:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:06,247 INFO L93 Difference]: Finished difference Result 169 states and 267 transitions. [2025-03-17 01:48:06,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:48:06,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-17 01:48:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:06,251 INFO L225 Difference]: With dead ends: 169 [2025-03-17 01:48:06,252 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 01:48:06,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:48:06,253 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:06,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:48:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 01:48:06,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 01:48:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 01:48:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 133 transitions. [2025-03-17 01:48:06,268 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 133 transitions. Word has length 172 [2025-03-17 01:48:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:06,271 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 133 transitions. [2025-03-17 01:48:06,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:48:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 133 transitions. [2025-03-17 01:48:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 01:48:06,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:06,275 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:48:06,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:48:06,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:06,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:06,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1925542323, now seen corresponding path program 1 times [2025-03-17 01:48:06,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:06,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835240764] [2025-03-17 01:48:06,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:06,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:06,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 01:48:06,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 01:48:06,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:06,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:48:06,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:06,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835240764] [2025-03-17 01:48:06,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835240764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:06,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:48:06,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:48:06,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585151579] [2025-03-17 01:48:06,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:06,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:48:06,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:06,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:48:06,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:48:06,620 INFO L87 Difference]: Start difference. First operand 85 states and 133 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:48:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:06,788 INFO L93 Difference]: Finished difference Result 254 states and 398 transitions. [2025-03-17 01:48:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:48:06,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-17 01:48:06,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:06,791 INFO L225 Difference]: With dead ends: 254 [2025-03-17 01:48:06,791 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 01:48:06,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:48:06,792 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 104 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:06,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 378 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:48:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 01:48:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 145. [2025-03-17 01:48:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 01:48:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 229 transitions. [2025-03-17 01:48:06,822 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 229 transitions. Word has length 172 [2025-03-17 01:48:06,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:06,823 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 229 transitions. [2025-03-17 01:48:06,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:48:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 229 transitions. [2025-03-17 01:48:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 01:48:06,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:06,827 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:48:06,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:48:06,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:06,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:06,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1458921856, now seen corresponding path program 1 times [2025-03-17 01:48:06,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:06,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182346039] [2025-03-17 01:48:06,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:06,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:06,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 01:48:06,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 01:48:06,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:06,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:48:07,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:07,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182346039] [2025-03-17 01:48:07,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182346039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:07,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:48:07,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:48:07,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716280968] [2025-03-17 01:48:07,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:07,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:48:07,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:07,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:48:07,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:48:07,182 INFO L87 Difference]: Start difference. First operand 145 states and 229 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:48:07,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:07,355 INFO L93 Difference]: Finished difference Result 319 states and 501 transitions. [2025-03-17 01:48:07,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:48:07,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2025-03-17 01:48:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:07,359 INFO L225 Difference]: With dead ends: 319 [2025-03-17 01:48:07,359 INFO L226 Difference]: Without dead ends: 235 [2025-03-17 01:48:07,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:48:07,363 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 113 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:07,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 372 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:48:07,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-17 01:48:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 224. [2025-03-17 01:48:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 01:48:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 354 transitions. [2025-03-17 01:48:07,401 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 354 transitions. Word has length 173 [2025-03-17 01:48:07,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:07,402 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 354 transitions. [2025-03-17 01:48:07,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:48:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 354 transitions. [2025-03-17 01:48:07,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-17 01:48:07,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:07,405 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:48:07,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:48:07,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:07,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:07,406 INFO L85 PathProgramCache]: Analyzing trace with hash 444803140, now seen corresponding path program 1 times [2025-03-17 01:48:07,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:07,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178144006] [2025-03-17 01:48:07,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:07,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:07,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 01:48:07,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 01:48:07,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:07,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:48:07,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:07,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178144006] [2025-03-17 01:48:07,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178144006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:07,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:48:07,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:48:07,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128098137] [2025-03-17 01:48:07,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:07,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:48:07,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:07,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:48:07,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:48:07,853 INFO L87 Difference]: Start difference. First operand 224 states and 354 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 01:48:07,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:07,971 INFO L93 Difference]: Finished difference Result 403 states and 638 transitions. [2025-03-17 01:48:07,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:48:07,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2025-03-17 01:48:07,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:07,973 INFO L225 Difference]: With dead ends: 403 [2025-03-17 01:48:07,973 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 01:48:07,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:48:07,974 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 133 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:07,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 217 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:48:07,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 01:48:07,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 224. [2025-03-17 01:48:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 139 states have (on average 1.3741007194244603) internal successors, (191), 139 states have internal predecessors, (191), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 01:48:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 353 transitions. [2025-03-17 01:48:08,000 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 353 transitions. Word has length 174 [2025-03-17 01:48:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:08,001 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 353 transitions. [2025-03-17 01:48:08,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-17 01:48:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 353 transitions. [2025-03-17 01:48:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 01:48:08,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:08,002 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:48:08,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:48:08,002 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:08,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:08,003 INFO L85 PathProgramCache]: Analyzing trace with hash 106678806, now seen corresponding path program 1 times [2025-03-17 01:48:08,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:08,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459786775] [2025-03-17 01:48:08,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:08,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:08,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 01:48:08,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 01:48:08,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:08,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:48:08,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:08,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459786775] [2025-03-17 01:48:08,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459786775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:08,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:48:08,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:48:08,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731426516] [2025-03-17 01:48:08,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:08,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:48:08,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:08,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:48:08,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:48:08,155 INFO L87 Difference]: Start difference. First operand 224 states and 353 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:48:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:08,203 INFO L93 Difference]: Finished difference Result 403 states and 637 transitions. [2025-03-17 01:48:08,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:48:08,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-17 01:48:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:08,206 INFO L225 Difference]: With dead ends: 403 [2025-03-17 01:48:08,208 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 01:48:08,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:48:08,209 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 57 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:08,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 246 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:48:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 01:48:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 224. [2025-03-17 01:48:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 139 states have (on average 1.3669064748201438) internal successors, (190), 139 states have internal predecessors, (190), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 01:48:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 352 transitions. [2025-03-17 01:48:08,242 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 352 transitions. Word has length 175 [2025-03-17 01:48:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:08,242 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 352 transitions. [2025-03-17 01:48:08,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:48:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 352 transitions. [2025-03-17 01:48:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 01:48:08,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:08,244 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:48:08,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:48:08,244 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:08,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:08,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1569264176, now seen corresponding path program 1 times [2025-03-17 01:48:08,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:08,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864393735] [2025-03-17 01:48:08,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:08,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 01:48:08,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 01:48:08,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:08,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:48:08,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1951722267] [2025-03-17 01:48:08,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:08,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:48:08,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:48:08,389 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-17 01:48:08,391 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-17 01:48:08,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 01:48:08,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 01:48:08,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:08,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:08,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 01:48:08,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:48:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-17 01:48:09,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:48:09,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:48:09,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864393735] [2025-03-17 01:48:09,025 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 01:48:09,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951722267] [2025-03-17 01:48:09,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951722267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:48:09,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:48:09,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:48:09,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65753968] [2025-03-17 01:48:09,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:48:09,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 01:48:09,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:48:09,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 01:48:09,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 01:48:09,026 INFO L87 Difference]: Start difference. First operand 224 states and 352 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:48:09,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:48:09,365 INFO L93 Difference]: Finished difference Result 420 states and 660 transitions. [2025-03-17 01:48:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 01:48:09,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-17 01:48:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:48:09,368 INFO L225 Difference]: With dead ends: 420 [2025-03-17 01:48:09,369 INFO L226 Difference]: Without dead ends: 257 [2025-03-17 01:48:09,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:48:09,370 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 137 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:48:09,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 477 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:48:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-17 01:48:09,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 228. [2025-03-17 01:48:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 143 states have (on average 1.3706293706293706) internal successors, (196), 143 states have internal predecessors, (196), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 01:48:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 358 transitions. [2025-03-17 01:48:09,395 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 358 transitions. Word has length 176 [2025-03-17 01:48:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:48:09,396 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 358 transitions. [2025-03-17 01:48:09,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-17 01:48:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 358 transitions. [2025-03-17 01:48:09,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 01:48:09,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:48:09,397 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:48:09,405 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-17 01:48:09,598 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,SelfDestructingSolverStorable6 [2025-03-17 01:48:09,598 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:48:09,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:48:09,598 INFO L85 PathProgramCache]: Analyzing trace with hash 503267877, now seen corresponding path program 1 times [2025-03-17 01:48:09,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:48:09,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692893466] [2025-03-17 01:48:09,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:48:09,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 01:48:09,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 01:48:09,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:09,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:48:09,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807199877] [2025-03-17 01:48:09,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:48:09,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:48:09,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:48:09,723 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-17 01:48:09,725 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-17 01:48:09,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 01:48:09,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 01:48:09,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:48:09,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:48:09,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 01:48:09,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:48:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 338 proven. 300 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-03-17 01:48:12,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:48:42,386 WARN L286 SmtUtils]: Spent 16.83s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 01:48:53,332 WARN L286 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 01:49:09,982 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 01:49:16,092 WARN L286 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 01:49:20,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse6 (mod c_~var_1_19~0 4294967296))) (let ((.cse1 (+ .cse6 1)) (.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse4 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse3 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse5 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (forall ((v_z_10 Int)) (or (< v_z_10 .cse3) (< v_z_10 .cse1) (< .cse4 v_z_10) (not (= (mod (* v_z_10 .cse2) 4294967296) v_z_10)))) (or (not (= .cse5 .cse0)) (< .cse6 .cse0)) (or (< .cse4 .cse5) (< .cse5 .cse3) (< .cse6 .cse5)))))) is different from false [2025-03-17 01:49:32,424 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse3 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse6 (mod c_~var_1_19~0 4294967296))) (let ((.cse1 (+ .cse6 1)) (.cse4 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse2 (mod c_~var_1_17~0 65536)) (.cse0 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse5 (mod (* c_~var_1_19~0 .cse3) 4294967296))) (and (forall ((v_z_10 Int)) (or (< v_z_10 .cse0) (< v_z_10 .cse1) (< .cse2 v_z_10) (not (= (mod (* v_z_10 .cse3) 4294967296) v_z_10)))) (or (< .cse4 .cse1) (not (= (mod (* .cse3 .cse4) 4294967296) .cse4))) (or (not (= .cse5 .cse4)) (< .cse6 .cse4)) (or (< .cse2 .cse5) (< .cse5 .cse0) (< .cse6 .cse5)))))) is different from false