./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label48.c -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 6abe6deda42e5cd6457f2c2e337625778fbe4d0886f20421ed4af9df8a9f44a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:57:29,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:57:29,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:57:29,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:57:29,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:57:29,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:57:29,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:57:29,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:57:29,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:57:29,532 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:57:29,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:57:29,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:57:29,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:57:29,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:57:29,532 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:57:29,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:57:29,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:57:29,532 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:57:29,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:57:29,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:57:29,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:57:29,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:57:29,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:57:29,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:57:29,534 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:57:29,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:57:29,534 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:57:29,534 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:57:29,534 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:57:29,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:57:29,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:57:29,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:57:29,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:57:29,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:57:29,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:57:29,535 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:57:29,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:57:29,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:57:29,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:57:29,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:57:29,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:57:29,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:57:29,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:57:29,536 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 -> 6abe6deda42e5cd6457f2c2e337625778fbe4d0886f20421ed4af9df8a9f44a2 [2025-03-16 14:57:29,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:57:29,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:57:29,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:57:29,741 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:57:29,741 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:57:29,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label48.c [2025-03-16 14:57:30,851 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/536e9542e/dd62e7d9df4a48419bbe514df9e4ad92/FLAG7fb4bea3f [2025-03-16 14:57:31,301 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:57:31,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label48.c [2025-03-16 14:57:31,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/536e9542e/dd62e7d9df4a48419bbe514df9e4ad92/FLAG7fb4bea3f [2025-03-16 14:57:31,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/536e9542e/dd62e7d9df4a48419bbe514df9e4ad92 [2025-03-16 14:57:31,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:57:31,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:57:31,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:57:31,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:57:31,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:57:31,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:57:31" (1/1) ... [2025-03-16 14:57:31,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7535e449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:31, skipping insertion in model container [2025-03-16 14:57:31,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:57:31" (1/1) ... [2025-03-16 14:57:31,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:57:31,581 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/eca-rers2012/Problem12_label48.c[1668,1681] [2025-03-16 14:57:32,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:57:32,071 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:57:32,080 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/eca-rers2012/Problem12_label48.c[1668,1681] [2025-03-16 14:57:32,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:57:32,360 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:57:32,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:32 WrapperNode [2025-03-16 14:57:32,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:57:32,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:57:32,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:57:32,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:57:32,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:32" (1/1) ... [2025-03-16 14:57:32,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:32" (1/1) ... [2025-03-16 14:57:32,646 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-16 14:57:32,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:57:32,647 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:57:32,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:57:32,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:57:32,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:32" (1/1) ... [2025-03-16 14:57:32,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:32" (1/1) ... [2025-03-16 14:57:32,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:32" (1/1) ... [2025-03-16 14:57:32,824 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-16 14:57:32,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:32" (1/1) ... [2025-03-16 14:57:32,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:32" (1/1) ... [2025-03-16 14:57:32,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:32" (1/1) ... [2025-03-16 14:57:32,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:32" (1/1) ... [2025-03-16 14:57:32,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:32" (1/1) ... [2025-03-16 14:57:32,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:32" (1/1) ... [2025-03-16 14:57:32,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:57:32,970 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:57:32,970 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:57:32,970 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:57:32,971 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:32" (1/1) ... [2025-03-16 14:57:32,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:57:33,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:57:33,019 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-16 14:57:33,024 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-16 14:57:33,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:57:33,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:57:33,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:57:33,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:57:33,091 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:57:33,092 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:57:36,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-16 14:57:36,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-16 14:57:36,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-16 14:57:36,443 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-16 14:57:36,443 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:57:36,472 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:57:36,476 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:57:36,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:57:36 BoogieIcfgContainer [2025-03-16 14:57:36,476 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:57:36,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:57:36,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:57:36,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:57:36,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:57:31" (1/3) ... [2025-03-16 14:57:36,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d07da13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:57:36, skipping insertion in model container [2025-03-16 14:57:36,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:57:32" (2/3) ... [2025-03-16 14:57:36,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d07da13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:57:36, skipping insertion in model container [2025-03-16 14:57:36,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:57:36" (3/3) ... [2025-03-16 14:57:36,486 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label48.c [2025-03-16 14:57:36,498 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:57:36,499 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label48.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:57:36,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:57:36,577 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;@5a2d52d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:57:36,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:57:36,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 14:57:36,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:36,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:57:36,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:36,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1286660780, now seen corresponding path program 1 times [2025-03-16 14:57:36,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:36,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850712196] [2025-03-16 14:57:36,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:36,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:36,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 14:57:36,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 14:57:36,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:36,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:57:36,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:36,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850712196] [2025-03-16 14:57:36,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850712196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:36,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:36,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:57:36,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943054874] [2025-03-16 14:57:36,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:36,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:57:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:36,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:57:36,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:57:36,724 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:36,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:36,801 INFO L93 Difference]: Finished difference Result 1513 states and 3005 transitions. [2025-03-16 14:57:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:57:36,803 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 14:57:36,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:36,822 INFO L225 Difference]: With dead ends: 1513 [2025-03-16 14:57:36,822 INFO L226 Difference]: Without dead ends: 754 [2025-03-16 14:57:36,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-16 14:57:36,832 INFO L435 NwaCegarLoop]: 1441 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, 1441 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-16 14:57:36,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:57:36,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-16 14:57:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-16 14:57:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2025-03-16 14:57:36,894 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 9 [2025-03-16 14:57:36,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:36,894 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2025-03-16 14:57:36,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2025-03-16 14:57:36,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-16 14:57:36,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:36,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:57:36,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:57:36,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:36,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:36,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1257077356, now seen corresponding path program 1 times [2025-03-16 14:57:36,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:36,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745914394] [2025-03-16 14:57:36,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:36,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:36,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-16 14:57:36,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-16 14:57:36,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:36,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:57:36,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:36,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745914394] [2025-03-16 14:57:36,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745914394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:36,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:36,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:57:36,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474275227] [2025-03-16 14:57:36,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:36,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:36,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:36,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:36,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:36,990 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:39,685 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2025-03-16 14:57:39,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:39,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-16 14:57:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:39,691 INFO L225 Difference]: With dead ends: 2258 [2025-03-16 14:57:39,691 INFO L226 Difference]: Without dead ends: 1505 [2025-03-16 14:57:39,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 14:57:39,696 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 808 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:39,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 427 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 14:57:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-03-16 14:57:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2025-03-16 14:57:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6389627659574468) internal successors, (2465), 1504 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2465 transitions. [2025-03-16 14:57:39,744 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2465 transitions. Word has length 9 [2025-03-16 14:57:39,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:39,744 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2465 transitions. [2025-03-16 14:57:39,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2465 transitions. [2025-03-16 14:57:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 14:57:39,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:39,745 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:57:39,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:57:39,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:39,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:39,746 INFO L85 PathProgramCache]: Analyzing trace with hash 587947558, now seen corresponding path program 1 times [2025-03-16 14:57:39,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:39,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870618577] [2025-03-16 14:57:39,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:39,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:39,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 14:57:39,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 14:57:39,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:39,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:57:39,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:39,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870618577] [2025-03-16 14:57:39,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870618577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:39,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:39,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:39,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591450619] [2025-03-16 14:57:39,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:39,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:39,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:39,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:39,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:39,949 INFO L87 Difference]: Start difference. First operand 1505 states and 2465 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:42,429 INFO L93 Difference]: Finished difference Result 3760 states and 6365 transitions. [2025-03-16 14:57:42,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:42,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 14:57:42,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:42,440 INFO L225 Difference]: With dead ends: 3760 [2025-03-16 14:57:42,440 INFO L226 Difference]: Without dead ends: 2256 [2025-03-16 14:57:42,443 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-16 14:57:42,443 INFO L435 NwaCegarLoop]: 1201 mSDtfsCounter, 853 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2106 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 2880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:42,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1208 Invalid, 2880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2106 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 14:57:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2025-03-16 14:57:42,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2256. [2025-03-16 14:57:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.5405764966740576) internal successors, (3474), 2255 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3474 transitions. [2025-03-16 14:57:42,483 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3474 transitions. Word has length 80 [2025-03-16 14:57:42,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:42,484 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3474 transitions. [2025-03-16 14:57:42,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3474 transitions. [2025-03-16 14:57:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 14:57:42,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:42,485 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:57:42,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:57:42,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:42,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:42,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1051058809, now seen corresponding path program 1 times [2025-03-16 14:57:42,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:42,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049851503] [2025-03-16 14:57:42,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:42,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:42,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 14:57:42,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 14:57:42,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:42,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:57:42,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:42,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049851503] [2025-03-16 14:57:42,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049851503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:42,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:42,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:57:42,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638769777] [2025-03-16 14:57:42,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:42,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:42,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:42,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:42,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:42,620 INFO L87 Difference]: Start difference. First operand 2256 states and 3474 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:44,660 INFO L93 Difference]: Finished difference Result 6764 states and 10419 transitions. [2025-03-16 14:57:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:44,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-16 14:57:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:44,678 INFO L225 Difference]: With dead ends: 6764 [2025-03-16 14:57:44,678 INFO L226 Difference]: Without dead ends: 4509 [2025-03-16 14:57:44,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 14:57:44,682 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 775 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:44,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 446 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:57:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4509 states. [2025-03-16 14:57:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4509 to 4509. [2025-03-16 14:57:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4509 states, 4508 states have (on average 1.3717834960070985) internal successors, (6184), 4508 states have internal predecessors, (6184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 6184 transitions. [2025-03-16 14:57:44,744 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 6184 transitions. Word has length 83 [2025-03-16 14:57:44,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:44,744 INFO L471 AbstractCegarLoop]: Abstraction has 4509 states and 6184 transitions. [2025-03-16 14:57:44,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:44,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 6184 transitions. [2025-03-16 14:57:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 14:57:44,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:44,746 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:57:44,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:57:44,746 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:44,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash 549913937, now seen corresponding path program 1 times [2025-03-16 14:57:44,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:44,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100780105] [2025-03-16 14:57:44,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:44,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:44,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 14:57:44,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 14:57:44,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:44,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:57:44,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:44,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100780105] [2025-03-16 14:57:44,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100780105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:44,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:44,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:57:44,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602602806] [2025-03-16 14:57:44,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:44,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:44,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:44,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:44,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:44,892 INFO L87 Difference]: Start difference. First operand 4509 states and 6184 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:46,976 INFO L93 Difference]: Finished difference Result 13525 states and 18550 transitions. [2025-03-16 14:57:46,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:46,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-16 14:57:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:46,997 INFO L225 Difference]: With dead ends: 13525 [2025-03-16 14:57:46,997 INFO L226 Difference]: Without dead ends: 9017 [2025-03-16 14:57:47,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 14:57:47,004 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 901 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:47,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 351 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:57:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9017 states. [2025-03-16 14:57:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9017 to 9015. [2025-03-16 14:57:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9015 states, 9014 states have (on average 1.2660306190370534) internal successors, (11412), 9014 states have internal predecessors, (11412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9015 states to 9015 states and 11412 transitions. [2025-03-16 14:57:47,122 INFO L78 Accepts]: Start accepts. Automaton has 9015 states and 11412 transitions. Word has length 99 [2025-03-16 14:57:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:47,122 INFO L471 AbstractCegarLoop]: Abstraction has 9015 states and 11412 transitions. [2025-03-16 14:57:47,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 9015 states and 11412 transitions. [2025-03-16 14:57:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 14:57:47,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:47,127 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:57:47,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:57:47,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:47,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:47,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1905491936, now seen corresponding path program 1 times [2025-03-16 14:57:47,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:47,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77321683] [2025-03-16 14:57:47,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:47,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:47,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 14:57:47,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 14:57:47,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:47,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:57:47,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:47,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77321683] [2025-03-16 14:57:47,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77321683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:47,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:47,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:57:47,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396239964] [2025-03-16 14:57:47,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:47,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:47,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:47,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:47,249 INFO L87 Difference]: Start difference. First operand 9015 states and 11412 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:49,519 INFO L93 Difference]: Finished difference Result 27043 states and 34234 transitions. [2025-03-16 14:57:49,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:49,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-16 14:57:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:49,552 INFO L225 Difference]: With dead ends: 27043 [2025-03-16 14:57:49,552 INFO L226 Difference]: Without dead ends: 18029 [2025-03-16 14:57:49,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 14:57:49,559 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 702 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 626 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:49,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 630 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [626 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:57:49,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18029 states. [2025-03-16 14:57:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18029 to 18027. [2025-03-16 14:57:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18027 states, 18026 states have (on average 1.1805170309552868) internal successors, (21280), 18026 states have internal predecessors, (21280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18027 states to 18027 states and 21280 transitions. [2025-03-16 14:57:49,743 INFO L78 Accepts]: Start accepts. Automaton has 18027 states and 21280 transitions. Word has length 108 [2025-03-16 14:57:49,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:49,743 INFO L471 AbstractCegarLoop]: Abstraction has 18027 states and 21280 transitions. [2025-03-16 14:57:49,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 18027 states and 21280 transitions. [2025-03-16 14:57:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-16 14:57:49,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:49,745 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:57:49,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:57:49,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:49,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:49,746 INFO L85 PathProgramCache]: Analyzing trace with hash 815593365, now seen corresponding path program 1 times [2025-03-16 14:57:49,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:49,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461892889] [2025-03-16 14:57:49,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:49,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:49,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-16 14:57:49,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-16 14:57:49,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:49,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 14:57:50,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:50,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461892889] [2025-03-16 14:57:50,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461892889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:50,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:50,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:57:50,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979700222] [2025-03-16 14:57:50,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:50,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:57:50,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:50,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:57:50,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:57:50,301 INFO L87 Difference]: Start difference. First operand 18027 states and 21280 transitions. Second operand has 5 states, 5 states have (on average 43.0) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:53,901 INFO L93 Difference]: Finished difference Result 42814 states and 49977 transitions. [2025-03-16 14:57:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:57:53,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2025-03-16 14:57:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:53,945 INFO L225 Difference]: With dead ends: 42814 [2025-03-16 14:57:53,946 INFO L226 Difference]: Without dead ends: 24788 [2025-03-16 14:57:53,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:57:53,959 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 2814 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5281 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2814 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 5442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 5281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:53,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2814 Valid, 671 Invalid, 5442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 5281 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-16 14:57:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24788 states. [2025-03-16 14:57:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24788 to 23284. [2025-03-16 14:57:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23284 states, 23283 states have (on average 1.1532878065541383) internal successors, (26852), 23283 states have internal predecessors, (26852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23284 states to 23284 states and 26852 transitions. [2025-03-16 14:57:54,193 INFO L78 Accepts]: Start accepts. Automaton has 23284 states and 26852 transitions. Word has length 222 [2025-03-16 14:57:54,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:54,193 INFO L471 AbstractCegarLoop]: Abstraction has 23284 states and 26852 transitions. [2025-03-16 14:57:54,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:54,194 INFO L276 IsEmpty]: Start isEmpty. Operand 23284 states and 26852 transitions. [2025-03-16 14:57:54,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-16 14:57:54,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:54,197 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:57:54,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:57:54,197 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:54,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:54,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1169227293, now seen corresponding path program 1 times [2025-03-16 14:57:54,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:54,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286885253] [2025-03-16 14:57:54,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:54,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:54,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-16 14:57:54,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-16 14:57:54,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:54,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-16 14:57:54,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:54,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286885253] [2025-03-16 14:57:54,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286885253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:54,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:54,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:54,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227724864] [2025-03-16 14:57:54,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:54,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:54,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:54,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:54,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:54,354 INFO L87 Difference]: Start difference. First operand 23284 states and 26852 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:56,840 INFO L93 Difference]: Finished difference Result 67595 states and 78144 transitions. [2025-03-16 14:57:56,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:56,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2025-03-16 14:57:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:56,894 INFO L225 Difference]: With dead ends: 67595 [2025-03-16 14:57:56,895 INFO L226 Difference]: Without dead ends: 44312 [2025-03-16 14:57:56,915 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-16 14:57:56,915 INFO L435 NwaCegarLoop]: 1312 mSDtfsCounter, 751 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2753 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 2753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:56,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1319 Invalid, 3150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 2753 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 14:57:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44312 states. [2025-03-16 14:57:57,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44312 to 39055. [2025-03-16 14:57:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39055 states, 39054 states have (on average 1.1505351564500435) internal successors, (44933), 39054 states have internal predecessors, (44933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39055 states to 39055 states and 44933 transitions. [2025-03-16 14:57:57,237 INFO L78 Accepts]: Start accepts. Automaton has 39055 states and 44933 transitions. Word has length 249 [2025-03-16 14:57:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:57,237 INFO L471 AbstractCegarLoop]: Abstraction has 39055 states and 44933 transitions. [2025-03-16 14:57:57,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:57:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 39055 states and 44933 transitions. [2025-03-16 14:57:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-16 14:57:57,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:57,241 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:57:57,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:57:57,241 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:57,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:57,241 INFO L85 PathProgramCache]: Analyzing trace with hash -147177917, now seen corresponding path program 1 times [2025-03-16 14:57:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:57,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065621715] [2025-03-16 14:57:57,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:57,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:57,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-16 14:57:57,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-16 14:57:57,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:57,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 14:57:57,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:57,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065621715] [2025-03-16 14:57:57,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065621715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:57,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:57,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:57,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723371857] [2025-03-16 14:57:57,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:57,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:57:57,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:57,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:57:57,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:57:57,574 INFO L87 Difference]: Start difference. First operand 39055 states and 44933 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:00,035 INFO L93 Difference]: Finished difference Result 86409 states and 98688 transitions. [2025-03-16 14:58:00,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:58:00,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 293 [2025-03-16 14:58:00,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:00,176 INFO L225 Difference]: With dead ends: 86409 [2025-03-16 14:58:00,176 INFO L226 Difference]: Without dead ends: 47318 [2025-03-16 14:58:00,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-16 14:58:00,189 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 690 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3806 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 3905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:00,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 712 Invalid, 3905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3806 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 14:58:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47318 states. [2025-03-16 14:58:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47318 to 47316. [2025-03-16 14:58:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47316 states, 47315 states have (on average 1.125943146993554) internal successors, (53274), 47315 states have internal predecessors, (53274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47316 states to 47316 states and 53274 transitions. [2025-03-16 14:58:00,524 INFO L78 Accepts]: Start accepts. Automaton has 47316 states and 53274 transitions. Word has length 293 [2025-03-16 14:58:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:00,524 INFO L471 AbstractCegarLoop]: Abstraction has 47316 states and 53274 transitions. [2025-03-16 14:58:00,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 47316 states and 53274 transitions. [2025-03-16 14:58:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-16 14:58:00,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:00,528 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:58:00,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:58:00,528 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:00,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1119146677, now seen corresponding path program 1 times [2025-03-16 14:58:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:00,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275268254] [2025-03-16 14:58:00,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:00,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:00,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-16 14:58:00,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-16 14:58:00,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:00,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:58:00,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:00,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275268254] [2025-03-16 14:58:00,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275268254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:00,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:00,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:58:00,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297761193] [2025-03-16 14:58:00,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:00,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:00,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:00,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:00,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:00,736 INFO L87 Difference]: Start difference. First operand 47316 states and 53274 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:03,221 INFO L93 Difference]: Finished difference Result 111153 states and 126855 transitions. [2025-03-16 14:58:03,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:03,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 308 [2025-03-16 14:58:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:03,286 INFO L225 Difference]: With dead ends: 111153 [2025-03-16 14:58:03,286 INFO L226 Difference]: Without dead ends: 63838 [2025-03-16 14:58:03,316 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-16 14:58:03,317 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 717 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2273 mSolverCounterSat, 690 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 690 IncrementalHoareTripleChecker+Valid, 2273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:03,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 464 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [690 Valid, 2273 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:58:03,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63838 states. [2025-03-16 14:58:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63838 to 63087. [2025-03-16 14:58:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63087 states, 63086 states have (on average 1.1317090955204008) internal successors, (71395), 63086 states have internal predecessors, (71395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63087 states to 63087 states and 71395 transitions. [2025-03-16 14:58:03,961 INFO L78 Accepts]: Start accepts. Automaton has 63087 states and 71395 transitions. Word has length 308 [2025-03-16 14:58:03,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:03,961 INFO L471 AbstractCegarLoop]: Abstraction has 63087 states and 71395 transitions. [2025-03-16 14:58:03,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 63087 states and 71395 transitions. [2025-03-16 14:58:03,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-16 14:58:03,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:03,964 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:58:03,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:58:03,965 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:03,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:03,965 INFO L85 PathProgramCache]: Analyzing trace with hash 165645573, now seen corresponding path program 1 times [2025-03-16 14:58:03,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:03,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030394016] [2025-03-16 14:58:03,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:03,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:03,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-16 14:58:04,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-16 14:58:04,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:04,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-16 14:58:04,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:04,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030394016] [2025-03-16 14:58:04,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030394016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:04,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:04,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:58:04,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916296846] [2025-03-16 14:58:04,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:04,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:04,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:04,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:04,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:04,310 INFO L87 Difference]: Start difference. First operand 63087 states and 71395 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:06,580 INFO L93 Difference]: Finished difference Result 144948 states and 163059 transitions. [2025-03-16 14:58:06,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:06,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 340 [2025-03-16 14:58:06,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:06,661 INFO L225 Difference]: With dead ends: 144948 [2025-03-16 14:58:06,661 INFO L226 Difference]: Without dead ends: 80360 [2025-03-16 14:58:06,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-16 14:58:06,698 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 861 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2137 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:06,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 904 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2137 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:58:06,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80360 states. [2025-03-16 14:58:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80360 to 73601. [2025-03-16 14:58:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73601 states, 73600 states have (on average 1.108328804347826) internal successors, (81573), 73600 states have internal predecessors, (81573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73601 states to 73601 states and 81573 transitions. [2025-03-16 14:58:07,368 INFO L78 Accepts]: Start accepts. Automaton has 73601 states and 81573 transitions. Word has length 340 [2025-03-16 14:58:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:07,368 INFO L471 AbstractCegarLoop]: Abstraction has 73601 states and 81573 transitions. [2025-03-16 14:58:07,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 73601 states and 81573 transitions. [2025-03-16 14:58:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-16 14:58:07,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:07,374 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:58:07,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:58:07,374 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:07,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:07,375 INFO L85 PathProgramCache]: Analyzing trace with hash 117947993, now seen corresponding path program 1 times [2025-03-16 14:58:07,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:07,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545312705] [2025-03-16 14:58:07,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:07,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:07,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-16 14:58:07,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-16 14:58:07,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:07,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 14:58:08,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:08,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545312705] [2025-03-16 14:58:08,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545312705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:08,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:08,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:58:08,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901834811] [2025-03-16 14:58:08,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:08,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:58:08,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:08,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:58:08,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:58:08,388 INFO L87 Difference]: Start difference. First operand 73601 states and 81573 transitions. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:12,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:12,284 INFO L93 Difference]: Finished difference Result 189257 states and 212904 transitions. [2025-03-16 14:58:12,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:58:12,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 408 [2025-03-16 14:58:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:12,413 INFO L225 Difference]: With dead ends: 189257 [2025-03-16 14:58:12,413 INFO L226 Difference]: Without dead ends: 116408 [2025-03-16 14:58:12,463 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-16 14:58:12,464 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1411 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3815 mSolverCounterSat, 1406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 5221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1406 IncrementalHoareTripleChecker+Valid, 3815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:12,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 52 Invalid, 5221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1406 Valid, 3815 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-16 14:58:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116408 states. [2025-03-16 14:58:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116408 to 88621. [2025-03-16 14:58:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88621 states, 88620 states have (on average 1.1277138343489055) internal successors, (99938), 88620 states have internal predecessors, (99938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88621 states to 88621 states and 99938 transitions. [2025-03-16 14:58:13,642 INFO L78 Accepts]: Start accepts. Automaton has 88621 states and 99938 transitions. Word has length 408 [2025-03-16 14:58:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:13,642 INFO L471 AbstractCegarLoop]: Abstraction has 88621 states and 99938 transitions. [2025-03-16 14:58:13,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 88621 states and 99938 transitions. [2025-03-16 14:58:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-03-16 14:58:13,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:13,647 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:58:13,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:58:13,647 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:13,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1135542467, now seen corresponding path program 1 times [2025-03-16 14:58:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:13,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368560843] [2025-03-16 14:58:13,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:13,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:13,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-03-16 14:58:13,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-03-16 14:58:13,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:13,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 130 proven. 295 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 14:58:14,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:14,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368560843] [2025-03-16 14:58:14,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368560843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:58:14,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794937961] [2025-03-16 14:58:14,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:14,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:58:14,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:58:14,242 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-16 14:58:14,243 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-16 14:58:14,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-03-16 14:58:14,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-03-16 14:58:14,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:14,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:14,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:58:14,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:58:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-16 14:58:14,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:58:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794937961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:14,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:58:14,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:58:14,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964349384] [2025-03-16 14:58:14,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:14,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:14,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:14,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:14,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:58:14,528 INFO L87 Difference]: Start difference. First operand 88621 states and 99938 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:16,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:16,645 INFO L93 Difference]: Finished difference Result 176490 states and 199119 transitions. [2025-03-16 14:58:16,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:16,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 409 [2025-03-16 14:58:16,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:16,745 INFO L225 Difference]: With dead ends: 176490 [2025-03-16 14:58:16,745 INFO L226 Difference]: Without dead ends: 88621 [2025-03-16 14:58:16,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:58:16,798 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 750 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 2573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:16,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 990 Invalid, 2573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 14:58:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88621 states. [2025-03-16 14:58:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88621 to 88621. [2025-03-16 14:58:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88621 states, 88620 states have (on average 1.1184269916497405) internal successors, (99115), 88620 states have internal predecessors, (99115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88621 states to 88621 states and 99115 transitions. [2025-03-16 14:58:17,967 INFO L78 Accepts]: Start accepts. Automaton has 88621 states and 99115 transitions. Word has length 409 [2025-03-16 14:58:17,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:17,967 INFO L471 AbstractCegarLoop]: Abstraction has 88621 states and 99115 transitions. [2025-03-16 14:58:17,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 88621 states and 99115 transitions. [2025-03-16 14:58:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-03-16 14:58:17,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:17,972 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:58:17,979 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-16 14:58:18,173 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,SelfDestructingSolverStorable12 [2025-03-16 14:58:18,173 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:18,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:18,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2096810926, now seen corresponding path program 1 times [2025-03-16 14:58:18,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:18,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290010011] [2025-03-16 14:58:18,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:18,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:18,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-16 14:58:18,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-16 14:58:18,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:18,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-16 14:58:18,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:18,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290010011] [2025-03-16 14:58:18,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290010011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:18,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:18,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:58:18,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816041183] [2025-03-16 14:58:18,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:18,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:18,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:18,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:18,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:18,618 INFO L87 Difference]: Start difference. First operand 88621 states and 99115 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:20,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:20,881 INFO L93 Difference]: Finished difference Result 206530 states and 233163 transitions. [2025-03-16 14:58:20,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:20,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 423 [2025-03-16 14:58:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:21,013 INFO L225 Difference]: With dead ends: 206530 [2025-03-16 14:58:21,013 INFO L226 Difference]: Without dead ends: 118661 [2025-03-16 14:58:21,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:21,067 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 827 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 872 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 872 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:21,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 147 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [872 Valid, 2036 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:58:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118661 states. [2025-03-16 14:58:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118661 to 117159. [2025-03-16 14:58:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117159 states, 117158 states have (on average 1.119018760989433) internal successors, (131102), 117158 states have internal predecessors, (131102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117159 states to 117159 states and 131102 transitions. [2025-03-16 14:58:22,457 INFO L78 Accepts]: Start accepts. Automaton has 117159 states and 131102 transitions. Word has length 423 [2025-03-16 14:58:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:22,458 INFO L471 AbstractCegarLoop]: Abstraction has 117159 states and 131102 transitions. [2025-03-16 14:58:22,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 117159 states and 131102 transitions. [2025-03-16 14:58:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-16 14:58:22,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:22,463 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:58:22,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:58:22,463 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:22,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:22,463 INFO L85 PathProgramCache]: Analyzing trace with hash 727146342, now seen corresponding path program 1 times [2025-03-16 14:58:22,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:22,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613141759] [2025-03-16 14:58:22,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:22,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:22,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-16 14:58:22,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-16 14:58:22,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:22,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 373 proven. 54 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:58:23,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:23,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613141759] [2025-03-16 14:58:23,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613141759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:58:23,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311481859] [2025-03-16 14:58:23,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:23,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:58:23,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:58:23,123 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-16 14:58:23,124 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-16 14:58:23,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-16 14:58:23,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-16 14:58:23,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:23,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:23,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 14:58:23,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:58:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-16 14:58:23,776 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:58:23,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311481859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:23,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:58:23,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-16 14:58:23,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786422660] [2025-03-16 14:58:23,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:23,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:58:23,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:23,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:58:23,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:58:23,779 INFO L87 Difference]: Start difference. First operand 117159 states and 131102 transitions. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:28,211 INFO L93 Difference]: Finished difference Result 286136 states and 321549 transitions. [2025-03-16 14:58:28,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:58:28,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 431 [2025-03-16 14:58:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:28,436 INFO L225 Difference]: With dead ends: 286136 [2025-03-16 14:58:28,436 INFO L226 Difference]: Without dead ends: 168978 [2025-03-16 14:58:28,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:58:28,507 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1383 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5174 mSolverCounterSat, 770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 5944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 770 IncrementalHoareTripleChecker+Valid, 5174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:28,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 485 Invalid, 5944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [770 Valid, 5174 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-16 14:58:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168978 states. [2025-03-16 14:58:29,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168978 to 163721. [2025-03-16 14:58:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163721 states, 163720 states have (on average 1.108801612509162) internal successors, (181533), 163720 states have internal predecessors, (181533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163721 states to 163721 states and 181533 transitions. [2025-03-16 14:58:30,260 INFO L78 Accepts]: Start accepts. Automaton has 163721 states and 181533 transitions. Word has length 431 [2025-03-16 14:58:30,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:30,261 INFO L471 AbstractCegarLoop]: Abstraction has 163721 states and 181533 transitions. [2025-03-16 14:58:30,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 4 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:30,261 INFO L276 IsEmpty]: Start isEmpty. Operand 163721 states and 181533 transitions. [2025-03-16 14:58:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-16 14:58:30,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:30,266 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:58:30,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:58:30,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 14:58:30,467 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:30,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:30,468 INFO L85 PathProgramCache]: Analyzing trace with hash -365324547, now seen corresponding path program 1 times [2025-03-16 14:58:30,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:30,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372753217] [2025-03-16 14:58:30,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:30,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:30,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-16 14:58:30,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-16 14:58:30,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:30,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 14:58:30,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:30,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372753217] [2025-03-16 14:58:30,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372753217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:30,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:30,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:58:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480276834] [2025-03-16 14:58:30,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:30,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:30,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:30,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:30,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:30,988 INFO L87 Difference]: Start difference. First operand 163721 states and 181533 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:33,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:33,680 INFO L93 Difference]: Finished difference Result 328943 states and 364607 transitions. [2025-03-16 14:58:33,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:33,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 465 [2025-03-16 14:58:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:33,871 INFO L225 Difference]: With dead ends: 328943 [2025-03-16 14:58:33,871 INFO L226 Difference]: Without dead ends: 165974 [2025-03-16 14:58:33,929 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-16 14:58:33,930 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 760 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:33,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1003 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:58:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165974 states. [2025-03-16 14:58:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165974 to 161468. [2025-03-16 14:58:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161468 states, 161467 states have (on average 1.0908978305164523) internal successors, (176144), 161467 states have internal predecessors, (176144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161468 states to 161468 states and 176144 transitions. [2025-03-16 14:58:35,658 INFO L78 Accepts]: Start accepts. Automaton has 161468 states and 176144 transitions. Word has length 465 [2025-03-16 14:58:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:35,658 INFO L471 AbstractCegarLoop]: Abstraction has 161468 states and 176144 transitions. [2025-03-16 14:58:35,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 161468 states and 176144 transitions. [2025-03-16 14:58:35,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-16 14:58:35,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:35,668 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:58:35,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:58:35,669 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:35,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:35,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2093671708, now seen corresponding path program 1 times [2025-03-16 14:58:35,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:35,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265510452] [2025-03-16 14:58:35,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:35,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:35,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-16 14:58:35,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-16 14:58:35,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:35,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 267 proven. 257 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-16 14:58:36,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:36,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265510452] [2025-03-16 14:58:36,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265510452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:58:36,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261955433] [2025-03-16 14:58:36,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:36,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:58:36,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:58:36,227 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:58:36,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:58:36,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-16 14:58:36,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-16 14:58:36,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:36,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:36,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:58:36,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:58:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-16 14:58:36,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:58:36,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261955433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:36,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:58:36,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:58:36,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845987707] [2025-03-16 14:58:36,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:36,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:36,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:36,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:36,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:58:36,493 INFO L87 Difference]: Start difference. First operand 161468 states and 176144 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:39,136 INFO L93 Difference]: Finished difference Result 353726 states and 386781 transitions. [2025-03-16 14:58:39,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:39,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 483 [2025-03-16 14:58:39,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:39,554 INFO L225 Difference]: With dead ends: 353726 [2025-03-16 14:58:39,554 INFO L226 Difference]: Without dead ends: 193010 [2025-03-16 14:58:39,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:58:39,618 INFO L435 NwaCegarLoop]: 1292 mSDtfsCounter, 617 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2342 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 2342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:39,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1299 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 2342 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:58:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193010 states. [2025-03-16 14:58:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193010 to 187753. [2025-03-16 14:58:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187753 states, 187752 states have (on average 1.0776076952575737) internal successors, (202323), 187752 states have internal predecessors, (202323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187753 states to 187753 states and 202323 transitions. [2025-03-16 14:58:41,591 INFO L78 Accepts]: Start accepts. Automaton has 187753 states and 202323 transitions. Word has length 483 [2025-03-16 14:58:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:41,591 INFO L471 AbstractCegarLoop]: Abstraction has 187753 states and 202323 transitions. [2025-03-16 14:58:41,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 187753 states and 202323 transitions. [2025-03-16 14:58:41,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-16 14:58:41,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:41,602 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:58:41,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:58:41,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:58:41,802 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:41,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash -461381992, now seen corresponding path program 1 times [2025-03-16 14:58:41,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:41,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140912643] [2025-03-16 14:58:41,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:41,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:41,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-16 14:58:41,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-16 14:58:41,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:41,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 487 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 14:58:42,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:42,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140912643] [2025-03-16 14:58:42,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140912643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:42,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:42,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:58:42,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652540646] [2025-03-16 14:58:42,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:42,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:58:42,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:42,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:58:42,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:58:42,294 INFO L87 Difference]: Start difference. First operand 187753 states and 202323 transitions. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:44,824 INFO L93 Difference]: Finished difference Result 374754 states and 403889 transitions. [2025-03-16 14:58:44,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:44,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 539 [2025-03-16 14:58:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:45,033 INFO L225 Difference]: With dead ends: 374754 [2025-03-16 14:58:45,033 INFO L226 Difference]: Without dead ends: 187753 [2025-03-16 14:58:45,126 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-16 14:58:45,126 INFO L435 NwaCegarLoop]: 1273 mSDtfsCounter, 567 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2240 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 2240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:45,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1280 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 2240 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:58:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187753 states. [2025-03-16 14:58:46,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187753 to 183247. [2025-03-16 14:58:46,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183247 states, 183246 states have (on average 1.0603614812874496) internal successors, (194307), 183246 states have internal predecessors, (194307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:47,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183247 states to 183247 states and 194307 transitions. [2025-03-16 14:58:47,201 INFO L78 Accepts]: Start accepts. Automaton has 183247 states and 194307 transitions. Word has length 539 [2025-03-16 14:58:47,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:58:47,201 INFO L471 AbstractCegarLoop]: Abstraction has 183247 states and 194307 transitions. [2025-03-16 14:58:47,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 183247 states and 194307 transitions. [2025-03-16 14:58:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2025-03-16 14:58:47,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:58:47,212 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:58:47,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:58:47,213 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:58:47,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:58:47,213 INFO L85 PathProgramCache]: Analyzing trace with hash -836367873, now seen corresponding path program 1 times [2025-03-16 14:58:47,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:58:47,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377088679] [2025-03-16 14:58:47,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:58:47,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:58:47,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 554 statements into 1 equivalence classes. [2025-03-16 14:58:47,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 554 of 554 statements. [2025-03-16 14:58:47,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:58:47,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:58:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-16 14:58:47,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:58:47,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377088679] [2025-03-16 14:58:47,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377088679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:58:47,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:58:47,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 14:58:47,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008499475] [2025-03-16 14:58:47,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:58:47,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:58:47,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:58:47,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:58:47,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:58:47,958 INFO L87 Difference]: Start difference. First operand 183247 states and 194307 transitions. Second operand has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:58:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:58:50,861 INFO L93 Difference]: Finished difference Result 407798 states and 433544 transitions. [2025-03-16 14:58:50,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:58:50,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 554 [2025-03-16 14:58:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:58:51,155 INFO L225 Difference]: With dead ends: 407798 [2025-03-16 14:58:51,155 INFO L226 Difference]: Without dead ends: 225303 [2025-03-16 14:58:51,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-16 14:58:51,254 INFO L435 NwaCegarLoop]: 1223 mSDtfsCounter, 1339 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3593 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 3860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 3593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:58:51,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 1232 Invalid, 3860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 3593 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:58:51,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225303 states.