./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_label03.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 26e05216e875976d2a927f5405c2e5bc5a3ea5afc4bbe64c3ca3f67a96ae3961 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:18:55,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:18:55,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:18:55,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:18:55,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:18:55,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:18:55,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:18:55,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:18:55,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:18:55,299 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:18:55,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:18:55,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:18:55,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:18:55,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:18:55,300 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:18:55,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:18:55,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:18:55,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:18:55,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:18:55,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:18:55,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:18:55,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:18:55,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:18:55,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:18:55,302 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:18:55,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:18:55,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:18:55,302 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:18:55,302 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:18:55,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:18:55,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:18:55,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:18:55,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:18:55,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:18:55,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:18:55,303 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:18:55,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:18:55,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:18:55,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:18:55,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:18:55,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:18:55,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:18:55,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:18:55,304 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 -> 26e05216e875976d2a927f5405c2e5bc5a3ea5afc4bbe64c3ca3f67a96ae3961 [2025-03-08 02:18:55,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:18:55,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:18:55,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:18:55,602 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:18:55,602 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:18:55,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label03.c [2025-03-08 02:18:56,805 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a804e9a/2e4239c0cc0a47b385bd3327b6c39e32/FLAG81c534fe6 [2025-03-08 02:18:57,324 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:18:57,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label03.c [2025-03-08 02:18:57,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a804e9a/2e4239c0cc0a47b385bd3327b6c39e32/FLAG81c534fe6 [2025-03-08 02:18:57,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a804e9a/2e4239c0cc0a47b385bd3327b6c39e32 [2025-03-08 02:18:57,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:18:57,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:18:57,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:18:57,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:18:57,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:18:57,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:18:57" (1/1) ... [2025-03-08 02:18:57,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7885d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:57, skipping insertion in model container [2025-03-08 02:18:57,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:18:57" (1/1) ... [2025-03-08 02:18:57,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:18:57,791 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_label03.c[7444,7457] [2025-03-08 02:18:58,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:18:58,629 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:18:58,646 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_label03.c[7444,7457] [2025-03-08 02:18:59,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:18:59,128 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:18:59,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:59 WrapperNode [2025-03-08 02:18:59,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:18:59,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:18:59,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:18:59,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:18:59,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:59" (1/1) ... [2025-03-08 02:18:59,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:59" (1/1) ... [2025-03-08 02:18:59,780 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-08 02:18:59,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:18:59,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:18:59,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:18:59,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:18:59,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:59" (1/1) ... [2025-03-08 02:18:59,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:59" (1/1) ... [2025-03-08 02:19:00,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:59" (1/1) ... [2025-03-08 02:19:00,302 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-08 02:19:00,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:59" (1/1) ... [2025-03-08 02:19:00,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:59" (1/1) ... [2025-03-08 02:19:00,592 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:59" (1/1) ... [2025-03-08 02:19:00,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:59" (1/1) ... [2025-03-08 02:19:00,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:59" (1/1) ... [2025-03-08 02:19:00,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:59" (1/1) ... [2025-03-08 02:19:00,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:19:00,746 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:19:00,746 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:19:00,746 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:19:00,747 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:59" (1/1) ... [2025-03-08 02:19:00,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:19:00,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:19:00,771 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-08 02:19:00,777 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-08 02:19:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:19:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:19:00,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:19:00,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:19:00,850 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:19:00,851 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:19:07,201 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-08 02:19:07,202 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-08 02:19:07,202 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-08 02:19:07,203 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-08 02:19:07,203 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-08 02:19:07,433 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-08 02:19:07,433 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:19:07,473 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:19:07,476 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:19:07,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:19:07 BoogieIcfgContainer [2025-03-08 02:19:07,477 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:19:07,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:19:07,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:19:07,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:19:07,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:18:57" (1/3) ... [2025-03-08 02:19:07,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f18c0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:19:07, skipping insertion in model container [2025-03-08 02:19:07,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:59" (2/3) ... [2025-03-08 02:19:07,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f18c0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:19:07, skipping insertion in model container [2025-03-08 02:19:07,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:19:07" (3/3) ... [2025-03-08 02:19:07,484 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label03.c [2025-03-08 02:19:07,495 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:19:07,497 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label03.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:19:07,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:19:07,586 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;@51c76799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:19:07,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:19:07,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 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-08 02:19:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 02:19:07,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:19:07,598 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, 1, 1, 1] [2025-03-08 02:19:07,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:19:07,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:19:07,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1766026996, now seen corresponding path program 1 times [2025-03-08 02:19:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:19:07,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251474271] [2025-03-08 02:19:07,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:19:07,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 02:19:07,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 02:19:07,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:07,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:08,055 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-08 02:19:08,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:19:08,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251474271] [2025-03-08 02:19:08,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251474271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:19:08,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:19:08,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:19:08,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055844244] [2025-03-08 02:19:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:19:08,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:19:08,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:19:08,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:19:08,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:19:08,083 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 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 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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-08 02:19:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:19:18,229 INFO L93 Difference]: Finished difference Result 6284 states and 12035 transitions. [2025-03-08 02:19:18,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:19:18,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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 57 [2025-03-08 02:19:18,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:19:18,261 INFO L225 Difference]: With dead ends: 6284 [2025-03-08 02:19:18,262 INFO L226 Difference]: Without dead ends: 4467 [2025-03-08 02:19:18,270 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-08 02:19:18,272 INFO L435 NwaCegarLoop]: 1815 mSDtfsCounter, 4227 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 10828 mSolverCounterSat, 2355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4227 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 13183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2355 IncrementalHoareTripleChecker+Valid, 10828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:19:18,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4227 Valid, 2096 Invalid, 13183 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2355 Valid, 10828 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2025-03-08 02:19:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2025-03-08 02:19:18,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 4465. [2025-03-08 02:19:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4465 states, 4464 states have (on average 1.564516129032258) internal successors, (6984), 4464 states have internal predecessors, (6984), 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-08 02:19:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 6984 transitions. [2025-03-08 02:19:18,416 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 6984 transitions. Word has length 57 [2025-03-08 02:19:18,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:19:18,417 INFO L471 AbstractCegarLoop]: Abstraction has 4465 states and 6984 transitions. [2025-03-08 02:19:18,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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-08 02:19:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 6984 transitions. [2025-03-08 02:19:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-08 02:19:18,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:19:18,423 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:19:18,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:19:18,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:19:18,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:19:18,426 INFO L85 PathProgramCache]: Analyzing trace with hash -754510370, now seen corresponding path program 1 times [2025-03-08 02:19:18,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:19:18,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861073360] [2025-03-08 02:19:18,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:18,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:19:18,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-08 02:19:18,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-08 02:19:18,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:18,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:19,258 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:19:19,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:19:19,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861073360] [2025-03-08 02:19:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861073360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:19:19,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:19:19,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:19:19,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403257047] [2025-03-08 02:19:19,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:19:19,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:19:19,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:19:19,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:19:19,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:19:19,263 INFO L87 Difference]: Start difference. First operand 4465 states and 6984 transitions. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 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-08 02:19:26,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:19:26,560 INFO L93 Difference]: Finished difference Result 11708 states and 20176 transitions. [2025-03-08 02:19:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:19:26,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 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 264 [2025-03-08 02:19:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:19:26,585 INFO L225 Difference]: With dead ends: 11708 [2025-03-08 02:19:26,585 INFO L226 Difference]: Without dead ends: 8610 [2025-03-08 02:19:26,590 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-08 02:19:26,591 INFO L435 NwaCegarLoop]: 1805 mSDtfsCounter, 3758 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9457 mSolverCounterSat, 1336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3758 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 10793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1336 IncrementalHoareTripleChecker+Valid, 9457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:19:26,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3758 Valid, 2161 Invalid, 10793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1336 Valid, 9457 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-03-08 02:19:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8610 states. [2025-03-08 02:19:26,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8610 to 8594. [2025-03-08 02:19:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8594 states, 8593 states have (on average 1.3481903875247294) internal successors, (11585), 8593 states have internal predecessors, (11585), 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-08 02:19:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8594 states to 8594 states and 11585 transitions. [2025-03-08 02:19:26,719 INFO L78 Accepts]: Start accepts. Automaton has 8594 states and 11585 transitions. Word has length 264 [2025-03-08 02:19:26,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:19:26,722 INFO L471 AbstractCegarLoop]: Abstraction has 8594 states and 11585 transitions. [2025-03-08 02:19:26,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 3 states have internal predecessors, (264), 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-08 02:19:26,723 INFO L276 IsEmpty]: Start isEmpty. Operand 8594 states and 11585 transitions. [2025-03-08 02:19:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-08 02:19:26,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:19:26,731 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:19:26,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:19:26,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:19:26,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:19:26,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2041332724, now seen corresponding path program 1 times [2025-03-08 02:19:26,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:19:26,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675760891] [2025-03-08 02:19:26,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:26,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:19:26,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-08 02:19:26,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-08 02:19:26,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:26,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:19:27,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:19:27,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675760891] [2025-03-08 02:19:27,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675760891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:19:27,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:19:27,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:19:27,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500452917] [2025-03-08 02:19:27,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:19:27,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:19:27,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:19:27,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:19:27,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:19:27,260 INFO L87 Difference]: Start difference. First operand 8594 states and 11585 transitions. Second operand has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:32,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:19:32,137 INFO L93 Difference]: Finished difference Result 14487 states and 20451 transitions. [2025-03-08 02:19:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:19:32,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 292 [2025-03-08 02:19:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:19:32,155 INFO L225 Difference]: With dead ends: 14487 [2025-03-08 02:19:32,155 INFO L226 Difference]: Without dead ends: 8594 [2025-03-08 02:19:32,158 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-08 02:19:32,161 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7325 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 7333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:19:32,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2117 Invalid, 7333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7325 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 02:19:32,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8594 states. [2025-03-08 02:19:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8594 to 8594. [2025-03-08 02:19:32,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8594 states, 8593 states have (on average 1.3466775282206447) internal successors, (11572), 8593 states have internal predecessors, (11572), 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-08 02:19:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8594 states to 8594 states and 11572 transitions. [2025-03-08 02:19:32,261 INFO L78 Accepts]: Start accepts. Automaton has 8594 states and 11572 transitions. Word has length 292 [2025-03-08 02:19:32,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:19:32,261 INFO L471 AbstractCegarLoop]: Abstraction has 8594 states and 11572 transitions. [2025-03-08 02:19:32,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.0) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:19:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 8594 states and 11572 transitions. [2025-03-08 02:19:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2025-03-08 02:19:32,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:19:32,270 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, 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] [2025-03-08 02:19:32,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:19:32,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:19:32,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:19:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash 345170514, now seen corresponding path program 1 times [2025-03-08 02:19:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:19:32,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731031041] [2025-03-08 02:19:32,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:32,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:19:32,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-03-08 02:19:32,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-03-08 02:19:32,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:32,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 109 proven. 43 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 02:19:32,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:19:32,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731031041] [2025-03-08 02:19:32,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731031041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:19:32,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451931415] [2025-03-08 02:19:32,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:32,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:19:32,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:19:32,949 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-08 02:19:32,951 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-08 02:19:33,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-03-08 02:19:33,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-03-08 02:19:33,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:33,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:33,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:19:33,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:19:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:19:33,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:19:33,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451931415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:19:33,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:19:33,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 02:19:33,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4902081] [2025-03-08 02:19:33,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:19:33,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:19:33,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:19:33,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:19:33,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:19:33,250 INFO L87 Difference]: Start difference. First operand 8594 states and 11572 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-08 02:19:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:19:37,577 INFO L93 Difference]: Finished difference Result 19934 states and 28696 transitions. [2025-03-08 02:19:37,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:19:37,578 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 613 [2025-03-08 02:19:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:19:37,608 INFO L225 Difference]: With dead ends: 19934 [2025-03-08 02:19:37,608 INFO L226 Difference]: Without dead ends: 14072 [2025-03-08 02:19:37,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 612 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-08 02:19:37,617 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 1775 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 3854 mSolverCounterSat, 1728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 5582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1728 IncrementalHoareTripleChecker+Valid, 3854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:19:37,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 1445 Invalid, 5582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1728 Valid, 3854 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 02:19:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14072 states. [2025-03-08 02:19:37,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14072 to 14072. [2025-03-08 02:19:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14072 states, 14071 states have (on average 1.2692772368701586) internal successors, (17860), 14071 states have internal predecessors, (17860), 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-08 02:19:37,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14072 states to 14072 states and 17860 transitions. [2025-03-08 02:19:37,810 INFO L78 Accepts]: Start accepts. Automaton has 14072 states and 17860 transitions. Word has length 613 [2025-03-08 02:19:37,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:19:37,811 INFO L471 AbstractCegarLoop]: Abstraction has 14072 states and 17860 transitions. [2025-03-08 02:19:37,812 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-08 02:19:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 14072 states and 17860 transitions. [2025-03-08 02:19:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2025-03-08 02:19:37,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:19:37,825 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:19:37,840 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-08 02:19:38,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:19:38,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:19:38,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:19:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1220442606, now seen corresponding path program 1 times [2025-03-08 02:19:38,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:19:38,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256072686] [2025-03-08 02:19:38,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:19:38,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes. [2025-03-08 02:19:38,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements. [2025-03-08 02:19:38,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:38,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:19:38,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:19:38,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256072686] [2025-03-08 02:19:38,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256072686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:19:38,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:19:38,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:19:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170258290] [2025-03-08 02:19:38,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:19:38,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:19:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:19:38,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:19:38,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:19:38,447 INFO L87 Difference]: Start difference. First operand 14072 states and 17860 transitions. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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-08 02:19:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:19:42,839 INFO L93 Difference]: Finished difference Result 30942 states and 41599 transitions. [2025-03-08 02:19:42,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:19:42,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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 618 [2025-03-08 02:19:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:19:42,872 INFO L225 Difference]: With dead ends: 30942 [2025-03-08 02:19:42,872 INFO L226 Difference]: Without dead ends: 19602 [2025-03-08 02:19:42,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:19:42,887 INFO L435 NwaCegarLoop]: 2993 mSDtfsCounter, 1421 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 4130 mSolverCounterSat, 1663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 3163 SdHoareTripleChecker+Invalid, 5793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1663 IncrementalHoareTripleChecker+Valid, 4130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:19:42,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 3163 Invalid, 5793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1663 Valid, 4130 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 02:19:42,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19602 states. [2025-03-08 02:19:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19602 to 19562. [2025-03-08 02:19:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19562 states, 19561 states have (on average 1.2532079137058432) internal successors, (24514), 19561 states have internal predecessors, (24514), 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-08 02:19:43,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19562 states to 19562 states and 24514 transitions. [2025-03-08 02:19:43,146 INFO L78 Accepts]: Start accepts. Automaton has 19562 states and 24514 transitions. Word has length 618 [2025-03-08 02:19:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:19:43,147 INFO L471 AbstractCegarLoop]: Abstraction has 19562 states and 24514 transitions. [2025-03-08 02:19:43,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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-08 02:19:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 19562 states and 24514 transitions. [2025-03-08 02:19:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2025-03-08 02:19:43,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:19:43,153 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:19:43,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:19:43,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:19:43,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:19:43,154 INFO L85 PathProgramCache]: Analyzing trace with hash 161662950, now seen corresponding path program 1 times [2025-03-08 02:19:43,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:19:43,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286832701] [2025-03-08 02:19:43,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:43,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:19:43,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 621 statements into 1 equivalence classes. [2025-03-08 02:19:43,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 621 of 621 statements. [2025-03-08 02:19:43,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:43,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 02:19:43,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:19:43,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286832701] [2025-03-08 02:19:43,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286832701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:19:43,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:19:43,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:19:43,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806743235] [2025-03-08 02:19:43,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:19:43,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:19:43,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:19:43,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:19:43,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:19:43,501 INFO L87 Difference]: Start difference. First operand 19562 states and 24514 transitions. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 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-08 02:19:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:19:48,301 INFO L93 Difference]: Finished difference Result 51591 states and 66287 transitions. [2025-03-08 02:19:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:19:48,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 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 621 [2025-03-08 02:19:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:19:48,361 INFO L225 Difference]: With dead ends: 51591 [2025-03-08 02:19:48,361 INFO L226 Difference]: Without dead ends: 34761 [2025-03-08 02:19:48,373 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-08 02:19:48,374 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 2111 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 5097 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 964 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.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:19:48,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 964 Invalid, 5531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5097 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-08 02:19:48,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34761 states. [2025-03-08 02:19:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34761 to 33393. [2025-03-08 02:19:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33393 states, 33392 states have (on average 1.2489817920459991) internal successors, (41706), 33392 states have internal predecessors, (41706), 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-08 02:19:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33393 states to 33393 states and 41706 transitions. [2025-03-08 02:19:48,710 INFO L78 Accepts]: Start accepts. Automaton has 33393 states and 41706 transitions. Word has length 621 [2025-03-08 02:19:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:19:48,711 INFO L471 AbstractCegarLoop]: Abstraction has 33393 states and 41706 transitions. [2025-03-08 02:19:48,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 2 states have internal predecessors, (546), 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-08 02:19:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 33393 states and 41706 transitions. [2025-03-08 02:19:48,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-03-08 02:19:48,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:19:48,717 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 02:19:48,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:19:48,717 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:19:48,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:19:48,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1777816220, now seen corresponding path program 1 times [2025-03-08 02:19:48,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:19:48,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165499013] [2025-03-08 02:19:48,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:48,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:19:48,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 850 statements into 1 equivalence classes. [2025-03-08 02:19:48,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 850 of 850 statements. [2025-03-08 02:19:48,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:48,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 113 proven. 51 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-08 02:19:49,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:19:49,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165499013] [2025-03-08 02:19:49,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165499013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:19:49,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212014142] [2025-03-08 02:19:49,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:49,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:19:49,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:19:49,388 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-08 02:19:49,389 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-08 02:19:49,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 850 statements into 1 equivalence classes. [2025-03-08 02:19:49,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 850 of 850 statements. [2025-03-08 02:19:49,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:49,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:49,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:19:49,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:19:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-08 02:19:49,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:19:49,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212014142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:19:49,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:19:49,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 02:19:49,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498404309] [2025-03-08 02:19:49,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:19:49,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:19:49,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:19:49,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:19:49,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:19:49,654 INFO L87 Difference]: Start difference. First operand 33393 states and 41706 transitions. Second operand has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 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-08 02:19:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:19:54,129 INFO L93 Difference]: Finished difference Result 83267 states and 106039 transitions. [2025-03-08 02:19:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:19:54,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 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 850 [2025-03-08 02:19:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:19:54,193 INFO L225 Difference]: With dead ends: 83267 [2025-03-08 02:19:54,193 INFO L226 Difference]: Without dead ends: 52606 [2025-03-08 02:19:54,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 849 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:19:54,224 INFO L435 NwaCegarLoop]: 1102 mSDtfsCounter, 1582 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4164 mSolverCounterSat, 1906 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1582 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 6070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1906 IncrementalHoareTripleChecker+Valid, 4164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:19:54,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1582 Valid, 1228 Invalid, 6070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1906 Valid, 4164 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 02:19:54,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52606 states. [2025-03-08 02:19:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52606 to 51141. [2025-03-08 02:19:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51141 states, 51140 states have (on average 1.2361165428236214) internal successors, (63215), 51140 states have internal predecessors, (63215), 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-08 02:19:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51141 states to 51141 states and 63215 transitions. [2025-03-08 02:19:54,758 INFO L78 Accepts]: Start accepts. Automaton has 51141 states and 63215 transitions. Word has length 850 [2025-03-08 02:19:54,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:19:54,758 INFO L471 AbstractCegarLoop]: Abstraction has 51141 states and 63215 transitions. [2025-03-08 02:19:54,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 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-08 02:19:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 51141 states and 63215 transitions. [2025-03-08 02:19:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2025-03-08 02:19:54,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:19:54,765 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:19:54,772 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-08 02:19:54,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 02:19:54,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:19:54,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:19:54,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1954315903, now seen corresponding path program 1 times [2025-03-08 02:19:54,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:19:54,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938678737] [2025-03-08 02:19:54,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:19:54,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:19:55,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 874 statements into 1 equivalence classes. [2025-03-08 02:19:55,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 874 of 874 statements. [2025-03-08 02:19:55,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:19:55,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:19:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-08 02:19:55,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:19:55,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938678737] [2025-03-08 02:19:55,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938678737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:19:55,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:19:55,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:19:55,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839029344] [2025-03-08 02:19:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:19:55,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:19:55,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:19:55,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:19:55,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:19:55,314 INFO L87 Difference]: Start difference. First operand 51141 states and 63215 transitions. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 2 states have internal predecessors, (589), 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-08 02:19:59,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:19:59,691 INFO L93 Difference]: Finished difference Result 115951 states and 144850 transitions. [2025-03-08 02:19:59,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:19:59,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 2 states have internal predecessors, (589), 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 874 [2025-03-08 02:19:59,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:19:59,785 INFO L225 Difference]: With dead ends: 115951 [2025-03-08 02:19:59,786 INFO L226 Difference]: Without dead ends: 67542 [2025-03-08 02:19:59,818 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-08 02:19:59,818 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 1354 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 3932 mSolverCounterSat, 2063 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 5995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2063 IncrementalHoareTripleChecker+Valid, 3932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:19:59,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 799 Invalid, 5995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2063 Valid, 3932 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-08 02:19:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67542 states. [2025-03-08 02:20:00,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67542 to 67527. [2025-03-08 02:20:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67527 states, 67526 states have (on average 1.2145988211947991) internal successors, (82017), 67526 states have internal predecessors, (82017), 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-08 02:20:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67527 states to 67527 states and 82017 transitions. [2025-03-08 02:20:00,472 INFO L78 Accepts]: Start accepts. Automaton has 67527 states and 82017 transitions. Word has length 874 [2025-03-08 02:20:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:20:00,473 INFO L471 AbstractCegarLoop]: Abstraction has 67527 states and 82017 transitions. [2025-03-08 02:20:00,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 2 states have internal predecessors, (589), 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-08 02:20:00,473 INFO L276 IsEmpty]: Start isEmpty. Operand 67527 states and 82017 transitions. [2025-03-08 02:20:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 917 [2025-03-08 02:20:00,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:00,481 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:20:00,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:20:00,481 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:00,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:00,482 INFO L85 PathProgramCache]: Analyzing trace with hash 2004471920, now seen corresponding path program 1 times [2025-03-08 02:20:00,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:00,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322187858] [2025-03-08 02:20:00,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:00,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:00,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 916 statements into 1 equivalence classes. [2025-03-08 02:20:00,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 916 of 916 statements. [2025-03-08 02:20:00,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:00,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:20:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-08 02:20:01,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:20:01,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322187858] [2025-03-08 02:20:01,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322187858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:20:01,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:20:01,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:20:01,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696433475] [2025-03-08 02:20:01,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:20:01,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:20:01,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:20:01,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:20:01,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:20:01,653 INFO L87 Difference]: Start difference. First operand 67527 states and 82017 transitions. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-08 02:20:06,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:20:06,517 INFO L93 Difference]: Finished difference Result 158350 states and 194646 transitions. [2025-03-08 02:20:06,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:20:06,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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 916 [2025-03-08 02:20:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:20:06,612 INFO L225 Difference]: With dead ends: 158350 [2025-03-08 02:20:06,612 INFO L226 Difference]: Without dead ends: 93555 [2025-03-08 02:20:06,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-08 02:20:06,656 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 1576 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4233 mSolverCounterSat, 2309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1576 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 6542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2309 IncrementalHoareTripleChecker+Valid, 4233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:20:06,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1576 Valid, 625 Invalid, 6542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2309 Valid, 4233 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 02:20:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93555 states. [2025-03-08 02:20:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93555 to 88006. [2025-03-08 02:20:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88006 states, 88005 states have (on average 1.2410203965683768) internal successors, (109216), 88005 states have internal predecessors, (109216), 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-08 02:20:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88006 states to 88006 states and 109216 transitions. [2025-03-08 02:20:07,488 INFO L78 Accepts]: Start accepts. Automaton has 88006 states and 109216 transitions. Word has length 916 [2025-03-08 02:20:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:20:07,488 INFO L471 AbstractCegarLoop]: Abstraction has 88006 states and 109216 transitions. [2025-03-08 02:20:07,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-08 02:20:07,489 INFO L276 IsEmpty]: Start isEmpty. Operand 88006 states and 109216 transitions. [2025-03-08 02:20:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2025-03-08 02:20:07,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:07,497 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:20:07,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:20:07,497 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:07,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:07,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1893054791, now seen corresponding path program 1 times [2025-03-08 02:20:07,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:07,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95832745] [2025-03-08 02:20:07,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:07,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:07,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 983 statements into 1 equivalence classes. [2025-03-08 02:20:07,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 983 of 983 statements. [2025-03-08 02:20:07,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:07,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:20:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 701 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 02:20:08,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:20:08,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95832745] [2025-03-08 02:20:08,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95832745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:20:08,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:20:08,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:20:08,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390651106] [2025-03-08 02:20:08,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:20:08,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:20:08,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:20:08,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:20:08,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:20:08,037 INFO L87 Difference]: Start difference. First operand 88006 states and 109216 transitions. Second operand has 4 states, 4 states have (on average 180.25) internal successors, (721), 4 states have internal predecessors, (721), 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-08 02:20:16,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:20:16,374 INFO L93 Difference]: Finished difference Result 301760 states and 382658 transitions. [2025-03-08 02:20:16,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:20:16,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 180.25) internal successors, (721), 4 states have internal predecessors, (721), 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 983 [2025-03-08 02:20:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:20:16,634 INFO L225 Difference]: With dead ends: 301760 [2025-03-08 02:20:16,634 INFO L226 Difference]: Without dead ends: 216486 [2025-03-08 02:20:16,700 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-08 02:20:16,701 INFO L435 NwaCegarLoop]: 1062 mSDtfsCounter, 3399 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 8484 mSolverCounterSat, 2957 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3399 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 11441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2957 IncrementalHoareTripleChecker+Valid, 8484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:20:16,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3399 Valid, 1322 Invalid, 11441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2957 Valid, 8484 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-03-08 02:20:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216486 states. [2025-03-08 02:20:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216486 to 213656. [2025-03-08 02:20:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213656 states, 213655 states have (on average 1.208747747536917) internal successors, (258255), 213655 states have internal predecessors, (258255), 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-08 02:20:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213656 states to 213656 states and 258255 transitions. [2025-03-08 02:20:19,053 INFO L78 Accepts]: Start accepts. Automaton has 213656 states and 258255 transitions. Word has length 983 [2025-03-08 02:20:19,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:20:19,053 INFO L471 AbstractCegarLoop]: Abstraction has 213656 states and 258255 transitions. [2025-03-08 02:20:19,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 180.25) internal successors, (721), 4 states have internal predecessors, (721), 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-08 02:20:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 213656 states and 258255 transitions. [2025-03-08 02:20:19,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 993 [2025-03-08 02:20:19,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:20:19,061 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:20:19,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:20:19,061 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:20:19,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:20:19,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2017390381, now seen corresponding path program 1 times [2025-03-08 02:20:19,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:20:19,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544500635] [2025-03-08 02:20:19,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:20:19,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:20:19,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 992 statements into 1 equivalence classes. [2025-03-08 02:20:19,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 992 of 992 statements. [2025-03-08 02:20:19,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:20:19,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat