./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label02.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 30f62f9fddfecd916215dd8f1b75b140359bb989ba38a829add2eea4e4b271dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:49:54,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:49:54,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:49:54,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:49:54,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:49:54,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:49:54,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:49:54,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:49:54,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:49:54,355 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:49:54,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:49:54,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:49:54,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:49:54,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:49:54,356 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:49:54,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:49:54,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:49:54,357 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:49:54,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:49:54,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:49:54,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:49:54,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:49:54,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:49:54,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:49:54,358 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:49:54,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:49:54,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:49:54,358 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 -> 30f62f9fddfecd916215dd8f1b75b140359bb989ba38a829add2eea4e4b271dc [2025-03-16 14:49:54,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:49:54,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:49:54,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:49:54,575 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:49:54,575 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:49:54,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label02.c [2025-03-16 14:49:55,743 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c768619/c402ef0028d1439f9191cbbf6484b915/FLAG8ea01c5d8 [2025-03-16 14:49:56,048 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:49:56,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label02.c [2025-03-16 14:49:56,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c768619/c402ef0028d1439f9191cbbf6484b915/FLAG8ea01c5d8 [2025-03-16 14:49:56,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99c768619/c402ef0028d1439f9191cbbf6484b915 [2025-03-16 14:49:56,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:49:56,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:49:56,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:49:56,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:49:56,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:49:56,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:49:56" (1/1) ... [2025-03-16 14:49:56,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@efd915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56, skipping insertion in model container [2025-03-16 14:49:56,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:49:56" (1/1) ... [2025-03-16 14:49:56,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:49:56,282 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/Problem11_label02.c[7865,7878] [2025-03-16 14:49:56,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:49:56,422 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:49:56,443 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/Problem11_label02.c[7865,7878] [2025-03-16 14:49:56,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:49:56,525 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:49:56,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56 WrapperNode [2025-03-16 14:49:56,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:49:56,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:49:56,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:49:56,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:49:56,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56" (1/1) ... [2025-03-16 14:49:56,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56" (1/1) ... [2025-03-16 14:49:56,641 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-16 14:49:56,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:49:56,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:49:56,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:49:56,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:49:56,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56" (1/1) ... [2025-03-16 14:49:56,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56" (1/1) ... [2025-03-16 14:49:56,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56" (1/1) ... [2025-03-16 14:49:56,725 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:49:56,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56" (1/1) ... [2025-03-16 14:49:56,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56" (1/1) ... [2025-03-16 14:49:56,758 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56" (1/1) ... [2025-03-16 14:49:56,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56" (1/1) ... [2025-03-16 14:49:56,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56" (1/1) ... [2025-03-16 14:49:56,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56" (1/1) ... [2025-03-16 14:49:56,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:49:56,789 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:49:56,789 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:49:56,790 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:49:56,790 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56" (1/1) ... [2025-03-16 14:49:56,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:49:56,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:49:56,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:49:56,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:49:56,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:49:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:49:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:49:56,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:49:56,888 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:49:56,889 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:49:57,990 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-16 14:49:57,990 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:49:58,005 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:49:58,007 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:49:58,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:49:58 BoogieIcfgContainer [2025-03-16 14:49:58,008 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:49:58,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:49:58,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:49:58,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:49:58,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:49:56" (1/3) ... [2025-03-16 14:49:58,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f4d713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:49:58, skipping insertion in model container [2025-03-16 14:49:58,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:56" (2/3) ... [2025-03-16 14:49:58,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f4d713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:49:58, skipping insertion in model container [2025-03-16 14:49:58,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:49:58" (3/3) ... [2025-03-16 14:49:58,016 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label02.c [2025-03-16 14:49:58,027 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:49:58,028 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label02.c that has 1 procedures, 222 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:49:58,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:49:58,111 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;@3b3f7828, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:49:58,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:49:58,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:49:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 14:49:58,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:58,122 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] [2025-03-16 14:49:58,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:58,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:58,128 INFO L85 PathProgramCache]: Analyzing trace with hash 110633255, now seen corresponding path program 1 times [2025-03-16 14:49:58,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:58,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719577270] [2025-03-16 14:49:58,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:58,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 14:49:58,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 14:49:58,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:58,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:58,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:58,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719577270] [2025-03-16 14:49:58,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719577270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:58,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:58,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:58,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63468777] [2025-03-16 14:49:58,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:58,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:49:58,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:58,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:49:58,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:49:58,276 INFO L87 Difference]: Start difference. First operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:49:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:58,301 INFO L93 Difference]: Finished difference Result 443 states and 839 transitions. [2025-03-16 14:49:58,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:49:58,305 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 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 53 [2025-03-16 14:49:58,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:58,311 INFO L225 Difference]: With dead ends: 443 [2025-03-16 14:49:58,312 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 14:49:58,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:49:58,316 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:58,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:49:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 14:49:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-16 14:49:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:49:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2025-03-16 14:49:58,361 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 53 [2025-03-16 14:49:58,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:58,361 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2025-03-16 14:49:58,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:49:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2025-03-16 14:49:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 14:49:58,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:58,363 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] [2025-03-16 14:49:58,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:49:58,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:58,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:58,364 INFO L85 PathProgramCache]: Analyzing trace with hash -947023507, now seen corresponding path program 1 times [2025-03-16 14:49:58,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:58,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937794748] [2025-03-16 14:49:58,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:58,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:58,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 14:49:58,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 14:49:58,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:58,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:58,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:58,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937794748] [2025-03-16 14:49:58,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937794748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:58,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:58,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:58,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746934202] [2025-03-16 14:49:58,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:58,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:58,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:58,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:58,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:58,584 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:49:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:59,341 INFO L93 Difference]: Finished difference Result 639 states and 1042 transitions. [2025-03-16 14:49:59,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:59,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 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 53 [2025-03-16 14:49:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:59,343 INFO L225 Difference]: With dead ends: 639 [2025-03-16 14:49:59,346 INFO L226 Difference]: Without dead ends: 421 [2025-03-16 14:49:59,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:59,347 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 158 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:59,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 122 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:49:59,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-16 14:49:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2025-03-16 14:49:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.524390243902439) internal successors, (625), 410 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:49:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 625 transitions. [2025-03-16 14:49:59,375 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 625 transitions. Word has length 53 [2025-03-16 14:49:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:59,376 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 625 transitions. [2025-03-16 14:49:59,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:49:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 625 transitions. [2025-03-16 14:49:59,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-16 14:49:59,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:59,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:59,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:49:59,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:59,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:59,384 INFO L85 PathProgramCache]: Analyzing trace with hash 405076165, now seen corresponding path program 1 times [2025-03-16 14:49:59,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:59,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897436008] [2025-03-16 14:49:59,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:59,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:59,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-16 14:49:59,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-16 14:49:59,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:59,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:59,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:59,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897436008] [2025-03-16 14:49:59,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897436008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:59,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:59,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353849798] [2025-03-16 14:49:59,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:59,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:59,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:59,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:59,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:59,600 INFO L87 Difference]: Start difference. First operand 411 states and 625 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:00,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:00,256 INFO L93 Difference]: Finished difference Result 1198 states and 1828 transitions. [2025-03-16 14:50:00,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:00,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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 119 [2025-03-16 14:50:00,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:00,260 INFO L225 Difference]: With dead ends: 1198 [2025-03-16 14:50:00,260 INFO L226 Difference]: Without dead ends: 788 [2025-03-16 14:50:00,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:00,263 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:00,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 175 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-03-16 14:50:00,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2025-03-16 14:50:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3748411689961881) internal successors, (1082), 787 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:00,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1082 transitions. [2025-03-16 14:50:00,288 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1082 transitions. Word has length 119 [2025-03-16 14:50:00,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:00,288 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1082 transitions. [2025-03-16 14:50:00,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:00,289 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1082 transitions. [2025-03-16 14:50:00,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 14:50:00,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:00,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:00,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:50:00,290 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:00,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1262849851, now seen corresponding path program 1 times [2025-03-16 14:50:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:00,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667997100] [2025-03-16 14:50:00,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:00,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:00,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 14:50:00,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 14:50:00,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:00,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:00,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:00,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667997100] [2025-03-16 14:50:00,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667997100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:00,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:00,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:50:00,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121235054] [2025-03-16 14:50:00,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:00,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:00,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:00,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:00,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:00,522 INFO L87 Difference]: Start difference. First operand 788 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:01,143 INFO L93 Difference]: Finished difference Result 2315 states and 3181 transitions. [2025-03-16 14:50:01,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:01,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 123 [2025-03-16 14:50:01,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:01,147 INFO L225 Difference]: With dead ends: 2315 [2025-03-16 14:50:01,148 INFO L226 Difference]: Without dead ends: 1528 [2025-03-16 14:50:01,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:01,161 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 121 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:01,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 193 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2025-03-16 14:50:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1525. [2025-03-16 14:50:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.2178477690288714) internal successors, (1856), 1524 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1856 transitions. [2025-03-16 14:50:01,182 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1856 transitions. Word has length 123 [2025-03-16 14:50:01,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:01,182 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 1856 transitions. [2025-03-16 14:50:01,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1856 transitions. [2025-03-16 14:50:01,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-16 14:50:01,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:01,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:01,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:50:01,185 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:01,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1045412500, now seen corresponding path program 1 times [2025-03-16 14:50:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:01,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039919825] [2025-03-16 14:50:01,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:01,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:01,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 14:50:01,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 14:50:01,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:01,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039919825] [2025-03-16 14:50:01,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039919825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:01,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:01,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:01,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561930782] [2025-03-16 14:50:01,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:01,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:01,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:01,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:01,417 INFO L87 Difference]: Start difference. First operand 1525 states and 1856 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:01,983 INFO L93 Difference]: Finished difference Result 3256 states and 4124 transitions. [2025-03-16 14:50:01,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:01,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 180 [2025-03-16 14:50:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:01,989 INFO L225 Difference]: With dead ends: 3256 [2025-03-16 14:50:01,989 INFO L226 Difference]: Without dead ends: 1916 [2025-03-16 14:50:01,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:01,991 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 181 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:01,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:50:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-03-16 14:50:02,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1913. [2025-03-16 14:50:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1912 states have (on average 1.2468619246861925) internal successors, (2384), 1912 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2384 transitions. [2025-03-16 14:50:02,017 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2384 transitions. Word has length 180 [2025-03-16 14:50:02,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:02,017 INFO L471 AbstractCegarLoop]: Abstraction has 1913 states and 2384 transitions. [2025-03-16 14:50:02,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2384 transitions. [2025-03-16 14:50:02,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-16 14:50:02,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:02,020 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:02,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:50:02,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:02,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:02,021 INFO L85 PathProgramCache]: Analyzing trace with hash -794311210, now seen corresponding path program 1 times [2025-03-16 14:50:02,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:02,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102535334] [2025-03-16 14:50:02,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:02,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-16 14:50:02,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-16 14:50:02,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:02,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:02,214 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-16 14:50:02,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:02,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102535334] [2025-03-16 14:50:02,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102535334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:02,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:02,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:02,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875857200] [2025-03-16 14:50:02,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:02,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:02,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:02,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:02,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:02,216 INFO L87 Difference]: Start difference. First operand 1913 states and 2384 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:02,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:02,894 INFO L93 Difference]: Finished difference Result 4388 states and 5591 transitions. [2025-03-16 14:50:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:02,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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 235 [2025-03-16 14:50:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:02,901 INFO L225 Difference]: With dead ends: 4388 [2025-03-16 14:50:02,902 INFO L226 Difference]: Without dead ends: 2660 [2025-03-16 14:50:02,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:02,905 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 143 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:02,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 390 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2025-03-16 14:50:02,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2466. [2025-03-16 14:50:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2465 states have (on average 1.2352941176470589) internal successors, (3045), 2465 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 3045 transitions. [2025-03-16 14:50:02,939 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 3045 transitions. Word has length 235 [2025-03-16 14:50:02,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:02,939 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 3045 transitions. [2025-03-16 14:50:02,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 3045 transitions. [2025-03-16 14:50:02,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-16 14:50:02,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:02,943 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, 2, 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] [2025-03-16 14:50:02,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:50:02,943 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:02,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:02,944 INFO L85 PathProgramCache]: Analyzing trace with hash -326145721, now seen corresponding path program 1 times [2025-03-16 14:50:02,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:02,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281869843] [2025-03-16 14:50:02,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:02,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:02,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-16 14:50:02,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-16 14:50:02,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:02,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 14:50:03,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:03,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281869843] [2025-03-16 14:50:03,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281869843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:03,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:03,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:03,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423024601] [2025-03-16 14:50:03,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:03,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:03,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:03,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:03,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:03,129 INFO L87 Difference]: Start difference. First operand 2466 states and 3045 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:03,758 INFO L93 Difference]: Finished difference Result 5861 states and 7299 transitions. [2025-03-16 14:50:03,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:03,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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 241 [2025-03-16 14:50:03,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:03,765 INFO L225 Difference]: With dead ends: 5861 [2025-03-16 14:50:03,765 INFO L226 Difference]: Without dead ends: 3396 [2025-03-16 14:50:03,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:03,768 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:03,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 388 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2025-03-16 14:50:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3387. [2025-03-16 14:50:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 3386 states have (on average 1.2082102776137036) internal successors, (4091), 3386 states have internal predecessors, (4091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4091 transitions. [2025-03-16 14:50:03,803 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4091 transitions. Word has length 241 [2025-03-16 14:50:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:03,803 INFO L471 AbstractCegarLoop]: Abstraction has 3387 states and 4091 transitions. [2025-03-16 14:50:03,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4091 transitions. [2025-03-16 14:50:03,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-16 14:50:03,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:03,807 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:50:03,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:50:03,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:03,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:03,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1490423948, now seen corresponding path program 1 times [2025-03-16 14:50:03,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:03,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153831225] [2025-03-16 14:50:03,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:03,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:03,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-16 14:50:03,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-16 14:50:03,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:03,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:04,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:04,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153831225] [2025-03-16 14:50:04,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153831225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:04,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:04,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:04,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822367367] [2025-03-16 14:50:04,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:04,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:50:04,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:04,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:50:04,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:04,012 INFO L87 Difference]: Start difference. First operand 3387 states and 4091 transitions. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:05,023 INFO L93 Difference]: Finished difference Result 10495 states and 13001 transitions. [2025-03-16 14:50:05,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:50:05,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 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 280 [2025-03-16 14:50:05,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:05,042 INFO L225 Difference]: With dead ends: 10495 [2025-03-16 14:50:05,042 INFO L226 Difference]: Without dead ends: 7109 [2025-03-16 14:50:05,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:05,049 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 292 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:05,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 88 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:50:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7109 states. [2025-03-16 14:50:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7109 to 7105. [2025-03-16 14:50:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7105 states, 7104 states have (on average 1.224802927927928) internal successors, (8701), 7104 states have internal predecessors, (8701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 8701 transitions. [2025-03-16 14:50:05,152 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 8701 transitions. Word has length 280 [2025-03-16 14:50:05,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:05,152 INFO L471 AbstractCegarLoop]: Abstraction has 7105 states and 8701 transitions. [2025-03-16 14:50:05,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:05,153 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 8701 transitions. [2025-03-16 14:50:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-16 14:50:05,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:05,160 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:05,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:50:05,160 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:05,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:05,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1958665673, now seen corresponding path program 1 times [2025-03-16 14:50:05,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:05,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028872803] [2025-03-16 14:50:05,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:05,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:05,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-16 14:50:05,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-16 14:50:05,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:05,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-16 14:50:05,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:05,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028872803] [2025-03-16 14:50:05,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028872803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:05,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:05,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:05,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264423464] [2025-03-16 14:50:05,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:05,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:05,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:05,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:05,383 INFO L87 Difference]: Start difference. First operand 7105 states and 8701 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:06,019 INFO L93 Difference]: Finished difference Result 13863 states and 17061 transitions. [2025-03-16 14:50:06,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:06,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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 312 [2025-03-16 14:50:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:06,037 INFO L225 Difference]: With dead ends: 13863 [2025-03-16 14:50:06,037 INFO L226 Difference]: Without dead ends: 7127 [2025-03-16 14:50:06,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:06,043 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 137 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:06,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 342 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7127 states. [2025-03-16 14:50:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7127 to 6921. [2025-03-16 14:50:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6921 states, 6920 states have (on average 1.18135838150289) internal successors, (8175), 6920 states have internal predecessors, (8175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6921 states to 6921 states and 8175 transitions. [2025-03-16 14:50:06,127 INFO L78 Accepts]: Start accepts. Automaton has 6921 states and 8175 transitions. Word has length 312 [2025-03-16 14:50:06,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:06,128 INFO L471 AbstractCegarLoop]: Abstraction has 6921 states and 8175 transitions. [2025-03-16 14:50:06,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 6921 states and 8175 transitions. [2025-03-16 14:50:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-16 14:50:06,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:06,133 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:06,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:50:06,133 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:06,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:06,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2044121647, now seen corresponding path program 1 times [2025-03-16 14:50:06,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:06,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554084979] [2025-03-16 14:50:06,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:06,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:06,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-16 14:50:06,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-16 14:50:06,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:06,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:06,261 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 14:50:06,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:06,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554084979] [2025-03-16 14:50:06,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554084979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:06,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:06,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:06,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721302065] [2025-03-16 14:50:06,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:06,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:06,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:06,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:06,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:06,263 INFO L87 Difference]: Start difference. First operand 6921 states and 8175 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:06,762 INFO L93 Difference]: Finished difference Result 13068 states and 15494 transitions. [2025-03-16 14:50:06,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:06,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 313 [2025-03-16 14:50:06,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:06,782 INFO L225 Difference]: With dead ends: 13068 [2025-03-16 14:50:06,783 INFO L226 Difference]: Without dead ends: 6516 [2025-03-16 14:50:06,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:06,789 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 160 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:06,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 148 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:50:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6516 states. [2025-03-16 14:50:06,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6516 to 6328. [2025-03-16 14:50:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6328 states, 6327 states have (on average 1.1335546072388178) internal successors, (7172), 6327 states have internal predecessors, (7172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:06,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6328 states to 6328 states and 7172 transitions. [2025-03-16 14:50:06,859 INFO L78 Accepts]: Start accepts. Automaton has 6328 states and 7172 transitions. Word has length 313 [2025-03-16 14:50:06,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:06,859 INFO L471 AbstractCegarLoop]: Abstraction has 6328 states and 7172 transitions. [2025-03-16 14:50:06,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 6328 states and 7172 transitions. [2025-03-16 14:50:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-16 14:50:06,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:06,865 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:06,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:50:06,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:06,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash -230375150, now seen corresponding path program 1 times [2025-03-16 14:50:06,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:06,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272895221] [2025-03-16 14:50:06,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:06,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:06,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-16 14:50:06,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-16 14:50:06,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:06,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-03-16 14:50:07,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:07,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272895221] [2025-03-16 14:50:07,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272895221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:07,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:07,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:07,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051833895] [2025-03-16 14:50:07,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:07,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:07,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:07,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:07,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:07,082 INFO L87 Difference]: Start difference. First operand 6328 states and 7172 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:07,693 INFO L93 Difference]: Finished difference Result 16151 states and 18435 transitions. [2025-03-16 14:50:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:07,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 318 [2025-03-16 14:50:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:07,710 INFO L225 Difference]: With dead ends: 16151 [2025-03-16 14:50:07,710 INFO L226 Difference]: Without dead ends: 10192 [2025-03-16 14:50:07,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:07,717 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 152 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:07,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 345 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:07,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10192 states. [2025-03-16 14:50:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10192 to 10192. [2025-03-16 14:50:07,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10192 states, 10191 states have (on average 1.1151996859974487) internal successors, (11365), 10191 states have internal predecessors, (11365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10192 states to 10192 states and 11365 transitions. [2025-03-16 14:50:07,826 INFO L78 Accepts]: Start accepts. Automaton has 10192 states and 11365 transitions. Word has length 318 [2025-03-16 14:50:07,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:07,826 INFO L471 AbstractCegarLoop]: Abstraction has 10192 states and 11365 transitions. [2025-03-16 14:50:07,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 10192 states and 11365 transitions. [2025-03-16 14:50:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-16 14:50:07,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:07,834 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, 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, 1, 1, 1, 1] [2025-03-16 14:50:07,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:50:07,834 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:07,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:07,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1947414846, now seen corresponding path program 1 times [2025-03-16 14:50:07,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:07,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002676602] [2025-03-16 14:50:07,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:07,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:07,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-16 14:50:07,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-16 14:50:07,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:07,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-16 14:50:07,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:07,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002676602] [2025-03-16 14:50:07,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002676602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:07,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:07,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:07,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519482614] [2025-03-16 14:50:07,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:07,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:07,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:07,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:07,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:07,975 INFO L87 Difference]: Start difference. First operand 10192 states and 11365 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:08,479 INFO L93 Difference]: Finished difference Result 20746 states and 23158 transitions. [2025-03-16 14:50:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:08,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 346 [2025-03-16 14:50:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:08,496 INFO L225 Difference]: With dead ends: 20746 [2025-03-16 14:50:08,496 INFO L226 Difference]: Without dead ends: 12031 [2025-03-16 14:50:08,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:08,503 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 164 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:08,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 149 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:50:08,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12031 states. [2025-03-16 14:50:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12031 to 7607. [2025-03-16 14:50:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7607 states, 7606 states have (on average 1.1205627136471208) internal successors, (8523), 7606 states have internal predecessors, (8523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7607 states to 7607 states and 8523 transitions. [2025-03-16 14:50:08,581 INFO L78 Accepts]: Start accepts. Automaton has 7607 states and 8523 transitions. Word has length 346 [2025-03-16 14:50:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:08,581 INFO L471 AbstractCegarLoop]: Abstraction has 7607 states and 8523 transitions. [2025-03-16 14:50:08,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 7607 states and 8523 transitions. [2025-03-16 14:50:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-16 14:50:08,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:08,588 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:50:08,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:50:08,588 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:08,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash -761877271, now seen corresponding path program 1 times [2025-03-16 14:50:08,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:08,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506974505] [2025-03-16 14:50:08,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:08,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:08,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-16 14:50:08,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-16 14:50:08,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:08,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:08,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:08,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506974505] [2025-03-16 14:50:08,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506974505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:08,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:08,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:08,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084607691] [2025-03-16 14:50:08,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:08,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:08,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:08,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:08,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:08,807 INFO L87 Difference]: Start difference. First operand 7607 states and 8523 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:09,325 INFO L93 Difference]: Finished difference Result 18158 states and 20359 transitions. [2025-03-16 14:50:09,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:09,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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 355 [2025-03-16 14:50:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:09,341 INFO L225 Difference]: With dead ends: 18158 [2025-03-16 14:50:09,341 INFO L226 Difference]: Without dead ends: 10552 [2025-03-16 14:50:09,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:09,348 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 58 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:09,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 70 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:50:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10552 states. [2025-03-16 14:50:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10552 to 10547. [2025-03-16 14:50:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10547 states, 10546 states have (on average 1.1090460838232505) internal successors, (11696), 10546 states have internal predecessors, (11696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10547 states to 10547 states and 11696 transitions. [2025-03-16 14:50:09,436 INFO L78 Accepts]: Start accepts. Automaton has 10547 states and 11696 transitions. Word has length 355 [2025-03-16 14:50:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:09,436 INFO L471 AbstractCegarLoop]: Abstraction has 10547 states and 11696 transitions. [2025-03-16 14:50:09,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 10547 states and 11696 transitions. [2025-03-16 14:50:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-16 14:50:09,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:09,442 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:50:09,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:50:09,443 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:09,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:09,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1549772859, now seen corresponding path program 1 times [2025-03-16 14:50:09,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:09,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517083445] [2025-03-16 14:50:09,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:09,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:09,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-16 14:50:09,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-16 14:50:09,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:09,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-16 14:50:09,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:09,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517083445] [2025-03-16 14:50:09,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517083445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:50:09,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717800809] [2025-03-16 14:50:09,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:09,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:50:09,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:50:09,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:50:09,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:50:10,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-16 14:50:10,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-16 14:50:10,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:10,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:10,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:50:10,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:50:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-16 14:50:10,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:50:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-16 14:50:11,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717800809] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:50:11,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:50:11,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-16 14:50:11,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560147040] [2025-03-16 14:50:11,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:11,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:11,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:11,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:11,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:50:11,692 INFO L87 Difference]: Start difference. First operand 10547 states and 11696 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:12,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:12,310 INFO L93 Difference]: Finished difference Result 23664 states and 26232 transitions. [2025-03-16 14:50:12,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:12,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 358 [2025-03-16 14:50:12,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:12,325 INFO L225 Difference]: With dead ends: 23664 [2025-03-16 14:50:12,325 INFO L226 Difference]: Without dead ends: 13118 [2025-03-16 14:50:12,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 713 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:50:12,333 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 175 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:12,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 118 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13118 states. [2025-03-16 14:50:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13118 to 10726. [2025-03-16 14:50:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10726 states, 10725 states have (on average 1.1014452214452215) internal successors, (11813), 10725 states have internal predecessors, (11813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10726 states to 10726 states and 11813 transitions. [2025-03-16 14:50:12,472 INFO L78 Accepts]: Start accepts. Automaton has 10726 states and 11813 transitions. Word has length 358 [2025-03-16 14:50:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:12,473 INFO L471 AbstractCegarLoop]: Abstraction has 10726 states and 11813 transitions. [2025-03-16 14:50:12,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 10726 states and 11813 transitions. [2025-03-16 14:50:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-16 14:50:12,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:12,485 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, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:12,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:50:12,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 14:50:12,686 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:12,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash 375905629, now seen corresponding path program 1 times [2025-03-16 14:50:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:12,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364035736] [2025-03-16 14:50:12,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:12,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-16 14:50:12,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-16 14:50:12,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:12,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-16 14:50:12,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:12,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364035736] [2025-03-16 14:50:12,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364035736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:12,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:12,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:12,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226799842] [2025-03-16 14:50:12,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:12,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:12,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:12,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:12,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:12,874 INFO L87 Difference]: Start difference. First operand 10726 states and 11813 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:13,430 INFO L93 Difference]: Finished difference Result 23474 states and 25882 transitions. [2025-03-16 14:50:13,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:13,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 445 [2025-03-16 14:50:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:13,444 INFO L225 Difference]: With dead ends: 23474 [2025-03-16 14:50:13,444 INFO L226 Difference]: Without dead ends: 12749 [2025-03-16 14:50:13,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:13,452 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 98 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:13,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 341 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:50:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12749 states. [2025-03-16 14:50:13,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12749 to 10533. [2025-03-16 14:50:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10533 states, 10532 states have (on average 1.0960881124192936) internal successors, (11544), 10532 states have internal predecessors, (11544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10533 states to 10533 states and 11544 transitions. [2025-03-16 14:50:13,587 INFO L78 Accepts]: Start accepts. Automaton has 10533 states and 11544 transitions. Word has length 445 [2025-03-16 14:50:13,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:13,587 INFO L471 AbstractCegarLoop]: Abstraction has 10533 states and 11544 transitions. [2025-03-16 14:50:13,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 10533 states and 11544 transitions. [2025-03-16 14:50:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-16 14:50:13,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:13,596 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, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:50:13,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:50:13,596 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:13,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:13,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1666691429, now seen corresponding path program 1 times [2025-03-16 14:50:13,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:13,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549183848] [2025-03-16 14:50:13,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:13,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:13,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-16 14:50:13,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-16 14:50:13,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:13,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-16 14:50:13,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:13,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549183848] [2025-03-16 14:50:13,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549183848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:13,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:13,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:13,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513391232] [2025-03-16 14:50:13,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:13,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:13,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:13,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:13,924 INFO L87 Difference]: Start difference. First operand 10533 states and 11544 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:14,411 INFO L93 Difference]: Finished difference Result 21804 states and 23887 transitions. [2025-03-16 14:50:14,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:14,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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 479 [2025-03-16 14:50:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:14,422 INFO L225 Difference]: With dead ends: 21804 [2025-03-16 14:50:14,422 INFO L226 Difference]: Without dead ends: 11088 [2025-03-16 14:50:14,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:14,429 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 88 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:14,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 165 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:50:14,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11088 states. [2025-03-16 14:50:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11088 to 10901. [2025-03-16 14:50:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10901 states, 10900 states have (on average 1.088256880733945) internal successors, (11862), 10900 states have internal predecessors, (11862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10901 states to 10901 states and 11862 transitions. [2025-03-16 14:50:14,510 INFO L78 Accepts]: Start accepts. Automaton has 10901 states and 11862 transitions. Word has length 479 [2025-03-16 14:50:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:14,510 INFO L471 AbstractCegarLoop]: Abstraction has 10901 states and 11862 transitions. [2025-03-16 14:50:14,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 10901 states and 11862 transitions. [2025-03-16 14:50:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-16 14:50:14,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:14,519 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, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:50:14,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:50:14,519 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:14,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:14,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1819633004, now seen corresponding path program 1 times [2025-03-16 14:50:14,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:14,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049866084] [2025-03-16 14:50:14,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:14,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:14,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-16 14:50:14,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-16 14:50:14,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:14,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-16 14:50:14,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:14,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049866084] [2025-03-16 14:50:14,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049866084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:14,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:14,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:50:14,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379710794] [2025-03-16 14:50:14,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:14,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:50:14,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:14,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:50:14,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:14,852 INFO L87 Difference]: Start difference. First operand 10901 states and 11862 transitions. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:15,588 INFO L93 Difference]: Finished difference Result 23270 states and 25354 transitions. [2025-03-16 14:50:15,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:50:15,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 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 480 [2025-03-16 14:50:15,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:15,599 INFO L225 Difference]: With dead ends: 23270 [2025-03-16 14:50:15,599 INFO L226 Difference]: Without dead ends: 12186 [2025-03-16 14:50:15,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:15,607 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 283 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:15,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 149 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:50:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12186 states. [2025-03-16 14:50:15,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12186 to 11450. [2025-03-16 14:50:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11450 states, 11449 states have (on average 1.0814918333478907) internal successors, (12382), 11449 states have internal predecessors, (12382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11450 states to 11450 states and 12382 transitions. [2025-03-16 14:50:15,696 INFO L78 Accepts]: Start accepts. Automaton has 11450 states and 12382 transitions. Word has length 480 [2025-03-16 14:50:15,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:15,697 INFO L471 AbstractCegarLoop]: Abstraction has 11450 states and 12382 transitions. [2025-03-16 14:50:15,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 11450 states and 12382 transitions. [2025-03-16 14:50:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-16 14:50:15,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:15,737 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:50:15,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:50:15,737 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:15,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:15,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1152098430, now seen corresponding path program 1 times [2025-03-16 14:50:15,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:15,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978532639] [2025-03-16 14:50:15,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:15,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:15,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-16 14:50:15,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-16 14:50:15,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:15,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 578 proven. 133 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 14:50:16,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:16,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978532639] [2025-03-16 14:50:16,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978532639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:50:16,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842204109] [2025-03-16 14:50:16,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:16,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:50:16,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:50:16,443 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:50:16,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:50:16,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-16 14:50:16,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-16 14:50:16,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:16,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:16,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:50:16,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:50:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-16 14:50:16,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:50:16,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842204109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:16,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:50:16,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:50:16,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630173400] [2025-03-16 14:50:16,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:16,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:16,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:16,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:16,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:50:16,672 INFO L87 Difference]: Start difference. First operand 11450 states and 12382 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:17,105 INFO L93 Difference]: Finished difference Result 24378 states and 26390 transitions. [2025-03-16 14:50:17,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:17,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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 517 [2025-03-16 14:50:17,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:17,115 INFO L225 Difference]: With dead ends: 24378 [2025-03-16 14:50:17,115 INFO L226 Difference]: Without dead ends: 12929 [2025-03-16 14:50:17,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:50:17,121 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 93 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:17,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 324 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:50:17,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12929 states. [2025-03-16 14:50:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12929 to 11818. [2025-03-16 14:50:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11818 states, 11817 states have (on average 1.0820851315900821) internal successors, (12787), 11817 states have internal predecessors, (12787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11818 states to 11818 states and 12787 transitions. [2025-03-16 14:50:17,210 INFO L78 Accepts]: Start accepts. Automaton has 11818 states and 12787 transitions. Word has length 517 [2025-03-16 14:50:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:17,210 INFO L471 AbstractCegarLoop]: Abstraction has 11818 states and 12787 transitions. [2025-03-16 14:50:17,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 11818 states and 12787 transitions. [2025-03-16 14:50:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-03-16 14:50:17,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:17,219 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2025-03-16 14:50:17,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:50:17,419 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,SelfDestructingSolverStorable17 [2025-03-16 14:50:17,419 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:17,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:17,420 INFO L85 PathProgramCache]: Analyzing trace with hash -348392627, now seen corresponding path program 1 times [2025-03-16 14:50:17,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:17,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719711272] [2025-03-16 14:50:17,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:17,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:17,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-03-16 14:50:17,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-03-16 14:50:17,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:17,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1149 backedges. 877 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 14:50:17,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:17,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719711272] [2025-03-16 14:50:17,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719711272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:17,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:17,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:17,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177623912] [2025-03-16 14:50:17,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:17,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:17,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:17,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:17,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:17,758 INFO L87 Difference]: Start difference. First operand 11818 states and 12787 transitions. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:18,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:18,296 INFO L93 Difference]: Finished difference Result 26402 states and 28529 transitions. [2025-03-16 14:50:18,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:18,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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 609 [2025-03-16 14:50:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:18,306 INFO L225 Difference]: With dead ends: 26402 [2025-03-16 14:50:18,306 INFO L226 Difference]: Without dead ends: 13660 [2025-03-16 14:50:18,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:18,313 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 41 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:18,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 328 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:50:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13660 states. [2025-03-16 14:50:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13660 to 11449. [2025-03-16 14:50:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11449 states, 11448 states have (on average 1.079664570230608) internal successors, (12360), 11448 states have internal predecessors, (12360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11449 states to 11449 states and 12360 transitions. [2025-03-16 14:50:18,392 INFO L78 Accepts]: Start accepts. Automaton has 11449 states and 12360 transitions. Word has length 609 [2025-03-16 14:50:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:18,392 INFO L471 AbstractCegarLoop]: Abstraction has 11449 states and 12360 transitions. [2025-03-16 14:50:18,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 11449 states and 12360 transitions. [2025-03-16 14:50:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2025-03-16 14:50:18,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:18,400 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 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] [2025-03-16 14:50:18,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:50:18,400 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:18,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:18,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1954431468, now seen corresponding path program 1 times [2025-03-16 14:50:18,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:18,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188396880] [2025-03-16 14:50:18,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:18,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:18,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-03-16 14:50:18,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-03-16 14:50:18,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:18,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 698 proven. 232 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2025-03-16 14:50:19,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:19,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188396880] [2025-03-16 14:50:19,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188396880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:50:19,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776323509] [2025-03-16 14:50:19,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:19,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:50:19,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:50:19,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:50:19,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:50:19,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-03-16 14:50:19,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-03-16 14:50:19,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:19,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:19,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:50:19,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:50:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1233 backedges. 891 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-03-16 14:50:20,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:50:20,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776323509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:20,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:50:20,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:50:20,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464196823] [2025-03-16 14:50:20,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:20,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:20,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:20,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:20,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:50:20,961 INFO L87 Difference]: Start difference. First operand 11449 states and 12360 transitions. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:22,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:22,058 INFO L93 Difference]: Finished difference Result 24740 states and 26734 transitions. [2025-03-16 14:50:22,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:22,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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 630 [2025-03-16 14:50:22,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:22,069 INFO L225 Difference]: With dead ends: 24740 [2025-03-16 14:50:22,073 INFO L226 Difference]: Without dead ends: 13476 [2025-03-16 14:50:22,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:50:22,085 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 118 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:22,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 52 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 14:50:22,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13476 states. [2025-03-16 14:50:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13476 to 11265. [2025-03-16 14:50:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11265 states, 11264 states have (on average 1.0794566761363635) internal successors, (12159), 11264 states have internal predecessors, (12159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11265 states to 11265 states and 12159 transitions. [2025-03-16 14:50:22,179 INFO L78 Accepts]: Start accepts. Automaton has 11265 states and 12159 transitions. Word has length 630 [2025-03-16 14:50:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:22,179 INFO L471 AbstractCegarLoop]: Abstraction has 11265 states and 12159 transitions. [2025-03-16 14:50:22,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 11265 states and 12159 transitions. [2025-03-16 14:50:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2025-03-16 14:50:22,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:22,220 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2025-03-16 14:50:22,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:50:22,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:50:22,421 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:22,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:22,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1556616529, now seen corresponding path program 1 times [2025-03-16 14:50:22,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:22,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127236462] [2025-03-16 14:50:22,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:22,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:22,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes. [2025-03-16 14:50:22,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements. [2025-03-16 14:50:22,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:22,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1718 backedges. 1189 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2025-03-16 14:50:22,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:22,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127236462] [2025-03-16 14:50:22,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127236462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:22,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:22,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:22,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389021567] [2025-03-16 14:50:22,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:22,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:50:22,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:22,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:50:22,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:22,826 INFO L87 Difference]: Start difference. First operand 11265 states and 12159 transitions. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:23,575 INFO L93 Difference]: Finished difference Result 23824 states and 25734 transitions. [2025-03-16 14:50:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:50:23,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 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 681 [2025-03-16 14:50:23,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:23,586 INFO L225 Difference]: With dead ends: 23824 [2025-03-16 14:50:23,587 INFO L226 Difference]: Without dead ends: 12744 [2025-03-16 14:50:23,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:23,594 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 193 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:23,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 77 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:50:23,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12744 states. [2025-03-16 14:50:23,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12744 to 10711. [2025-03-16 14:50:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10711 states, 10710 states have (on average 1.080298786181139) internal successors, (11570), 10710 states have internal predecessors, (11570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10711 states to 10711 states and 11570 transitions. [2025-03-16 14:50:23,702 INFO L78 Accepts]: Start accepts. Automaton has 10711 states and 11570 transitions. Word has length 681 [2025-03-16 14:50:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:23,703 INFO L471 AbstractCegarLoop]: Abstraction has 10711 states and 11570 transitions. [2025-03-16 14:50:23,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 10711 states and 11570 transitions. [2025-03-16 14:50:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2025-03-16 14:50:23,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:23,711 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 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] [2025-03-16 14:50:23,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 14:50:23,712 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:23,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:23,712 INFO L85 PathProgramCache]: Analyzing trace with hash -97420414, now seen corresponding path program 1 times [2025-03-16 14:50:23,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:23,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997849075] [2025-03-16 14:50:23,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:23,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:23,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 787 statements into 1 equivalence classes. [2025-03-16 14:50:23,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 787 of 787 statements. [2025-03-16 14:50:23,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:23,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 1107 proven. 336 refuted. 0 times theorem prover too weak. 919 trivial. 0 not checked. [2025-03-16 14:50:24,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:24,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997849075] [2025-03-16 14:50:24,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997849075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:50:24,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547262705] [2025-03-16 14:50:24,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:24,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:50:24,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:50:24,781 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:50:24,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:50:24,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 787 statements into 1 equivalence classes. [2025-03-16 14:50:24,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 787 of 787 statements. [2025-03-16 14:50:24,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:24,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:24,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 14:50:24,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:50:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 1429 proven. 380 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-03-16 14:50:25,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:50:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 1809 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-03-16 14:50:26,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547262705] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:50:26,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:50:26,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 11 [2025-03-16 14:50:26,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900857024] [2025-03-16 14:50:26,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:26,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:50:26,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:26,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:50:26,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-16 14:50:26,519 INFO L87 Difference]: Start difference. First operand 10711 states and 11570 transitions. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:27,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:27,361 INFO L93 Difference]: Finished difference Result 26027 states and 28162 transitions. [2025-03-16 14:50:27,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:50:27,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 4 states have internal predecessors, (438), 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 787 [2025-03-16 14:50:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:27,376 INFO L225 Difference]: With dead ends: 26027 [2025-03-16 14:50:27,376 INFO L226 Difference]: Without dead ends: 15501 [2025-03-16 14:50:27,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1578 GetRequests, 1568 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-16 14:50:27,384 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 360 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:27,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 60 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:50:27,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15501 states. [2025-03-16 14:50:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15501 to 10343. [2025-03-16 14:50:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10343 states, 10342 states have (on average 1.081995745503771) internal successors, (11190), 10342 states have internal predecessors, (11190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10343 states to 10343 states and 11190 transitions. [2025-03-16 14:50:27,488 INFO L78 Accepts]: Start accepts. Automaton has 10343 states and 11190 transitions. Word has length 787 [2025-03-16 14:50:27,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:27,488 INFO L471 AbstractCegarLoop]: Abstraction has 10343 states and 11190 transitions. [2025-03-16 14:50:27,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 10343 states and 11190 transitions. [2025-03-16 14:50:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1130 [2025-03-16 14:50:27,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:27,498 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:27,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 14:50:27,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:50:27,699 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:27,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:27,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1062567068, now seen corresponding path program 1 times [2025-03-16 14:50:27,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:27,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501668662] [2025-03-16 14:50:27,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:27,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:27,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1129 statements into 1 equivalence classes. [2025-03-16 14:50:27,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1129 of 1129 statements. [2025-03-16 14:50:27,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:27,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4116 backedges. 1604 proven. 0 refuted. 0 times theorem prover too weak. 2512 trivial. 0 not checked. [2025-03-16 14:50:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:28,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501668662] [2025-03-16 14:50:28,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501668662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:28,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:28,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:50:28,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005428935] [2025-03-16 14:50:28,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:28,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:28,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:28,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:28,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:28,101 INFO L87 Difference]: Start difference. First operand 10343 states and 11190 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 2 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:28,338 INFO L93 Difference]: Finished difference Result 20682 states and 22376 transitions. [2025-03-16 14:50:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:28,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 2 states have internal predecessors, (343), 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 1129 [2025-03-16 14:50:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:28,345 INFO L225 Difference]: With dead ends: 20682 [2025-03-16 14:50:28,345 INFO L226 Difference]: Without dead ends: 10340 [2025-03-16 14:50:28,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:28,350 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:28,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 27 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:50:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10340 states. [2025-03-16 14:50:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10340 to 10340. [2025-03-16 14:50:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10340 states, 10339 states have (on average 1.0817293742141407) internal successors, (11184), 10339 states have internal predecessors, (11184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10340 states to 10340 states and 11184 transitions. [2025-03-16 14:50:28,439 INFO L78 Accepts]: Start accepts. Automaton has 10340 states and 11184 transitions. Word has length 1129 [2025-03-16 14:50:28,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:28,439 INFO L471 AbstractCegarLoop]: Abstraction has 10340 states and 11184 transitions. [2025-03-16 14:50:28,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 2 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 10340 states and 11184 transitions. [2025-03-16 14:50:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1146 [2025-03-16 14:50:28,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:28,451 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:28,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 14:50:28,451 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:28,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:28,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1089907580, now seen corresponding path program 1 times [2025-03-16 14:50:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:28,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308574369] [2025-03-16 14:50:28,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:28,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:28,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1145 statements into 1 equivalence classes. [2025-03-16 14:50:28,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1145 of 1145 statements. [2025-03-16 14:50:28,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:28,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 2554 proven. 275 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2025-03-16 14:50:29,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:29,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308574369] [2025-03-16 14:50:29,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308574369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:50:29,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348326920] [2025-03-16 14:50:29,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:29,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:50:29,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:50:29,485 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:50:29,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 14:50:29,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1145 statements into 1 equivalence classes. [2025-03-16 14:50:29,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1145 of 1145 statements. [2025-03-16 14:50:29,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:29,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:29,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 1440 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:50:29,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:50:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 2536 proven. 0 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2025-03-16 14:50:29,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:50:29,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348326920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:29,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:50:29,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:50:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848616322] [2025-03-16 14:50:29,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:29,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:29,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:29,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:29,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:50:29,961 INFO L87 Difference]: Start difference. First operand 10340 states and 11184 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:30,308 INFO L93 Difference]: Finished difference Result 15327 states and 16566 transitions. [2025-03-16 14:50:30,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:30,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 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 1145 [2025-03-16 14:50:30,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:30,310 INFO L225 Difference]: With dead ends: 15327 [2025-03-16 14:50:30,310 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:50:30,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1149 GetRequests, 1146 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:50:30,314 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 85 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:30,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 268 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:50:30,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:50:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:50:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:50:30,315 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1145 [2025-03-16 14:50:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:30,315 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:50:30,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:50:30,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:50:30,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:50:30,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 14:50:30,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-16 14:50:30,522 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-16 14:50:30,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:50:33,135 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:50:33,157 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-16 14:50:33,161 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-16 14:50:33,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:50:33 BoogieIcfgContainer [2025-03-16 14:50:33,173 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:50:33,174 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:50:33,174 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:50:33,174 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:50:33,175 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:49:58" (3/4) ... [2025-03-16 14:50:33,176 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:50:33,192 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:50:33,193 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:50:33,194 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:50:33,195 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:50:33,342 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:50:33,343 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:50:33,343 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:50:33,343 INFO L158 Benchmark]: Toolchain (without parser) took 37265.56ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 111.0MB in the beginning and 309.6MB in the end (delta: -198.6MB). Peak memory consumption was 154.9MB. Max. memory is 16.1GB. [2025-03-16 14:50:33,345 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:50:33,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.33ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 67.6MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 14:50:33,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.07ms. Allocated memory is still 142.6MB. Free memory was 67.6MB in the beginning and 50.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:50:33,347 INFO L158 Benchmark]: Boogie Preprocessor took 146.71ms. Allocated memory is still 142.6MB. Free memory was 50.9MB in the beginning and 88.9MB in the end (delta: -38.1MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2025-03-16 14:50:33,347 INFO L158 Benchmark]: IcfgBuilder took 1218.55ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 47.2MB in the end (delta: 41.8MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2025-03-16 14:50:33,347 INFO L158 Benchmark]: TraceAbstraction took 35163.23ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 47.2MB in the beginning and 326.3MB in the end (delta: -279.1MB). Peak memory consumption was 274.2MB. Max. memory is 16.1GB. [2025-03-16 14:50:33,347 INFO L158 Benchmark]: Witness Printer took 168.77ms. Allocated memory is still 494.9MB. Free memory was 326.3MB in the beginning and 309.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:50:33,348 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.33ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 67.6MB in the end (delta: 42.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.07ms. Allocated memory is still 142.6MB. Free memory was 67.6MB in the beginning and 50.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 146.71ms. Allocated memory is still 142.6MB. Free memory was 50.9MB in the beginning and 88.9MB in the end (delta: -38.1MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1218.55ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 47.2MB in the end (delta: 41.8MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * TraceAbstraction took 35163.23ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 47.2MB in the beginning and 326.3MB in the end (delta: -279.1MB). Peak memory consumption was 274.2MB. Max. memory is 16.1GB. * Witness Printer took 168.77ms. Allocated memory is still 494.9MB. Free memory was 326.3MB in the beginning and 309.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 178]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 222 locations, 420 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.4s, OverallIterations: 24, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3553 SdHoareTripleChecker+Valid, 13.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3553 mSDsluCounter, 4997 SdHoareTripleChecker+Invalid, 11.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 481 mSDsCounter, 2297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13904 IncrementalHoareTripleChecker+Invalid, 16201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2297 mSolverCounterUnsat, 4516 mSDtfsCounter, 13904 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4654 GetRequests, 4606 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11818occurred in iteration=18, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 23301 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 13625 NumberOfCodeBlocks, 13625 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 14739 ConstructedInterpolants, 104 QuantifiedInterpolants, 44497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4430 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 31 InterpolantComputations, 24 PerfectInterpolantSequences, 30361/31923 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: ((((((((((((((((((((a25 == 11) && (a29 <= 274)) && (a4 == 1)) && (246 <= a29)) && (a23 <= 137)) || (((((a25 == 9) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42))) && (a29 <= 130))) || (((((((a25 == 11) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0))) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 12) && (a4 == 0)) && (a8 == 15)) && (246 <= a29))) || (((((long long) a23 + 43) <= 0) && (a8 == 15)) && ((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) || (((a29 <= 140) && (a4 == 0)) && (a25 == 10))))) || ((((((a25 == 12) && (307 <= a23)) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a4 == 1)) && (a8 == 15)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0)))) || (((((long long) a23 + 43) <= 0) && (((((a25 == 13) && (a4 == 0)) && (a29 <= 274)) && (246 <= a29)) || (((a4 == 0) && (a25 <= 9)) && (246 <= a29)))) && (a8 == 15))) || ((((((a25 == 13) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a4 == 1)) && (a8 == 15)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0))) && (0 <= ((long long) a23 + 42)))) || (((((((a25 == 11) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0))) && (a29 <= 130))) || ((((a29 <= 140) && (a4 == 1)) && (a25 == 10)) && (a23 <= 137))) || (((((a25 == 12) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((a25 == 11) && (a4 == 1)) && (0 <= ((long long) a23 + 42))) && (a23 <= 137))) || (((((a25 <= 10) && ((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) <= 0)) && (a4 == 1)) && (a8 == 15)) && (((((((long long) a23 + -600276) >= 0) ? (((long long) a23 + -600276) / 5) : ((((long long) a23 + -600276) / 5) - 1)) + 43) < 0) || (((((long long) a23 + 4) >= 0) ? (((long long) a23 + 4) % 5) : ((((long long) a23 + 4) % 5) + 5)) == 0)))) || ((((((long long) a23 + 43) <= 0) && (a25 == 12)) && (a4 == 0)) && (a8 == 15))) || (((((long long) a23 + 43) <= 0) && (((((a25 == 13) && (a29 <= 274)) && (a4 == 1)) || (((a25 == 13) && (((long long) a23 + 599772) <= 0)) && (a4 == 1))) || (((a29 <= 140) && (a4 == 0)) && (a25 == 9)))) && (a8 == 15))) || ((((((a25 <= 10) && (a4 == 1)) && (0 <= ((long long) a23 + 42))) && (a29 <= 130)) || ((((a25 == 12) && (a4 == 1)) && (0 <= ((long long) a23 + 42))) && (a29 <= 130))) && (a23 <= 137))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:50:33,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE