./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-71.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_fillercode_fillercodesize_ps-cn-500_file-71.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 ef425419d893cdf8f2db575b031c5b203ea887f7ed28e92ca0beafffac1fc1ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:10:32,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:10:32,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:10:32,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:10:32,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:10:32,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:10:32,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:10:32,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:10:32,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:10:32,465 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:10:32,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:10:32,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:10:32,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:10:32,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:10:32,467 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:10:32,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:10:32,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:10:32,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:10:32,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:10:32,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:10:32,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:10:32,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:10:32,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:10:32,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:10:32,468 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:10:32,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:10:32,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:10:32,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:10:32,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:10:32,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:10:32,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:10:32,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:10:32,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:32,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:10:32,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:10:32,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:10:32,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:10:32,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:10:32,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:10:32,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:10:32,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:10:32,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:10:32,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:10:32,470 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 -> ef425419d893cdf8f2db575b031c5b203ea887f7ed28e92ca0beafffac1fc1ee [2025-03-03 20:10:32,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:10:32,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:10:32,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:10:32,689 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:10:32,689 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:10:32,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-71.i [2025-03-03 20:10:33,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19211ccc/17eda248aee44b92a2bf69d723d0b832/FLAGc2f7fa3b1 [2025-03-03 20:10:34,051 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:10:34,051 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-71.i [2025-03-03 20:10:34,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19211ccc/17eda248aee44b92a2bf69d723d0b832/FLAGc2f7fa3b1 [2025-03-03 20:10:34,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19211ccc/17eda248aee44b92a2bf69d723d0b832 [2025-03-03 20:10:34,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:10:34,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:10:34,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:34,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:10:34,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:10:34,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:34" (1/1) ... [2025-03-03 20:10:34,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f1d087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34, skipping insertion in model container [2025-03-03 20:10:34,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:34" (1/1) ... [2025-03-03 20:10:34,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:10:34,483 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_fillercodesize_ps-cn-500_file-71.i[916,929] [2025-03-03 20:10:34,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:34,623 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:10:34,630 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_fillercodesize_ps-cn-500_file-71.i[916,929] [2025-03-03 20:10:34,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:34,712 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:10:34,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34 WrapperNode [2025-03-03 20:10:34,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:34,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:34,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:10:34,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:10:34,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34" (1/1) ... [2025-03-03 20:10:34,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34" (1/1) ... [2025-03-03 20:10:34,796 INFO L138 Inliner]: procedures = 26, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 755 [2025-03-03 20:10:34,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:34,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:10:34,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:10:34,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:10:34,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34" (1/1) ... [2025-03-03 20:10:34,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34" (1/1) ... [2025-03-03 20:10:34,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34" (1/1) ... [2025-03-03 20:10:34,838 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 20:10:34,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34" (1/1) ... [2025-03-03 20:10:34,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34" (1/1) ... [2025-03-03 20:10:34,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34" (1/1) ... [2025-03-03 20:10:34,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34" (1/1) ... [2025-03-03 20:10:34,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34" (1/1) ... [2025-03-03 20:10:34,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34" (1/1) ... [2025-03-03 20:10:34,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:10:34,886 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:10:34,886 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:10:34,886 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:10:34,887 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34" (1/1) ... [2025-03-03 20:10:34,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:34,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:34,917 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 20:10:34,923 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 20:10:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:10:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:10:34,941 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:10:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:10:34,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:10:34,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:10:35,062 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:10:35,064 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:10:36,042 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-03 20:10:36,043 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:10:36,078 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:10:36,078 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:10:36,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:36 BoogieIcfgContainer [2025-03-03 20:10:36,080 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:10:36,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:10:36,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:10:36,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:10:36,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:10:34" (1/3) ... [2025-03-03 20:10:36,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43757495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:36, skipping insertion in model container [2025-03-03 20:10:36,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:34" (2/3) ... [2025-03-03 20:10:36,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43757495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:36, skipping insertion in model container [2025-03-03 20:10:36,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:36" (3/3) ... [2025-03-03 20:10:36,089 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-71.i [2025-03-03 20:10:36,099 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:10:36,102 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-71.i that has 2 procedures, 318 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:10:36,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:10:36,173 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;@356af578, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:10:36,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:10:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 318 states, 218 states have (on average 1.6009174311926606) internal successors, (349), 219 states have internal predecessors, (349), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 20:10:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-03 20:10:36,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:36,205 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:36,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:36,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:36,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1772533918, now seen corresponding path program 1 times [2025-03-03 20:10:36,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:36,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537415594] [2025-03-03 20:10:36,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:36,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:36,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-03 20:10:36,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-03 20:10:36,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:36,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 18432 trivial. 0 not checked. [2025-03-03 20:10:36,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:36,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537415594] [2025-03-03 20:10:36,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537415594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:10:36,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912248715] [2025-03-03 20:10:36,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:36,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:10:36,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:36,815 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 20:10:36,817 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 20:10:36,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-03 20:10:37,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-03 20:10:37,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:37,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:37,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:10:37,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:10:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 18432 trivial. 0 not checked. [2025-03-03 20:10:37,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:10:37,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912248715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:37,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:10:37,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:10:37,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481293796] [2025-03-03 20:10:37,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:37,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:10:37,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:37,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:10:37,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:10:37,296 INFO L87 Difference]: Start difference. First operand has 318 states, 218 states have (on average 1.6009174311926606) internal successors, (349), 219 states have internal predecessors, (349), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (97), 2 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 2 states have call successors, (97) [2025-03-03 20:10:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:37,384 INFO L93 Difference]: Finished difference Result 630 states and 1178 transitions. [2025-03-03 20:10:37,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:10:37,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (97), 2 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 2 states have call successors, (97) Word has length 616 [2025-03-03 20:10:37,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:37,399 INFO L225 Difference]: With dead ends: 630 [2025-03-03 20:10:37,399 INFO L226 Difference]: Without dead ends: 315 [2025-03-03 20:10:37,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 617 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 20:10:37,408 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:37,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 525 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-03 20:10:37,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-03-03 20:10:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 216 states have (on average 1.5833333333333333) internal successors, (342), 216 states have internal predecessors, (342), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 20:10:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 536 transitions. [2025-03-03 20:10:37,497 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 536 transitions. Word has length 616 [2025-03-03 20:10:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:37,497 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 536 transitions. [2025-03-03 20:10:37,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (97), 2 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 2 states have call successors, (97) [2025-03-03 20:10:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 536 transitions. [2025-03-03 20:10:37,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-03 20:10:37,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:37,515 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:37,527 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 20:10:37,720 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 20:10:37,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:37,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:37,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1932384521, now seen corresponding path program 1 times [2025-03-03 20:10:37,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:37,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745898149] [2025-03-03 20:10:37,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:37,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:37,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-03 20:10:37,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-03 20:10:37,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:37,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:38,367 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-03-03 20:10:38,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:38,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745898149] [2025-03-03 20:10:38,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745898149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:38,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:38,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:38,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983573997] [2025-03-03 20:10:38,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:38,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:38,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:38,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:38,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:38,374 INFO L87 Difference]: Start difference. First operand 315 states and 536 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-03-03 20:10:38,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:38,483 INFO L93 Difference]: Finished difference Result 851 states and 1455 transitions. [2025-03-03 20:10:38,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:38,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 616 [2025-03-03 20:10:38,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:38,493 INFO L225 Difference]: With dead ends: 851 [2025-03-03 20:10:38,494 INFO L226 Difference]: Without dead ends: 539 [2025-03-03 20:10:38,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:38,497 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 375 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:38,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1251 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:38,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-03 20:10:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 536. [2025-03-03 20:10:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 390 states have (on average 1.623076923076923) internal successors, (633), 391 states have internal predecessors, (633), 143 states have call successors, (143), 2 states have call predecessors, (143), 2 states have return successors, (143), 142 states have call predecessors, (143), 143 states have call successors, (143) [2025-03-03 20:10:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 919 transitions. [2025-03-03 20:10:38,574 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 919 transitions. Word has length 616 [2025-03-03 20:10:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:38,575 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 919 transitions. [2025-03-03 20:10:38,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-03-03 20:10:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 919 transitions. [2025-03-03 20:10:38,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-03 20:10:38,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:38,590 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:38,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:10:38,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:38,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1009700938, now seen corresponding path program 1 times [2025-03-03 20:10:38,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:38,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97218428] [2025-03-03 20:10:38,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:38,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:38,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-03 20:10:38,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-03 20:10:38,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:38,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-03-03 20:10:38,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:38,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97218428] [2025-03-03 20:10:38,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97218428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:38,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:38,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:38,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027861791] [2025-03-03 20:10:38,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:38,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:38,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:38,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:38,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:38,920 INFO L87 Difference]: Start difference. First operand 536 states and 919 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-03-03 20:10:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:39,056 INFO L93 Difference]: Finished difference Result 1488 states and 2556 transitions. [2025-03-03 20:10:39,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:39,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 616 [2025-03-03 20:10:39,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:39,071 INFO L225 Difference]: With dead ends: 1488 [2025-03-03 20:10:39,071 INFO L226 Difference]: Without dead ends: 955 [2025-03-03 20:10:39,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:39,074 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 336 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:39,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1151 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-03-03 20:10:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 952. [2025-03-03 20:10:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 708 states have (on average 1.6299435028248588) internal successors, (1154), 711 states have internal predecessors, (1154), 239 states have call successors, (239), 4 states have call predecessors, (239), 4 states have return successors, (239), 236 states have call predecessors, (239), 239 states have call successors, (239) [2025-03-03 20:10:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1632 transitions. [2025-03-03 20:10:39,168 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1632 transitions. Word has length 616 [2025-03-03 20:10:39,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:39,169 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1632 transitions. [2025-03-03 20:10:39,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-03-03 20:10:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1632 transitions. [2025-03-03 20:10:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-03 20:10:39,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:39,176 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:39,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:10:39,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:39,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash -940599317, now seen corresponding path program 1 times [2025-03-03 20:10:39,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:39,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614230141] [2025-03-03 20:10:39,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:39,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:39,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-03 20:10:39,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-03 20:10:39,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:39,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-03-03 20:10:39,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:39,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614230141] [2025-03-03 20:10:39,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614230141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:39,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:39,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:39,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882933726] [2025-03-03 20:10:39,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:39,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:39,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:39,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:39,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:39,447 INFO L87 Difference]: Start difference. First operand 952 states and 1632 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-03-03 20:10:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:39,588 INFO L93 Difference]: Finished difference Result 2850 states and 4890 transitions. [2025-03-03 20:10:39,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:39,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 616 [2025-03-03 20:10:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:39,603 INFO L225 Difference]: With dead ends: 2850 [2025-03-03 20:10:39,603 INFO L226 Difference]: Without dead ends: 1901 [2025-03-03 20:10:39,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:39,610 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 508 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:39,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1470 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2025-03-03 20:10:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1899. [2025-03-03 20:10:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1899 states, 1412 states have (on average 1.6246458923512748) internal successors, (2294), 1418 states have internal predecessors, (2294), 478 states have call successors, (478), 8 states have call predecessors, (478), 8 states have return successors, (478), 472 states have call predecessors, (478), 478 states have call successors, (478) [2025-03-03 20:10:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 3250 transitions. [2025-03-03 20:10:39,795 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 3250 transitions. Word has length 616 [2025-03-03 20:10:39,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:39,796 INFO L471 AbstractCegarLoop]: Abstraction has 1899 states and 3250 transitions. [2025-03-03 20:10:39,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-03-03 20:10:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 3250 transitions. [2025-03-03 20:10:39,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-03 20:10:39,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:39,803 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:39,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:10:39,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:39,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:39,804 INFO L85 PathProgramCache]: Analyzing trace with hash -948358676, now seen corresponding path program 1 times [2025-03-03 20:10:39,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:39,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359739922] [2025-03-03 20:10:39,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:39,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:39,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-03 20:10:39,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-03 20:10:39,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:39,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-03-03 20:10:40,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:40,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359739922] [2025-03-03 20:10:40,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359739922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:40,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:40,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:40,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781420964] [2025-03-03 20:10:40,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:40,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:40,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:40,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:40,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:40,054 INFO L87 Difference]: Start difference. First operand 1899 states and 3250 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-03-03 20:10:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:40,259 INFO L93 Difference]: Finished difference Result 5385 states and 9204 transitions. [2025-03-03 20:10:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:40,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 616 [2025-03-03 20:10:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:40,284 INFO L225 Difference]: With dead ends: 5385 [2025-03-03 20:10:40,284 INFO L226 Difference]: Without dead ends: 3489 [2025-03-03 20:10:40,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:40,293 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 332 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:40,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1109 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2025-03-03 20:10:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 3485. [2025-03-03 20:10:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3485 states, 2602 states have (on average 1.6133743274404304) internal successors, (4198), 2616 states have internal predecessors, (4198), 866 states have call successors, (866), 16 states have call predecessors, (866), 16 states have return successors, (866), 852 states have call predecessors, (866), 866 states have call successors, (866) [2025-03-03 20:10:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 5930 transitions. [2025-03-03 20:10:40,535 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 5930 transitions. Word has length 616 [2025-03-03 20:10:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:40,536 INFO L471 AbstractCegarLoop]: Abstraction has 3485 states and 5930 transitions. [2025-03-03 20:10:40,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-03-03 20:10:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 5930 transitions. [2025-03-03 20:10:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-03 20:10:40,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:40,547 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:40,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:10:40,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:40,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:40,548 INFO L85 PathProgramCache]: Analyzing trace with hash -794845108, now seen corresponding path program 1 times [2025-03-03 20:10:40,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:40,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418918658] [2025-03-03 20:10:40,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:40,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:40,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-03 20:10:40,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-03 20:10:40,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:40,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-03-03 20:10:40,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:40,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418918658] [2025-03-03 20:10:40,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418918658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:40,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:40,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:40,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193579796] [2025-03-03 20:10:40,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:40,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:40,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:40,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:40,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:40,785 INFO L87 Difference]: Start difference. First operand 3485 states and 5930 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-03-03 20:10:41,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:41,121 INFO L93 Difference]: Finished difference Result 10449 states and 17784 transitions. [2025-03-03 20:10:41,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:41,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 616 [2025-03-03 20:10:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:41,165 INFO L225 Difference]: With dead ends: 10449 [2025-03-03 20:10:41,165 INFO L226 Difference]: Without dead ends: 6967 [2025-03-03 20:10:41,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:41,179 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 522 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:41,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1522 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6967 states. [2025-03-03 20:10:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6967 to 6965. [2025-03-03 20:10:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6965 states, 5200 states have (on average 1.6076923076923078) internal successors, (8360), 5228 states have internal predecessors, (8360), 1732 states have call successors, (1732), 32 states have call predecessors, (1732), 32 states have return successors, (1732), 1704 states have call predecessors, (1732), 1732 states have call successors, (1732) [2025-03-03 20:10:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6965 states to 6965 states and 11824 transitions. [2025-03-03 20:10:41,601 INFO L78 Accepts]: Start accepts. Automaton has 6965 states and 11824 transitions. Word has length 616 [2025-03-03 20:10:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:41,602 INFO L471 AbstractCegarLoop]: Abstraction has 6965 states and 11824 transitions. [2025-03-03 20:10:41,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-03-03 20:10:41,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6965 states and 11824 transitions. [2025-03-03 20:10:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2025-03-03 20:10:41,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:41,635 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:41,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:10:41,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:41,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash 712706701, now seen corresponding path program 1 times [2025-03-03 20:10:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:41,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783419538] [2025-03-03 20:10:41,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:41,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:41,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes. [2025-03-03 20:10:41,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements. [2025-03-03 20:10:41,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:41,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:42,051 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-03-03 20:10:42,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:42,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783419538] [2025-03-03 20:10:42,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783419538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:42,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:42,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:10:42,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234914313] [2025-03-03 20:10:42,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:42,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:10:42,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:42,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:10:42,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:10:42,058 INFO L87 Difference]: Start difference. First operand 6965 states and 11824 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-03-03 20:10:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:44,630 INFO L93 Difference]: Finished difference Result 53829 states and 90520 transitions. [2025-03-03 20:10:44,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:10:44,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 616 [2025-03-03 20:10:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:44,826 INFO L225 Difference]: With dead ends: 53829 [2025-03-03 20:10:44,826 INFO L226 Difference]: Without dead ends: 46867 [2025-03-03 20:10:44,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:10:44,863 INFO L435 NwaCegarLoop]: 1284 mSDtfsCounter, 1766 mSDsluCounter, 3767 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1766 SdHoareTripleChecker+Valid, 5051 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:44,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1766 Valid, 5051 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:10:44,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46867 states. [2025-03-03 20:10:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46867 to 46837. [2025-03-03 20:10:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46837 states, 33412 states have (on average 1.5617143541242666) internal successors, (52180), 33652 states have internal predecessors, (52180), 13168 states have call successors, (13168), 256 states have call predecessors, (13168), 256 states have return successors, (13168), 12928 states have call predecessors, (13168), 13168 states have call successors, (13168) [2025-03-03 20:10:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46837 states to 46837 states and 78516 transitions. [2025-03-03 20:10:47,629 INFO L78 Accepts]: Start accepts. Automaton has 46837 states and 78516 transitions. Word has length 616 [2025-03-03 20:10:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:47,631 INFO L471 AbstractCegarLoop]: Abstraction has 46837 states and 78516 transitions. [2025-03-03 20:10:47,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-03-03 20:10:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 46837 states and 78516 transitions. [2025-03-03 20:10:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2025-03-03 20:10:47,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:47,650 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:10:47,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:10:47,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:47,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:47,651 INFO L85 PathProgramCache]: Analyzing trace with hash 572180515, now seen corresponding path program 1 times [2025-03-03 20:10:47,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:47,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598760893] [2025-03-03 20:10:47,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:47,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:47,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-03-03 20:10:48,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-03-03 20:10:48,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:48,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-03-03 20:10:50,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:50,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598760893] [2025-03-03 20:10:50,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598760893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:50,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:50,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 20:10:50,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248864479] [2025-03-03 20:10:50,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:50,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:10:50,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:50,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:10:50,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:10:50,730 INFO L87 Difference]: Start difference. First operand 46837 states and 78516 transitions. Second operand has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 13 states have internal predecessors, (135), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-03-03 20:11:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:11:09,041 INFO L93 Difference]: Finished difference Result 265155 states and 438979 transitions. [2025-03-03 20:11:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-03 20:11:09,042 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 13 states have internal predecessors, (135), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 617 [2025-03-03 20:11:09,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:11:10,340 INFO L225 Difference]: With dead ends: 265155 [2025-03-03 20:11:10,341 INFO L226 Difference]: Without dead ends: 218321 [2025-03-03 20:11:10,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=942, Invalid=3218, Unknown=0, NotChecked=0, Total=4160 [2025-03-03 20:11:10,559 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 10737 mSDsluCounter, 7400 mSDsCounter, 0 mSdLazyCounter, 4581 mSolverCounterSat, 2191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10737 SdHoareTripleChecker+Valid, 7971 SdHoareTripleChecker+Invalid, 6772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2191 IncrementalHoareTripleChecker+Valid, 4581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:11:10,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10737 Valid, 7971 Invalid, 6772 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2191 Valid, 4581 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-03-03 20:11:10,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218321 states. [2025-03-03 20:11:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218321 to 138437. [2025-03-03 20:11:20,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138437 states, 103420 states have (on average 1.5709920711661187) internal successors, (162472), 104260 states have internal predecessors, (162472), 33960 states have call successors, (33960), 1056 states have call predecessors, (33960), 1056 states have return successors, (33960), 33120 states have call predecessors, (33960), 33960 states have call successors, (33960) [2025-03-03 20:11:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138437 states to 138437 states and 230392 transitions. [2025-03-03 20:11:21,622 INFO L78 Accepts]: Start accepts. Automaton has 138437 states and 230392 transitions. Word has length 617 [2025-03-03 20:11:21,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:11:21,624 INFO L471 AbstractCegarLoop]: Abstraction has 138437 states and 230392 transitions. [2025-03-03 20:11:21,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.384615384615385) internal successors, (135), 13 states have internal predecessors, (135), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-03-03 20:11:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 138437 states and 230392 transitions. [2025-03-03 20:11:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2025-03-03 20:11:21,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:11:21,661 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:11:21,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:11:21,661 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:11:21,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:11:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2114831521, now seen corresponding path program 1 times [2025-03-03 20:11:21,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:11:21,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530644439] [2025-03-03 20:11:21,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:21,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:11:21,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-03-03 20:11:21,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-03-03 20:11:21,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:21,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 153 proven. 135 refuted. 0 times theorem prover too weak. 18336 trivial. 0 not checked. [2025-03-03 20:11:22,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530644439] [2025-03-03 20:11:22,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530644439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:11:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368394671] [2025-03-03 20:11:22,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:11:22,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:11:22,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:11:22,763 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 20:11:22,767 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 20:11:22,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-03-03 20:11:23,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-03-03 20:11:23,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:11:23,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:23,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 1411 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 20:11:23,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:11:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 9298 proven. 159 refuted. 0 times theorem prover too weak. 9167 trivial. 0 not checked. [2025-03-03 20:11:25,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:11:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 129 proven. 159 refuted. 0 times theorem prover too weak. 18336 trivial. 0 not checked. [2025-03-03 20:11:26,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368394671] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:11:26,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:11:26,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 13] total 23 [2025-03-03 20:11:26,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751898710] [2025-03-03 20:11:26,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:11:26,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 20:11:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:26,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 20:11:26,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-03-03 20:11:26,265 INFO L87 Difference]: Start difference. First operand 138437 states and 230392 transitions. Second operand has 23 states, 23 states have (on average 10.869565217391305) internal successors, (250), 23 states have internal predecessors, (250), 3 states have call successors, (203), 2 states have call predecessors, (203), 4 states have return successors, (205), 3 states have call predecessors, (205), 3 states have call successors, (205)