./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label52.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/Problem19_label52.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 7d08753ec3d09588e14fe223037879a9e4c26dd4e0293239a5101a4dc04bd1c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:32:33,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:32:33,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:32:33,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:32:33,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:32:33,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:32:33,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:32:33,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:32:33,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:32:33,233 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:32:33,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:32:33,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:32:33,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:32:33,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:32:33,234 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:32:33,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:32:33,235 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:32:33,235 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:32:33,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:32:33,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:32:33,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:32:33,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:32:33,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:32:33,236 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:32:33,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:32:33,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:32:33,236 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 -> 7d08753ec3d09588e14fe223037879a9e4c26dd4e0293239a5101a4dc04bd1c9 [2025-03-16 15:32:33,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:32:33,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:32:33,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:32:33,469 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:32:33,469 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:32:33,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label52.c [2025-03-16 15:32:34,665 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50ced5fee/68247650c7684526b181d36b0c6890d0/FLAGc7f6cb69d [2025-03-16 15:32:35,222 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:32:35,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label52.c [2025-03-16 15:32:35,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50ced5fee/68247650c7684526b181d36b0c6890d0/FLAGc7f6cb69d [2025-03-16 15:32:35,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50ced5fee/68247650c7684526b181d36b0c6890d0 [2025-03-16 15:32:35,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:32:35,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:32:35,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:32:35,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:32:35,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:32:35,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:32:35" (1/1) ... [2025-03-16 15:32:35,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b53348a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:35, skipping insertion in model container [2025-03-16 15:32:35,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:32:35" (1/1) ... [2025-03-16 15:32:35,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:32:36,114 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/Problem19_label52.c[7226,7239] [2025-03-16 15:32:36,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:32:36,800 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:32:36,817 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/Problem19_label52.c[7226,7239] [2025-03-16 15:32:37,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:32:37,293 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:32:37,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:37 WrapperNode [2025-03-16 15:32:37,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:32:37,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:32:37,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:32:37,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:32:37,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:37" (1/1) ... [2025-03-16 15:32:37,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:37" (1/1) ... [2025-03-16 15:32:37,945 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-16 15:32:37,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:32:37,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:32:37,946 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:32:37,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:32:37,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:37" (1/1) ... [2025-03-16 15:32:37,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:37" (1/1) ... [2025-03-16 15:32:38,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:37" (1/1) ... [2025-03-16 15:32:38,412 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 15:32:38,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:37" (1/1) ... [2025-03-16 15:32:38,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:37" (1/1) ... [2025-03-16 15:32:38,685 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:37" (1/1) ... [2025-03-16 15:32:38,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:37" (1/1) ... [2025-03-16 15:32:38,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:37" (1/1) ... [2025-03-16 15:32:38,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:37" (1/1) ... [2025-03-16 15:32:38,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:32:38,887 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:32:38,887 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:32:38,887 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:32:38,888 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:37" (1/1) ... [2025-03-16 15:32:38,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:32:38,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:32:38,916 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 15:32:38,926 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 15:32:38,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:32:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:32:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:32:38,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:32:39,004 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:32:39,006 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:32:45,144 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-16 15:32:45,144 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-16 15:32:45,145 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-16 15:32:45,145 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-16 15:32:45,145 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-16 15:32:45,337 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-16 15:32:45,337 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:32:45,386 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:32:45,389 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:32:45,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:32:45 BoogieIcfgContainer [2025-03-16 15:32:45,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:32:45,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:32:45,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:32:45,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:32:45,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:32:35" (1/3) ... [2025-03-16 15:32:45,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499c6142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:32:45, skipping insertion in model container [2025-03-16 15:32:45,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:32:37" (2/3) ... [2025-03-16 15:32:45,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499c6142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:32:45, skipping insertion in model container [2025-03-16 15:32:45,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:32:45" (3/3) ... [2025-03-16 15:32:45,398 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label52.c [2025-03-16 15:32:45,412 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:32:45,413 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label52.c that has 1 procedures, 1687 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:32:45,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:32:45,503 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;@42cf56cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:32:45,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:32:45,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 1687 states, 1685 states have (on average 1.9008902077151335) internal successors, (3203), 1686 states have internal predecessors, (3203), 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 15:32:45,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 15:32:45,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:45,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:45,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:45,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:45,522 INFO L85 PathProgramCache]: Analyzing trace with hash 20262376, now seen corresponding path program 1 times [2025-03-16 15:32:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:45,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970086971] [2025-03-16 15:32:45,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:45,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 15:32:45,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 15:32:45,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:45,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:45,632 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 15:32:45,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:45,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970086971] [2025-03-16 15:32:45,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970086971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:45,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:45,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:32:45,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285367449] [2025-03-16 15:32:45,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:45,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:32:45,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:45,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:32:45,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:32:45,654 INFO L87 Difference]: Start difference. First operand has 1687 states, 1685 states have (on average 1.9008902077151335) internal successors, (3203), 1686 states have internal predecessors, (3203), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 15:32:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:45,721 INFO L93 Difference]: Finished difference Result 3373 states and 6405 transitions. [2025-03-16 15:32:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:32:45,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 54 [2025-03-16 15:32:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:45,737 INFO L225 Difference]: With dead ends: 3373 [2025-03-16 15:32:45,737 INFO L226 Difference]: Without dead ends: 1684 [2025-03-16 15:32:45,742 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 15:32:45,744 INFO L435 NwaCegarLoop]: 3141 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, 3141 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 15:32:45,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:32:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2025-03-16 15:32:45,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2025-03-16 15:32:45,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 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 15:32:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2025-03-16 15:32:45,832 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 54 [2025-03-16 15:32:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:45,832 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2025-03-16 15:32:45,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 15:32:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2025-03-16 15:32:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-16 15:32:45,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:45,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:45,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:32:45,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:45,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1958416727, now seen corresponding path program 1 times [2025-03-16 15:32:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:45,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817707740] [2025-03-16 15:32:45,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:45,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:45,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-16 15:32:45,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-16 15:32:45,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:45,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:46,176 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 15:32:46,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:46,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817707740] [2025-03-16 15:32:46,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817707740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:46,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:46,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:32:46,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619903645] [2025-03-16 15:32:46,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:46,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:32:46,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:46,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:32:46,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:32:46,180 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 15:32:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:54,402 INFO L93 Difference]: Finished difference Result 6152 states and 11658 transitions. [2025-03-16 15:32:54,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:32:54,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2025-03-16 15:32:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:54,420 INFO L225 Difference]: With dead ends: 6152 [2025-03-16 15:32:54,420 INFO L226 Difference]: Without dead ends: 4469 [2025-03-16 15:32:54,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 15:32:54,423 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 4526 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 6995 mSolverCounterSat, 3571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4526 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 10566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3571 IncrementalHoareTripleChecker+Valid, 6995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:54,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4526 Valid, 969 Invalid, 10566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3571 Valid, 6995 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2025-03-16 15:32:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4469 states. [2025-03-16 15:32:54,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4469 to 4466. [2025-03-16 15:32:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4466 states, 4465 states have (on average 1.5686450167973125) internal successors, (7004), 4465 states have internal predecessors, (7004), 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 15:32:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 7004 transitions. [2025-03-16 15:32:54,502 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 7004 transitions. Word has length 54 [2025-03-16 15:32:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:54,502 INFO L471 AbstractCegarLoop]: Abstraction has 4466 states and 7004 transitions. [2025-03-16 15:32:54,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 15:32:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 7004 transitions. [2025-03-16 15:32:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-16 15:32:54,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:54,513 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:54,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:32:54,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:54,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash 284847037, now seen corresponding path program 1 times [2025-03-16 15:32:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:54,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495430818] [2025-03-16 15:32:54,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:54,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-16 15:32:54,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-16 15:32:54,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:54,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-16 15:32:55,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:55,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495430818] [2025-03-16 15:32:55,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495430818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:55,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:55,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:32:55,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386739786] [2025-03-16 15:32:55,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:55,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:32:55,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:55,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:32:55,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:32:55,470 INFO L87 Difference]: Start difference. First operand 4466 states and 7004 transitions. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 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 15:33:02,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:02,980 INFO L93 Difference]: Finished difference Result 11708 states and 20251 transitions. [2025-03-16 15:33:02,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:33:02,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 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 328 [2025-03-16 15:33:02,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:03,006 INFO L225 Difference]: With dead ends: 11708 [2025-03-16 15:33:03,006 INFO L226 Difference]: Without dead ends: 8608 [2025-03-16 15:33:03,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 15:33:03,011 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 3755 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9457 mSolverCounterSat, 1343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3755 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 10800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1343 IncrementalHoareTripleChecker+Valid, 9457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:03,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3755 Valid, 2159 Invalid, 10800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1343 Valid, 9457 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-03-16 15:33:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8608 states. [2025-03-16 15:33:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8608 to 8594. [2025-03-16 15:33:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8594 states, 8593 states have (on average 1.3509833585476552) internal successors, (11609), 8593 states have internal predecessors, (11609), 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 15:33:03,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8594 states to 8594 states and 11609 transitions. [2025-03-16 15:33:03,147 INFO L78 Accepts]: Start accepts. Automaton has 8594 states and 11609 transitions. Word has length 328 [2025-03-16 15:33:03,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:03,148 INFO L471 AbstractCegarLoop]: Abstraction has 8594 states and 11609 transitions. [2025-03-16 15:33:03,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 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 15:33:03,148 INFO L276 IsEmpty]: Start isEmpty. Operand 8594 states and 11609 transitions. [2025-03-16 15:33:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-16 15:33:03,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:03,151 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:33:03,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:33:03,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:03,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:03,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1075069647, now seen corresponding path program 1 times [2025-03-16 15:33:03,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:03,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69511519] [2025-03-16 15:33:03,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:03,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:03,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-16 15:33:03,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-16 15:33:03,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:03,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 15:33:03,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:03,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69511519] [2025-03-16 15:33:03,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69511519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:03,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:03,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:33:03,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870281497] [2025-03-16 15:33:03,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:03,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:33:03,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:03,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:33:03,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:33:03,722 INFO L87 Difference]: Start difference. First operand 8594 states and 11609 transitions. Second operand has 4 states, 4 states have (on average 82.5) internal successors, (330), 3 states have internal predecessors, (330), 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 15:33:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:08,052 INFO L93 Difference]: Finished difference Result 14488 states and 20500 transitions. [2025-03-16 15:33:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:33:08,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 3 states have internal predecessors, (330), 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 356 [2025-03-16 15:33:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:08,078 INFO L225 Difference]: With dead ends: 14488 [2025-03-16 15:33:08,078 INFO L226 Difference]: Without dead ends: 8594 [2025-03-16 15:33:08,086 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 15:33:08,088 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 1151 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5716 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 5724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:08,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1953 Invalid, 5724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5716 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 15:33:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8594 states. [2025-03-16 15:33:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8594 to 8594. [2025-03-16 15:33:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8594 states, 8593 states have (on average 1.3494704992435704) internal successors, (11596), 8593 states have internal predecessors, (11596), 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 15:33:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8594 states to 8594 states and 11596 transitions. [2025-03-16 15:33:08,235 INFO L78 Accepts]: Start accepts. Automaton has 8594 states and 11596 transitions. Word has length 356 [2025-03-16 15:33:08,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:08,236 INFO L471 AbstractCegarLoop]: Abstraction has 8594 states and 11596 transitions. [2025-03-16 15:33:08,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 3 states have internal predecessors, (330), 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 15:33:08,237 INFO L276 IsEmpty]: Start isEmpty. Operand 8594 states and 11596 transitions. [2025-03-16 15:33:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-16 15:33:08,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:08,248 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:33:08,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:33:08,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:08,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:08,249 INFO L85 PathProgramCache]: Analyzing trace with hash 561020382, now seen corresponding path program 1 times [2025-03-16 15:33:08,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:08,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602867789] [2025-03-16 15:33:08,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:08,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:08,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-16 15:33:08,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-16 15:33:08,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:08,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 105 proven. 37 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 15:33:09,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:09,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602867789] [2025-03-16 15:33:09,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602867789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:33:09,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931445660] [2025-03-16 15:33:09,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:09,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:33:09,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:33:09,174 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 15:33:09,176 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 15:33:09,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-16 15:33:09,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-16 15:33:09,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:09,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:09,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:33:09,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:33:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:33:09,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:33:09,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931445660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:09,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:33:09,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 15:33:09,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174225604] [2025-03-16 15:33:09,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:09,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:09,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:09,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:09,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:33:09,537 INFO L87 Difference]: Start difference. First operand 8594 states and 11596 transitions. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 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 15:33:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:14,041 INFO L93 Difference]: Finished difference Result 19938 states and 28771 transitions. [2025-03-16 15:33:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:14,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 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 608 [2025-03-16 15:33:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:14,067 INFO L225 Difference]: With dead ends: 19938 [2025-03-16 15:33:14,068 INFO L226 Difference]: Without dead ends: 14075 [2025-03-16 15:33:14,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:33:14,075 INFO L435 NwaCegarLoop]: 1363 mSDtfsCounter, 1742 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 3871 mSolverCounterSat, 1728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 5599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1728 IncrementalHoareTripleChecker+Valid, 3871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:14,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 1501 Invalid, 5599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1728 Valid, 3871 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 15:33:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14075 states. [2025-03-16 15:33:14,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14075 to 14075. [2025-03-16 15:33:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14075 states, 14074 states have (on average 1.271706693193122) internal successors, (17898), 14074 states have internal predecessors, (17898), 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 15:33:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14075 states to 14075 states and 17898 transitions. [2025-03-16 15:33:14,239 INFO L78 Accepts]: Start accepts. Automaton has 14075 states and 17898 transitions. Word has length 608 [2025-03-16 15:33:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:14,240 INFO L471 AbstractCegarLoop]: Abstraction has 14075 states and 17898 transitions. [2025-03-16 15:33:14,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 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 15:33:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 14075 states and 17898 transitions. [2025-03-16 15:33:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2025-03-16 15:33:14,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:14,249 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:33:14,258 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 15:33:14,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:33:14,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:14,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2029429091, now seen corresponding path program 1 times [2025-03-16 15:33:14,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:14,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875174479] [2025-03-16 15:33:14,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:14,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:14,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes. [2025-03-16 15:33:14,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements. [2025-03-16 15:33:14,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:14,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-16 15:33:15,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:15,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875174479] [2025-03-16 15:33:15,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875174479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:15,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:15,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:33:15,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336959775] [2025-03-16 15:33:15,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:15,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:15,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:15,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:15,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:15,187 INFO L87 Difference]: Start difference. First operand 14075 states and 17898 transitions. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 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 15:33:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:20,243 INFO L93 Difference]: Finished difference Result 36508 states and 47895 transitions. [2025-03-16 15:33:20,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:20,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 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 610 [2025-03-16 15:33:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:20,287 INFO L225 Difference]: With dead ends: 36508 [2025-03-16 15:33:20,288 INFO L226 Difference]: Without dead ends: 25164 [2025-03-16 15:33:20,298 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 15:33:20,300 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 2111 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5097 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 5531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:20,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 966 Invalid, 5531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5097 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-16 15:33:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25164 states. [2025-03-16 15:33:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25164 to 23796. [2025-03-16 15:33:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23796 states, 23795 states have (on average 1.2691321706240808) internal successors, (30199), 23795 states have internal predecessors, (30199), 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 15:33:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23796 states to 23796 states and 30199 transitions. [2025-03-16 15:33:20,565 INFO L78 Accepts]: Start accepts. Automaton has 23796 states and 30199 transitions. Word has length 610 [2025-03-16 15:33:20,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:20,566 INFO L471 AbstractCegarLoop]: Abstraction has 23796 states and 30199 transitions. [2025-03-16 15:33:20,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 2 states have internal predecessors, (545), 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 15:33:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 23796 states and 30199 transitions. [2025-03-16 15:33:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-16 15:33:20,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:20,577 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:33:20,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:33:20,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:20,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:20,579 INFO L85 PathProgramCache]: Analyzing trace with hash -636358518, now seen corresponding path program 1 times [2025-03-16 15:33:20,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:20,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104084822] [2025-03-16 15:33:20,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:20,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:20,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-16 15:33:20,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-16 15:33:20,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:20,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-16 15:33:20,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:20,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104084822] [2025-03-16 15:33:20,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104084822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:20,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:20,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:33:20,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072153186] [2025-03-16 15:33:20,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:20,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:20,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:20,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:20,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:20,945 INFO L87 Difference]: Start difference. First operand 23796 states and 30199 transitions. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 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 15:33:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:25,581 INFO L93 Difference]: Finished difference Result 50351 states and 65558 transitions. [2025-03-16 15:33:25,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:25,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 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 693 [2025-03-16 15:33:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:25,629 INFO L225 Difference]: With dead ends: 50351 [2025-03-16 15:33:25,629 INFO L226 Difference]: Without dead ends: 29286 [2025-03-16 15:33:25,648 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 15:33:25,649 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 1376 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 3925 mSolverCounterSat, 2127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 6052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2127 IncrementalHoareTripleChecker+Valid, 3925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:25,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 724 Invalid, 6052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2127 Valid, 3925 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 15:33:25,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29286 states. [2025-03-16 15:33:25,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29286 to 29271. [2025-03-16 15:33:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29271 states, 29270 states have (on average 1.2570550051247011) internal successors, (36794), 29270 states have internal predecessors, (36794), 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 15:33:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29271 states to 29271 states and 36794 transitions. [2025-03-16 15:33:25,968 INFO L78 Accepts]: Start accepts. Automaton has 29271 states and 36794 transitions. Word has length 693 [2025-03-16 15:33:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:25,969 INFO L471 AbstractCegarLoop]: Abstraction has 29271 states and 36794 transitions. [2025-03-16 15:33:25,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 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 15:33:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 29271 states and 36794 transitions. [2025-03-16 15:33:25,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2025-03-16 15:33:25,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:25,974 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:33:25,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:33:25,974 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:25,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:25,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1612119634, now seen corresponding path program 1 times [2025-03-16 15:33:25,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:25,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239382251] [2025-03-16 15:33:25,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:25,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:26,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 760 statements into 1 equivalence classes. [2025-03-16 15:33:26,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 760 of 760 statements. [2025-03-16 15:33:26,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:26,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 105 proven. 37 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-16 15:33:27,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:27,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239382251] [2025-03-16 15:33:27,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239382251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:33:27,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842726818] [2025-03-16 15:33:27,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:27,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:33:27,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:33:27,074 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 15:33:27,075 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 15:33:27,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 760 statements into 1 equivalence classes. [2025-03-16 15:33:27,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 760 of 760 statements. [2025-03-16 15:33:27,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:27,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:27,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:33:27,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:33:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-16 15:33:27,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:33:27,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842726818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:27,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:33:27,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 15:33:27,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494834792] [2025-03-16 15:33:27,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:27,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:27,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:27,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:27,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:33:27,505 INFO L87 Difference]: Start difference. First operand 29271 states and 36794 transitions. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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 15:33:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:32,822 INFO L93 Difference]: Finished difference Result 81846 states and 104290 transitions. [2025-03-16 15:33:32,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:32,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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 760 [2025-03-16 15:33:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:32,891 INFO L225 Difference]: With dead ends: 81846 [2025-03-16 15:33:32,892 INFO L226 Difference]: Without dead ends: 55306 [2025-03-16 15:33:32,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:33:32,917 INFO L435 NwaCegarLoop]: 3187 mSDtfsCounter, 1416 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 5079 mSolverCounterSat, 983 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 3357 SdHoareTripleChecker+Invalid, 6062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 983 IncrementalHoareTripleChecker+Valid, 5079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:32,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 3357 Invalid, 6062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [983 Valid, 5079 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-16 15:33:32,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55306 states. [2025-03-16 15:33:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55306 to 53873. [2025-03-16 15:33:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53873 states, 53872 states have (on average 1.192864567864568) internal successors, (64262), 53872 states have internal predecessors, (64262), 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 15:33:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53873 states to 53873 states and 64262 transitions. [2025-03-16 15:33:33,442 INFO L78 Accepts]: Start accepts. Automaton has 53873 states and 64262 transitions. Word has length 760 [2025-03-16 15:33:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:33,444 INFO L471 AbstractCegarLoop]: Abstraction has 53873 states and 64262 transitions. [2025-03-16 15:33:33,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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 15:33:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 53873 states and 64262 transitions. [2025-03-16 15:33:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 906 [2025-03-16 15:33:33,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:33,451 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:33:33,458 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 15:33:33,651 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,SelfDestructingSolverStorable7 [2025-03-16 15:33:33,652 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:33,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:33,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1017366055, now seen corresponding path program 1 times [2025-03-16 15:33:33,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:33,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095185423] [2025-03-16 15:33:33,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:33,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 905 statements into 1 equivalence classes. [2025-03-16 15:33:33,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 905 of 905 statements. [2025-03-16 15:33:33,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:33,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 521 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-03-16 15:33:34,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:34,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095185423] [2025-03-16 15:33:34,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095185423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:34,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:34,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:33:34,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953348772] [2025-03-16 15:33:34,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:34,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:33:34,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:34,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:33:34,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:33:34,136 INFO L87 Difference]: Start difference. First operand 53873 states and 64262 transitions. Second operand has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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 15:33:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:42,918 INFO L93 Difference]: Finished difference Result 177539 states and 216083 transitions. [2025-03-16 15:33:42,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:33:42,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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 905 [2025-03-16 15:33:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:43,072 INFO L225 Difference]: With dead ends: 177539 [2025-03-16 15:33:43,072 INFO L226 Difference]: Without dead ends: 126397 [2025-03-16 15:33:43,109 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 15:33:43,110 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 3246 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 8980 mSolverCounterSat, 2803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3246 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 11783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2803 IncrementalHoareTripleChecker+Valid, 8980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:43,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3246 Valid, 1245 Invalid, 11783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2803 Valid, 8980 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2025-03-16 15:33:43,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126397 states. [2025-03-16 15:33:44,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126397 to 124932. [2025-03-16 15:33:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124932 states, 124931 states have (on average 1.1720629787642778) internal successors, (146427), 124931 states have internal predecessors, (146427), 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 15:33:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124932 states to 124932 states and 146427 transitions. [2025-03-16 15:33:44,528 INFO L78 Accepts]: Start accepts. Automaton has 124932 states and 146427 transitions. Word has length 905 [2025-03-16 15:33:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:44,529 INFO L471 AbstractCegarLoop]: Abstraction has 124932 states and 146427 transitions. [2025-03-16 15:33:44,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 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 15:33:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 124932 states and 146427 transitions. [2025-03-16 15:33:44,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2025-03-16 15:33:44,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:44,543 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:33:44,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:33:44,543 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:44,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:44,544 INFO L85 PathProgramCache]: Analyzing trace with hash 8389757, now seen corresponding path program 1 times [2025-03-16 15:33:44,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:44,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046502530] [2025-03-16 15:33:44,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:44,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:44,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 914 statements into 1 equivalence classes. [2025-03-16 15:33:44,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 914 of 914 statements. [2025-03-16 15:33:44,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:44,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 341 proven. 366 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-16 15:33:45,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:45,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046502530] [2025-03-16 15:33:45,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046502530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:33:45,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194528992] [2025-03-16 15:33:45,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:45,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:33:45,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:33:45,874 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 15:33:45,876 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 15:33:45,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 914 statements into 1 equivalence classes. [2025-03-16 15:33:46,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 914 of 914 statements. [2025-03-16 15:33:46,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:46,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:46,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 1074 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:33:46,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:33:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-16 15:33:46,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:33:46,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194528992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:46,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:33:46,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 15:33:46,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294163067] [2025-03-16 15:33:46,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:46,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:46,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:46,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:46,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:33:46,321 INFO L87 Difference]: Start difference. First operand 124932 states and 146427 transitions. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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 15:33:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:51,608 INFO L93 Difference]: Finished difference Result 305933 states and 364072 transitions. [2025-03-16 15:33:51,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:51,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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 914 [2025-03-16 15:33:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:51,816 INFO L225 Difference]: With dead ends: 305933 [2025-03-16 15:33:51,816 INFO L226 Difference]: Without dead ends: 183732 [2025-03-16 15:33:51,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 916 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:33:51,883 INFO L435 NwaCegarLoop]: 1398 mSDtfsCounter, 1526 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4211 mSolverCounterSat, 1686 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 5897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1686 IncrementalHoareTripleChecker+Valid, 4211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:51,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1522 Invalid, 5897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1686 Valid, 4211 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:33:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183732 states. [2025-03-16 15:33:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183732 to 179539. [2025-03-16 15:33:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179539 states, 179538 states have (on average 1.1751161314039367) internal successors, (210978), 179538 states have internal predecessors, (210978), 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 15:33:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179539 states to 179539 states and 210978 transitions. [2025-03-16 15:33:54,537 INFO L78 Accepts]: Start accepts. Automaton has 179539 states and 210978 transitions. Word has length 914 [2025-03-16 15:33:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:54,538 INFO L471 AbstractCegarLoop]: Abstraction has 179539 states and 210978 transitions. [2025-03-16 15:33:54,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 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 15:33:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 179539 states and 210978 transitions. [2025-03-16 15:33:54,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2025-03-16 15:33:54,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:54,549 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:33:54,556 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 15:33:54,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:33:54,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:54,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:54,751 INFO L85 PathProgramCache]: Analyzing trace with hash -418658033, now seen corresponding path program 1 times [2025-03-16 15:33:54,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:54,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254085030] [2025-03-16 15:33:54,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:54,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:54,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 963 statements into 1 equivalence classes. [2025-03-16 15:33:54,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 963 of 963 statements. [2025-03-16 15:33:54,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:54,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-16 15:33:55,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:55,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254085030] [2025-03-16 15:33:55,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254085030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:55,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:55,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:33:55,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283002982] [2025-03-16 15:33:55,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:55,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:55,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:55,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:55,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:55,306 INFO L87 Difference]: Start difference. First operand 179539 states and 210978 transitions. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 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)