./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.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_loopvsstraightlinecode_100-while_file-63.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 e08b130d986262ceb0772f034a60f5b23796cc6f800ada70e6af5834a62fdc07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:00:58,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:00:58,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:00:58,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:00:58,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:00:58,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:00:58,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:00:58,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:00:58,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:00:58,095 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:00:58,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:00:58,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:00:58,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:00:58,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:00:58,095 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:00:58,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:00:58,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:00:58,095 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:00:58,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:00:58,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:00:58,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:00:58,096 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:00:58,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:00:58,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:00:58,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:00:58,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:00:58,097 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 -> e08b130d986262ceb0772f034a60f5b23796cc6f800ada70e6af5834a62fdc07 [2025-03-03 23:00:58,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:00:58,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:00:58,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:00:58,357 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:00:58,357 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:00:58,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i [2025-03-03 23:00:59,613 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ecb9962/790bad1f27544effac7d4032fb065c52/FLAG60a47a4ff [2025-03-03 23:00:59,840 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:00:59,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i [2025-03-03 23:00:59,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ecb9962/790bad1f27544effac7d4032fb065c52/FLAG60a47a4ff [2025-03-03 23:01:00,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ecb9962/790bad1f27544effac7d4032fb065c52 [2025-03-03 23:01:00,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:01:00,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:01:00,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:01:00,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:01:00,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:01:00,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:01:00" (1/1) ... [2025-03-03 23:01:00,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43fbe401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00, skipping insertion in model container [2025-03-03 23:01:00,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:01:00" (1/1) ... [2025-03-03 23:01:00,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:01:00,318 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_loopvsstraightlinecode_100-while_file-63.i[916,929] [2025-03-03 23:01:00,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:01:00,384 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:01:00,398 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_loopvsstraightlinecode_100-while_file-63.i[916,929] [2025-03-03 23:01:00,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:01:00,461 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:01:00,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00 WrapperNode [2025-03-03 23:01:00,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:01:00,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:01:00,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:01:00,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:01:00,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00" (1/1) ... [2025-03-03 23:01:00,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00" (1/1) ... [2025-03-03 23:01:00,517 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2025-03-03 23:01:00,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:01:00,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:01:00,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:01:00,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:01:00,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00" (1/1) ... [2025-03-03 23:01:00,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00" (1/1) ... [2025-03-03 23:01:00,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00" (1/1) ... [2025-03-03 23:01:00,552 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 23:01:00,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00" (1/1) ... [2025-03-03 23:01:00,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00" (1/1) ... [2025-03-03 23:01:00,562 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00" (1/1) ... [2025-03-03 23:01:00,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00" (1/1) ... [2025-03-03 23:01:00,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00" (1/1) ... [2025-03-03 23:01:00,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00" (1/1) ... [2025-03-03 23:01:00,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:01:00,581 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:01:00,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:01:00,581 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:01:00,582 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00" (1/1) ... [2025-03-03 23:01:00,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:01:00,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:00,612 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 23:01:00,615 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 23:01:00,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:01:00,634 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:01:00,634 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:01:00,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:01:00,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:01:00,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:01:00,708 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:01:00,710 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:01:01,131 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc property_#t~bitwise17#1;havoc property_#t~short18#1;havoc property_#t~short19#1; [2025-03-03 23:01:01,170 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-03 23:01:01,170 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:01:01,185 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:01:01,188 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:01:01,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:01:01 BoogieIcfgContainer [2025-03-03 23:01:01,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:01:01,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:01:01,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:01:01,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:01:01,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:01:00" (1/3) ... [2025-03-03 23:01:01,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b77f7c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:01:01, skipping insertion in model container [2025-03-03 23:01:01,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:01:00" (2/3) ... [2025-03-03 23:01:01,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b77f7c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:01:01, skipping insertion in model container [2025-03-03 23:01:01,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:01:01" (3/3) ... [2025-03-03 23:01:01,198 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-63.i [2025-03-03 23:01:01,209 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:01:01,211 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-63.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:01:01,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:01:01,265 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;@12a268f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:01:01,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:01:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 23:01:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 23:01:01,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:01,281 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:01,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:01,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:01,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1773125691, now seen corresponding path program 1 times [2025-03-03 23:01:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:01,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892361754] [2025-03-03 23:01:01,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:01,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:01,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:01:01,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:01:01,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:01,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 23:01:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892361754] [2025-03-03 23:01:01,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892361754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:01:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382467117] [2025-03-03 23:01:01,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:01,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:01:01,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:01:01,620 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 23:01:01,623 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 23:01:01,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:01:01,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:01:01,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:01,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:01,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:01:01,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:01:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 23:01:01,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:01:01,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382467117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:01,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:01:01,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:01:01,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945323911] [2025-03-03 23:01:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:01,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:01:01,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:01,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:01:01,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:01:01,832 INFO L87 Difference]: Start difference. First operand has 88 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 23:01:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:01,856 INFO L93 Difference]: Finished difference Result 168 states and 285 transitions. [2025-03-03 23:01:01,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:01:01,858 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 143 [2025-03-03 23:01:01,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:01,864 INFO L225 Difference]: With dead ends: 168 [2025-03-03 23:01:01,865 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 23:01:01,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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 23:01:01,870 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:01,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:01:01,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 23:01:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 23:01:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 23:01:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2025-03-03 23:01:01,906 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 143 [2025-03-03 23:01:01,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:01,906 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2025-03-03 23:01:01,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 23:01:01,907 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2025-03-03 23:01:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 23:01:01,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:01,909 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:01,916 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 23:01:02,112 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 23:01:02,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:02,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:02,113 INFO L85 PathProgramCache]: Analyzing trace with hash -522257251, now seen corresponding path program 1 times [2025-03-03 23:01:02,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:02,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120421626] [2025-03-03 23:01:02,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:02,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:02,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:01:02,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:01:02,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:02,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:02,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:02,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120421626] [2025-03-03 23:01:02,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120421626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:02,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:02,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:01:02,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122624064] [2025-03-03 23:01:02,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:02,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:01:02,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:02,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:01:02,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:01:02,746 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:02,937 INFO L93 Difference]: Finished difference Result 244 states and 370 transitions. [2025-03-03 23:01:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:01:02,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 23:01:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:02,939 INFO L225 Difference]: With dead ends: 244 [2025-03-03 23:01:02,940 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 23:01:02,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:01:02,941 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 92 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:02,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 350 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:01:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 23:01:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 129. [2025-03-03 23:01:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 23:01:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 196 transitions. [2025-03-03 23:01:02,960 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 196 transitions. Word has length 143 [2025-03-03 23:01:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:02,961 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 196 transitions. [2025-03-03 23:01:02,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 196 transitions. [2025-03-03 23:01:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 23:01:02,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:02,963 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:02,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:01:02,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:02,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:02,964 INFO L85 PathProgramCache]: Analyzing trace with hash -589264004, now seen corresponding path program 1 times [2025-03-03 23:01:02,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:02,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240346399] [2025-03-03 23:01:02,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:02,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:02,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:01:03,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:01:03,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:03,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:03,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:03,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240346399] [2025-03-03 23:01:03,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240346399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:03,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:03,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:01:03,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259509145] [2025-03-03 23:01:03,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:03,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:01:03,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:03,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:01:03,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:01:03,424 INFO L87 Difference]: Start difference. First operand 129 states and 196 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:03,568 INFO L93 Difference]: Finished difference Result 310 states and 464 transitions. [2025-03-03 23:01:03,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:01:03,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 23:01:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:03,572 INFO L225 Difference]: With dead ends: 310 [2025-03-03 23:01:03,573 INFO L226 Difference]: Without dead ends: 230 [2025-03-03 23:01:03,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:01:03,575 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 188 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:03,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 289 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:01:03,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-03 23:01:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 182. [2025-03-03 23:01:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 130 states have (on average 1.3692307692307693) internal successors, (178), 131 states have internal predecessors, (178), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:01:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 274 transitions. [2025-03-03 23:01:03,606 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 274 transitions. Word has length 143 [2025-03-03 23:01:03,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:03,607 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 274 transitions. [2025-03-03 23:01:03,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:03,607 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 274 transitions. [2025-03-03 23:01:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 23:01:03,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:03,609 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:03,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:01:03,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:03,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:03,610 INFO L85 PathProgramCache]: Analyzing trace with hash 458262490, now seen corresponding path program 1 times [2025-03-03 23:01:03,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:03,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387078836] [2025-03-03 23:01:03,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:03,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:03,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:01:03,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:01:03,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:03,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:08,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:08,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387078836] [2025-03-03 23:01:08,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387078836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:08,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:08,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 23:01:08,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362108451] [2025-03-03 23:01:08,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:08,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 23:01:08,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:08,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 23:01:08,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:01:08,229 INFO L87 Difference]: Start difference. First operand 182 states and 274 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:09,471 INFO L93 Difference]: Finished difference Result 693 states and 1025 transitions. [2025-03-03 23:01:09,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 23:01:09,472 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 23:01:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:09,478 INFO L225 Difference]: With dead ends: 693 [2025-03-03 23:01:09,478 INFO L226 Difference]: Without dead ends: 561 [2025-03-03 23:01:09,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-03-03 23:01:09,479 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 447 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:09,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1007 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 23:01:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-03 23:01:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 226. [2025-03-03 23:01:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 174 states have (on average 1.396551724137931) internal successors, (243), 175 states have internal predecessors, (243), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:01:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 339 transitions. [2025-03-03 23:01:09,517 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 339 transitions. Word has length 143 [2025-03-03 23:01:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:09,518 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 339 transitions. [2025-03-03 23:01:09,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 339 transitions. [2025-03-03 23:01:09,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 23:01:09,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:09,522 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:09,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:01:09,522 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:09,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:09,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2093894471, now seen corresponding path program 1 times [2025-03-03 23:01:09,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:09,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432153875] [2025-03-03 23:01:09,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:09,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:09,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:01:09,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:01:09,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:09,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:12,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:12,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432153875] [2025-03-03 23:01:12,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432153875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:12,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:12,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 23:01:12,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484585352] [2025-03-03 23:01:12,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:12,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 23:01:12,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:12,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 23:01:12,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:01:12,513 INFO L87 Difference]: Start difference. First operand 226 states and 339 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:13,324 INFO L93 Difference]: Finished difference Result 535 states and 794 transitions. [2025-03-03 23:01:13,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 23:01:13,325 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 23:01:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:13,327 INFO L225 Difference]: With dead ends: 535 [2025-03-03 23:01:13,327 INFO L226 Difference]: Without dead ends: 380 [2025-03-03 23:01:13,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-03 23:01:13,330 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 324 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:13,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 783 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 23:01:13,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-03 23:01:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 241. [2025-03-03 23:01:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 189 states have (on average 1.4126984126984128) internal successors, (267), 190 states have internal predecessors, (267), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:01:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 363 transitions. [2025-03-03 23:01:13,350 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 363 transitions. Word has length 143 [2025-03-03 23:01:13,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:13,350 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 363 transitions. [2025-03-03 23:01:13,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 363 transitions. [2025-03-03 23:01:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 23:01:13,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:13,351 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:13,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:01:13,352 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:13,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash -538809863, now seen corresponding path program 1 times [2025-03-03 23:01:13,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:13,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854481335] [2025-03-03 23:01:13,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:13,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:13,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:01:13,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:01:13,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:13,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:15,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:15,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854481335] [2025-03-03 23:01:15,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854481335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:15,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:15,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 23:01:15,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216342882] [2025-03-03 23:01:15,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:15,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 23:01:15,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:15,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 23:01:15,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:01:15,523 INFO L87 Difference]: Start difference. First operand 241 states and 363 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:16,420 INFO L93 Difference]: Finished difference Result 708 states and 1046 transitions. [2025-03-03 23:01:16,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 23:01:16,421 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 23:01:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:16,425 INFO L225 Difference]: With dead ends: 708 [2025-03-03 23:01:16,425 INFO L226 Difference]: Without dead ends: 553 [2025-03-03 23:01:16,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-03-03 23:01:16,426 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 527 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:16,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1013 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:01:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-03 23:01:16,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 241. [2025-03-03 23:01:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 189 states have (on average 1.4126984126984128) internal successors, (267), 190 states have internal predecessors, (267), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:01:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 363 transitions. [2025-03-03 23:01:16,446 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 363 transitions. Word has length 143 [2025-03-03 23:01:16,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:16,446 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 363 transitions. [2025-03-03 23:01:16,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 363 transitions. [2025-03-03 23:01:16,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 23:01:16,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:16,448 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:16,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:01:16,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:16,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:16,449 INFO L85 PathProgramCache]: Analyzing trace with hash -377913091, now seen corresponding path program 1 times [2025-03-03 23:01:16,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:16,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856361655] [2025-03-03 23:01:16,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:16,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:01:16,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:01:16,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:16,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:16,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856361655] [2025-03-03 23:01:16,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856361655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:16,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:16,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:01:16,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673345775] [2025-03-03 23:01:16,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:16,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:01:16,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:16,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:01:16,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:01:16,636 INFO L87 Difference]: Start difference. First operand 241 states and 363 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:16,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:16,768 INFO L93 Difference]: Finished difference Result 448 states and 668 transitions. [2025-03-03 23:01:16,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:01:16,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 23:01:16,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:16,771 INFO L225 Difference]: With dead ends: 448 [2025-03-03 23:01:16,771 INFO L226 Difference]: Without dead ends: 276 [2025-03-03 23:01:16,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:01:16,772 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 138 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:16,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 452 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:01:16,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-03 23:01:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 238. [2025-03-03 23:01:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 186 states have (on average 1.39247311827957) internal successors, (259), 187 states have internal predecessors, (259), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:01:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 355 transitions. [2025-03-03 23:01:16,793 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 355 transitions. Word has length 143 [2025-03-03 23:01:16,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:16,793 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 355 transitions. [2025-03-03 23:01:16,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 355 transitions. [2025-03-03 23:01:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 23:01:16,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:16,795 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:16,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 23:01:16,795 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:16,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:16,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1364897244, now seen corresponding path program 1 times [2025-03-03 23:01:16,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:16,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528692153] [2025-03-03 23:01:16,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:16,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:16,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:01:16,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:01:16,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:16,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:20,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:20,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528692153] [2025-03-03 23:01:20,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528692153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:20,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:20,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 23:01:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008123042] [2025-03-03 23:01:20,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:20,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 23:01:20,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:20,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 23:01:20,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:01:20,637 INFO L87 Difference]: Start difference. First operand 238 states and 355 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:21,684 INFO L93 Difference]: Finished difference Result 583 states and 845 transitions. [2025-03-03 23:01:21,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 23:01:21,684 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 23:01:21,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:21,686 INFO L225 Difference]: With dead ends: 583 [2025-03-03 23:01:21,686 INFO L226 Difference]: Without dead ends: 416 [2025-03-03 23:01:21,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-03 23:01:21,687 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 422 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:21,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 866 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 23:01:21,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-03 23:01:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 291. [2025-03-03 23:01:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 236 states have (on average 1.3983050847457628) internal successors, (330), 238 states have internal predecessors, (330), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 23:01:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 430 transitions. [2025-03-03 23:01:21,705 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 430 transitions. Word has length 143 [2025-03-03 23:01:21,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:21,705 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 430 transitions. [2025-03-03 23:01:21,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 430 transitions. [2025-03-03 23:01:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 23:01:21,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:21,706 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:21,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 23:01:21,707 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:21,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:21,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2002650590, now seen corresponding path program 1 times [2025-03-03 23:01:21,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:21,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983463478] [2025-03-03 23:01:21,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:21,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:21,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 23:01:21,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 23:01:21,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:21,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:21,749 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:21,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:21,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983463478] [2025-03-03 23:01:21,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983463478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:21,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:21,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:01:21,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40837190] [2025-03-03 23:01:21,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:21,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:01:21,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:21,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:01:21,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:01:21,751 INFO L87 Difference]: Start difference. First operand 291 states and 430 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:21,770 INFO L93 Difference]: Finished difference Result 462 states and 687 transitions. [2025-03-03 23:01:21,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:01:21,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-03-03 23:01:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:21,773 INFO L225 Difference]: With dead ends: 462 [2025-03-03 23:01:21,773 INFO L226 Difference]: Without dead ends: 293 [2025-03-03 23:01:21,774 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 23:01:21,776 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:21,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:01:21,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-03 23:01:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-03 23:01:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 238 states have (on average 1.3949579831932772) internal successors, (332), 240 states have internal predecessors, (332), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 23:01:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 432 transitions. [2025-03-03 23:01:21,802 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 432 transitions. Word has length 143 [2025-03-03 23:01:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:21,803 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 432 transitions. [2025-03-03 23:01:21,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 432 transitions. [2025-03-03 23:01:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:01:21,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:21,804 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:21,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 23:01:21,804 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:21,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1715546815, now seen corresponding path program 1 times [2025-03-03 23:01:21,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:21,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290205826] [2025-03-03 23:01:21,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:21,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:21,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:01:21,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:01:21,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:21,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:21,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:21,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290205826] [2025-03-03 23:01:21,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290205826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:21,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:21,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:01:21,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221200184] [2025-03-03 23:01:21,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:21,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:01:21,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:21,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:01:21,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:01:21,879 INFO L87 Difference]: Start difference. First operand 293 states and 432 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:21,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:21,928 INFO L93 Difference]: Finished difference Result 664 states and 968 transitions. [2025-03-03 23:01:21,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:01:21,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-03-03 23:01:21,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:21,931 INFO L225 Difference]: With dead ends: 664 [2025-03-03 23:01:21,931 INFO L226 Difference]: Without dead ends: 459 [2025-03-03 23:01:21,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:01:21,932 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 63 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:21,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 338 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:01:21,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-03 23:01:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 455. [2025-03-03 23:01:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 382 states have (on average 1.3795811518324608) internal successors, (527), 387 states have internal predecessors, (527), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 23:01:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 655 transitions. [2025-03-03 23:01:21,956 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 655 transitions. Word has length 144 [2025-03-03 23:01:21,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:21,956 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 655 transitions. [2025-03-03 23:01:21,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 655 transitions. [2025-03-03 23:01:21,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:01:21,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:21,957 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:21,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 23:01:21,958 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:21,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash -565858634, now seen corresponding path program 1 times [2025-03-03 23:01:21,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:21,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034096282] [2025-03-03 23:01:21,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:21,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:21,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:01:22,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:01:22,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:22,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:24,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:24,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034096282] [2025-03-03 23:01:24,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034096282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:24,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:24,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 23:01:24,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788045610] [2025-03-03 23:01:24,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:24,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:01:24,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:24,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:01:24,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:01:24,923 INFO L87 Difference]: Start difference. First operand 455 states and 655 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:25,856 INFO L93 Difference]: Finished difference Result 857 states and 1234 transitions. [2025-03-03 23:01:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 23:01:25,857 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-03-03 23:01:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:25,861 INFO L225 Difference]: With dead ends: 857 [2025-03-03 23:01:25,861 INFO L226 Difference]: Without dead ends: 570 [2025-03-03 23:01:25,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-03-03 23:01:25,863 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 311 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:25,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 646 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:01:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-03 23:01:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 453. [2025-03-03 23:01:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 380 states have (on average 1.3789473684210527) internal successors, (524), 385 states have internal predecessors, (524), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 23:01:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 652 transitions. [2025-03-03 23:01:25,892 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 652 transitions. Word has length 144 [2025-03-03 23:01:25,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:25,892 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 652 transitions. [2025-03-03 23:01:25,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 652 transitions. [2025-03-03 23:01:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:01:25,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:25,894 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:25,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 23:01:25,894 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:25,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:25,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1554263968, now seen corresponding path program 1 times [2025-03-03 23:01:25,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:25,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890074554] [2025-03-03 23:01:25,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:25,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:25,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:01:25,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:01:25,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:25,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:29,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:29,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890074554] [2025-03-03 23:01:29,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890074554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:29,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:29,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 23:01:29,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119659905] [2025-03-03 23:01:29,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:29,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 23:01:29,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:29,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 23:01:29,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-03-03 23:01:29,976 INFO L87 Difference]: Start difference. First operand 453 states and 652 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:32,091 INFO L93 Difference]: Finished difference Result 1115 states and 1606 transitions. [2025-03-03 23:01:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 23:01:32,092 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-03-03 23:01:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:32,095 INFO L225 Difference]: With dead ends: 1115 [2025-03-03 23:01:32,095 INFO L226 Difference]: Without dead ends: 737 [2025-03-03 23:01:32,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2025-03-03 23:01:32,097 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 711 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:32,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1267 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 23:01:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-03-03 23:01:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 543. [2025-03-03 23:01:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 470 states have (on average 1.397872340425532) internal successors, (657), 475 states have internal predecessors, (657), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 23:01:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 785 transitions. [2025-03-03 23:01:32,125 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 785 transitions. Word has length 144 [2025-03-03 23:01:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:32,125 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 785 transitions. [2025-03-03 23:01:32,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 785 transitions. [2025-03-03 23:01:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:01:32,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:32,127 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:32,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 23:01:32,127 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:32,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:32,128 INFO L85 PathProgramCache]: Analyzing trace with hash -997892993, now seen corresponding path program 1 times [2025-03-03 23:01:32,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:32,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8420160] [2025-03-03 23:01:32,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:32,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:32,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:01:32,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:01:32,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:32,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:32,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:32,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8420160] [2025-03-03 23:01:32,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8420160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:32,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:32,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 23:01:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088423455] [2025-03-03 23:01:32,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:32,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:01:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:32,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:01:32,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:01:32,680 INFO L87 Difference]: Start difference. First operand 543 states and 785 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:33,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:33,621 INFO L93 Difference]: Finished difference Result 1092 states and 1545 transitions. [2025-03-03 23:01:33,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 23:01:33,622 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-03-03 23:01:33,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:33,625 INFO L225 Difference]: With dead ends: 1092 [2025-03-03 23:01:33,625 INFO L226 Difference]: Without dead ends: 809 [2025-03-03 23:01:33,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-03-03 23:01:33,628 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 382 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:33,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1112 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 23:01:33,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-03-03 23:01:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 642. [2025-03-03 23:01:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 563 states have (on average 1.403197158081705) internal successors, (790), 570 states have internal predecessors, (790), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 23:01:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 926 transitions. [2025-03-03 23:01:33,664 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 926 transitions. Word has length 144 [2025-03-03 23:01:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:33,664 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 926 transitions. [2025-03-03 23:01:33,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 926 transitions. [2025-03-03 23:01:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:01:33,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:33,666 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:33,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 23:01:33,666 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:33,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:33,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1765614881, now seen corresponding path program 1 times [2025-03-03 23:01:33,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:33,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830268870] [2025-03-03 23:01:33,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:33,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:33,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:01:33,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:01:33,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:33,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:33,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:33,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830268870] [2025-03-03 23:01:33,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830268870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:33,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:33,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:01:33,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937790349] [2025-03-03 23:01:33,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:33,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:01:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:33,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:01:33,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:01:33,867 INFO L87 Difference]: Start difference. First operand 642 states and 926 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:34,055 INFO L93 Difference]: Finished difference Result 1341 states and 1934 transitions. [2025-03-03 23:01:34,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:01:34,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-03-03 23:01:34,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:34,059 INFO L225 Difference]: With dead ends: 1341 [2025-03-03 23:01:34,060 INFO L226 Difference]: Without dead ends: 1024 [2025-03-03 23:01:34,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:01:34,061 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 249 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:34,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 477 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:01:34,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2025-03-03 23:01:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 682. [2025-03-03 23:01:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 603 states have (on average 1.407960199004975) internal successors, (849), 610 states have internal predecessors, (849), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 23:01:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 985 transitions. [2025-03-03 23:01:34,099 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 985 transitions. Word has length 144 [2025-03-03 23:01:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:34,100 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 985 transitions. [2025-03-03 23:01:34,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 985 transitions. [2025-03-03 23:01:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:01:34,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:34,102 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:34,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 23:01:34,102 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:34,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:34,102 INFO L85 PathProgramCache]: Analyzing trace with hash -786542080, now seen corresponding path program 1 times [2025-03-03 23:01:34,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:34,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577622728] [2025-03-03 23:01:34,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:34,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:34,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:01:34,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:01:34,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:34,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:34,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:34,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577622728] [2025-03-03 23:01:34,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577622728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:34,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:34,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:01:34,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434968016] [2025-03-03 23:01:34,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:34,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:01:34,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:34,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:01:34,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:01:34,245 INFO L87 Difference]: Start difference. First operand 682 states and 985 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:34,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:34,549 INFO L93 Difference]: Finished difference Result 2125 states and 3052 transitions. [2025-03-03 23:01:34,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 23:01:34,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-03-03 23:01:34,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:34,554 INFO L225 Difference]: With dead ends: 2125 [2025-03-03 23:01:34,555 INFO L226 Difference]: Without dead ends: 1674 [2025-03-03 23:01:34,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:01:34,556 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 553 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:34,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 543 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:01:34,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2025-03-03 23:01:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 900. [2025-03-03 23:01:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 791 states have (on average 1.4020227560050569) internal successors, (1109), 799 states have internal predecessors, (1109), 94 states have call successors, (94), 14 states have call predecessors, (94), 14 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 23:01:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1297 transitions. [2025-03-03 23:01:34,622 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1297 transitions. Word has length 144 [2025-03-03 23:01:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:34,622 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1297 transitions. [2025-03-03 23:01:34,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1297 transitions. [2025-03-03 23:01:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:01:34,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:34,624 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:34,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 23:01:34,625 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:34,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:34,625 INFO L85 PathProgramCache]: Analyzing trace with hash 260984414, now seen corresponding path program 1 times [2025-03-03 23:01:34,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:34,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709225513] [2025-03-03 23:01:34,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:34,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:34,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:01:34,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:01:34,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:34,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:36,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:36,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709225513] [2025-03-03 23:01:36,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709225513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:36,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:36,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 23:01:36,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940440493] [2025-03-03 23:01:36,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:36,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:01:36,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:36,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:01:36,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:01:36,227 INFO L87 Difference]: Start difference. First operand 900 states and 1297 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:36,798 INFO L93 Difference]: Finished difference Result 1597 states and 2271 transitions. [2025-03-03 23:01:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 23:01:36,799 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-03-03 23:01:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:36,802 INFO L225 Difference]: With dead ends: 1597 [2025-03-03 23:01:36,802 INFO L226 Difference]: Without dead ends: 1118 [2025-03-03 23:01:36,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-03 23:01:36,805 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 279 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:36,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 970 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 23:01:36,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-03-03 23:01:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 900. [2025-03-03 23:01:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 791 states have (on average 1.3994943109987357) internal successors, (1107), 799 states have internal predecessors, (1107), 94 states have call successors, (94), 14 states have call predecessors, (94), 14 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 23:01:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1295 transitions. [2025-03-03 23:01:36,899 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1295 transitions. Word has length 144 [2025-03-03 23:01:36,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:36,899 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1295 transitions. [2025-03-03 23:01:36,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1295 transitions. [2025-03-03 23:01:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 23:01:36,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:36,902 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:36,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 23:01:36,902 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:36,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:36,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1677593521, now seen corresponding path program 1 times [2025-03-03 23:01:36,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:36,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229608291] [2025-03-03 23:01:36,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:36,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:36,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 23:01:36,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 23:01:36,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:36,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:01:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 23:01:46,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:01:46,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229608291] [2025-03-03 23:01:46,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229608291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:01:46,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:01:46,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 23:01:46,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703520772] [2025-03-03 23:01:46,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:01:46,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 23:01:46,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:01:46,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 23:01:46,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-03-03 23:01:46,563 INFO L87 Difference]: Start difference. First operand 900 states and 1295 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:01:51,250 INFO L93 Difference]: Finished difference Result 2234 states and 3132 transitions. [2025-03-03 23:01:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 23:01:51,250 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2025-03-03 23:01:51,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:01:51,257 INFO L225 Difference]: With dead ends: 2234 [2025-03-03 23:01:51,257 INFO L226 Difference]: Without dead ends: 2232 [2025-03-03 23:01:51,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-03-03 23:01:51,258 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 458 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:01:51,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 728 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 23:01:51,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2025-03-03 23:01:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 1121. [2025-03-03 23:01:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1012 states have (on average 1.408102766798419) internal successors, (1425), 1020 states have internal predecessors, (1425), 94 states have call successors, (94), 14 states have call predecessors, (94), 14 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-03 23:01:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1613 transitions. [2025-03-03 23:01:51,336 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1613 transitions. Word has length 145 [2025-03-03 23:01:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:01:51,337 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1613 transitions. [2025-03-03 23:01:51,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 23:01:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1613 transitions. [2025-03-03 23:01:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 23:01:51,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:01:51,339 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:01:51,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 23:01:51,340 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:01:51,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:01:51,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1806676240, now seen corresponding path program 1 times [2025-03-03 23:01:51,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:01:51,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894510137] [2025-03-03 23:01:51,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:01:51,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:01:51,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 23:01:51,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 23:01:51,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:01:51,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:02:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 23:02:23,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:02:23,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894510137] [2025-03-03 23:02:23,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894510137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:02:23,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282168728] [2025-03-03 23:02:23,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:02:23,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:02:23,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:02:23,563 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 23:02:23,563 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 23:02:23,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 23:02:23,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 23:02:23,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:02:23,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:02:23,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 23:02:23,672 INFO L279 TraceCheckSpWp]: Computing forward predicates...