./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p7.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p7.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash b22847b49150cd7cc72a08bbf698c81c9da1187f7a650289659111a81b5c540f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:31:42,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:31:43,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:31:43,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:31:43,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:31:43,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:31:43,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:31:43,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:31:43,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:31:43,030 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:31:43,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:31:43,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:31:43,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:31:43,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:31:43,032 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:31:43,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:31:43,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:31:43,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:31:43,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:31:43,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:31:43,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:31:43,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:31:43,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:31:43,033 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:31:43,033 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:31:43,033 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:31:43,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:31:43,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:31:43,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:31:43,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:31:43,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:31:43,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:31:43,034 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:31:43,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:31:43,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:31:43,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:31:43,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:31:43,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:31:43,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:31:43,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:31:43,035 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b22847b49150cd7cc72a08bbf698c81c9da1187f7a650289659111a81b5c540f [2025-03-03 18:31:43,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:31:43,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:31:43,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:31:43,270 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:31:43,270 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:31:43,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p7.c [2025-03-03 18:31:44,375 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fc5f27e0/f222678f34a343cd951acfd05a784f21/FLAG359d051e1 [2025-03-03 18:31:44,667 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:31:44,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p7.c [2025-03-03 18:31:44,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fc5f27e0/f222678f34a343cd951acfd05a784f21/FLAG359d051e1 [2025-03-03 18:31:44,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fc5f27e0/f222678f34a343cd951acfd05a784f21 [2025-03-03 18:31:44,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:31:44,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:31:44,704 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:31:44,704 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:31:44,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:31:44,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:31:44" (1/1) ... [2025-03-03 18:31:44,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b32d127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:44, skipping insertion in model container [2025-03-03 18:31:44,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:31:44" (1/1) ... [2025-03-03 18:31:44,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:31:44,907 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p7.c[1260,1273] [2025-03-03 18:31:45,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:31:45,225 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:31:45,232 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p7.c[1260,1273] [2025-03-03 18:31:45,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:31:45,426 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:31:45,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:45 WrapperNode [2025-03-03 18:31:45,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:31:45,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:31:45,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:31:45,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:31:45,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:45" (1/1) ... [2025-03-03 18:31:45,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:45" (1/1) ... [2025-03-03 18:31:45,808 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4536 [2025-03-03 18:31:45,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:31:45,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:31:45,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:31:45,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:31:45,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:45" (1/1) ... [2025-03-03 18:31:45,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:45" (1/1) ... [2025-03-03 18:31:45,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:45" (1/1) ... [2025-03-03 18:31:46,023 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:31:46,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:45" (1/1) ... [2025-03-03 18:31:46,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:45" (1/1) ... [2025-03-03 18:31:46,152 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:45" (1/1) ... [2025-03-03 18:31:46,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:45" (1/1) ... [2025-03-03 18:31:46,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:45" (1/1) ... [2025-03-03 18:31:46,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:45" (1/1) ... [2025-03-03 18:31:46,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:31:46,347 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:31:46,348 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:31:46,348 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:31:46,349 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:45" (1/1) ... [2025-03-03 18:31:46,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:31:46,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:31:46,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:31:46,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:31:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:31:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:31:46,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:31:46,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:31:46,667 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:31:46,668 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:31:50,369 INFO L? ?]: Removed 2696 outVars from TransFormulas that were not future-live. [2025-03-03 18:31:50,369 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:31:50,527 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:31:50,532 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:31:50,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:31:50 BoogieIcfgContainer [2025-03-03 18:31:50,532 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:31:50,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:31:50,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:31:50,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:31:50,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:31:44" (1/3) ... [2025-03-03 18:31:50,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d57938e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:31:50, skipping insertion in model container [2025-03-03 18:31:50,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:31:45" (2/3) ... [2025-03-03 18:31:50,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d57938e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:31:50, skipping insertion in model container [2025-03-03 18:31:50,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:31:50" (3/3) ... [2025-03-03 18:31:50,541 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p7.c [2025-03-03 18:31:50,554 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:31:50,555 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsa16a_p7.c that has 1 procedures, 1359 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:31:50,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:31:50,649 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;@754ae10f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:31:50,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:31:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 1359 states, 1357 states have (on average 1.4996315401621223) internal successors, (2035), 1358 states have internal predecessors, (2035), 0 states have call successors, (0), 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-03 18:31:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 18:31:50,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:50,667 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] [2025-03-03 18:31:50,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:50,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:50,673 INFO L85 PathProgramCache]: Analyzing trace with hash 859843656, now seen corresponding path program 1 times [2025-03-03 18:31:50,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:50,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187216238] [2025-03-03 18:31:50,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:50,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:50,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 18:31:50,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 18:31:50,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:50,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:51,357 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-03 18:31:51,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:51,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187216238] [2025-03-03 18:31:51,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187216238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:51,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:51,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:31:51,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401316626] [2025-03-03 18:31:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:51,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:31:51,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:51,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:31:51,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:31:51,382 INFO L87 Difference]: Start difference. First operand has 1359 states, 1357 states have (on average 1.4996315401621223) internal successors, (2035), 1358 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-03 18:31:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:52,196 INFO L93 Difference]: Finished difference Result 2663 states and 3991 transitions. [2025-03-03 18:31:52,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:31:52,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-03 18:31:52,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:52,216 INFO L225 Difference]: With dead ends: 2663 [2025-03-03 18:31:52,216 INFO L226 Difference]: Without dead ends: 1358 [2025-03-03 18:31:52,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:31:52,223 INFO L435 NwaCegarLoop]: 1692 mSDtfsCounter, 0 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5071 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:52,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5071 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:31:52,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-03-03 18:31:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1358. [2025-03-03 18:31:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1357 states have (on average 1.4981577008106117) internal successors, (2033), 1357 states have internal predecessors, (2033), 0 states have call successors, (0), 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-03 18:31:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2033 transitions. [2025-03-03 18:31:52,306 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2033 transitions. Word has length 51 [2025-03-03 18:31:52,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:52,307 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 2033 transitions. [2025-03-03 18:31:52,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-03 18:31:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2033 transitions. [2025-03-03 18:31:52,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 18:31:52,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:52,310 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] [2025-03-03 18:31:52,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:31:52,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:52,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:52,312 INFO L85 PathProgramCache]: Analyzing trace with hash 890030905, now seen corresponding path program 1 times [2025-03-03 18:31:52,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:52,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605615521] [2025-03-03 18:31:52,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:52,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:52,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 18:31:52,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 18:31:52,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:52,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:52,565 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-03 18:31:52,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:52,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605615521] [2025-03-03 18:31:52,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605615521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:52,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:52,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:31:52,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172373302] [2025-03-03 18:31:52,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:52,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:31:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:52,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:31:52,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:31:52,569 INFO L87 Difference]: Start difference. First operand 1358 states and 2033 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-03 18:31:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:53,183 INFO L93 Difference]: Finished difference Result 2664 states and 3989 transitions. [2025-03-03 18:31:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:31:53,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-03 18:31:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:53,188 INFO L225 Difference]: With dead ends: 2664 [2025-03-03 18:31:53,189 INFO L226 Difference]: Without dead ends: 1360 [2025-03-03 18:31:53,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:31:53,191 INFO L435 NwaCegarLoop]: 1692 mSDtfsCounter, 0 mSDsluCounter, 3376 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5068 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:53,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5068 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:31:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2025-03-03 18:31:53,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2025-03-03 18:31:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1359 states have (on average 1.4974245768947756) internal successors, (2035), 1359 states have internal predecessors, (2035), 0 states have call successors, (0), 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-03 18:31:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2035 transitions. [2025-03-03 18:31:53,224 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2035 transitions. Word has length 52 [2025-03-03 18:31:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:53,224 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 2035 transitions. [2025-03-03 18:31:53,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-03 18:31:53,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2035 transitions. [2025-03-03 18:31:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 18:31:53,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:53,227 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-03 18:31:53,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:31:53,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:53,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:53,228 INFO L85 PathProgramCache]: Analyzing trace with hash -542301597, now seen corresponding path program 1 times [2025-03-03 18:31:53,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:53,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982052503] [2025-03-03 18:31:53,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:53,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:53,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 18:31:53,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 18:31:53,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:53,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:53,591 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-03 18:31:53,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:53,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982052503] [2025-03-03 18:31:53,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982052503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:53,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:53,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:31:53,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655742492] [2025-03-03 18:31:53,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:53,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:31:53,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:53,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:31:53,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:53,593 INFO L87 Difference]: Start difference. First operand 1360 states and 2035 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-03 18:31:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:54,635 INFO L93 Difference]: Finished difference Result 2676 states and 4005 transitions. [2025-03-03 18:31:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:31:54,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-03 18:31:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:54,643 INFO L225 Difference]: With dead ends: 2676 [2025-03-03 18:31:54,644 INFO L226 Difference]: Without dead ends: 1370 [2025-03-03 18:31:54,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:54,646 INFO L435 NwaCegarLoop]: 1687 mSDtfsCounter, 6 mSDsluCounter, 8422 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10109 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:54,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10109 Invalid, 2077 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 18:31:54,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-03-03 18:31:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1369. [2025-03-03 18:31:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1368 states have (on average 1.4970760233918128) internal successors, (2048), 1368 states have internal predecessors, (2048), 0 states have call successors, (0), 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-03 18:31:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2048 transitions. [2025-03-03 18:31:54,675 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2048 transitions. Word has length 53 [2025-03-03 18:31:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:54,677 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 2048 transitions. [2025-03-03 18:31:54,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 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-03 18:31:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2048 transitions. [2025-03-03 18:31:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 18:31:54,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:54,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:54,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:31:54,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:54,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:54,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1256785704, now seen corresponding path program 1 times [2025-03-03 18:31:54,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:54,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489059554] [2025-03-03 18:31:54,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:54,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:54,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 18:31:54,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 18:31:54,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:54,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:55,032 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-03 18:31:55,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:55,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489059554] [2025-03-03 18:31:55,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489059554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:55,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:55,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:31:55,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354460320] [2025-03-03 18:31:55,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:55,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:31:55,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:55,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:31:55,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:31:55,035 INFO L87 Difference]: Start difference. First operand 1369 states and 2048 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:55,874 INFO L93 Difference]: Finished difference Result 2694 states and 4031 transitions. [2025-03-03 18:31:55,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:55,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 18:31:55,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:55,879 INFO L225 Difference]: With dead ends: 2694 [2025-03-03 18:31:55,879 INFO L226 Difference]: Without dead ends: 1379 [2025-03-03 18:31:55,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:31:55,882 INFO L435 NwaCegarLoop]: 1691 mSDtfsCounter, 8 mSDsluCounter, 6749 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8440 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:55,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8440 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:31:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-03-03 18:31:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1379. [2025-03-03 18:31:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1378 states have (on average 1.4963715529753265) internal successors, (2062), 1378 states have internal predecessors, (2062), 0 states have call successors, (0), 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-03 18:31:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 2062 transitions. [2025-03-03 18:31:55,905 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 2062 transitions. Word has length 54 [2025-03-03 18:31:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:55,905 INFO L471 AbstractCegarLoop]: Abstraction has 1379 states and 2062 transitions. [2025-03-03 18:31:55,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:31:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2062 transitions. [2025-03-03 18:31:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 18:31:55,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:55,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:55,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:31:55,906 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:55,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:55,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2065627147, now seen corresponding path program 1 times [2025-03-03 18:31:55,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:55,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722133640] [2025-03-03 18:31:55,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:55,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:55,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 18:31:55,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 18:31:55,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:55,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:56,461 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-03 18:31:56,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:56,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722133640] [2025-03-03 18:31:56,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722133640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:56,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:56,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:31:56,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788951580] [2025-03-03 18:31:56,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:56,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:31:56,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:56,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:31:56,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:31:56,464 INFO L87 Difference]: Start difference. First operand 1379 states and 2062 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 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-03 18:31:57,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:57,802 INFO L93 Difference]: Finished difference Result 2714 states and 4058 transitions. [2025-03-03 18:31:57,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:31:57,803 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-03 18:31:57,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:57,808 INFO L225 Difference]: With dead ends: 2714 [2025-03-03 18:31:57,809 INFO L226 Difference]: Without dead ends: 1389 [2025-03-03 18:31:57,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:31:57,812 INFO L435 NwaCegarLoop]: 1678 mSDtfsCounter, 2004 mSDsluCounter, 10053 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 11731 SdHoareTripleChecker+Invalid, 2486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:57,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2004 Valid, 11731 Invalid, 2486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 18:31:57,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2025-03-03 18:31:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1386. [2025-03-03 18:31:57,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1385 states have (on average 1.496028880866426) internal successors, (2072), 1385 states have internal predecessors, (2072), 0 states have call successors, (0), 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-03 18:31:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2072 transitions. [2025-03-03 18:31:57,838 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2072 transitions. Word has length 55 [2025-03-03 18:31:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:57,839 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2072 transitions. [2025-03-03 18:31:57,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 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-03 18:31:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2072 transitions. [2025-03-03 18:31:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 18:31:57,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:57,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:57,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:31:57,841 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:57,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:57,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1338420876, now seen corresponding path program 1 times [2025-03-03 18:31:57,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:57,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999313237] [2025-03-03 18:31:57,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:57,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:57,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 18:31:57,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 18:31:57,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:57,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:58,192 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-03 18:31:58,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:58,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999313237] [2025-03-03 18:31:58,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999313237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:58,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:58,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:31:58,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301557954] [2025-03-03 18:31:58,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:58,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:31:58,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:58,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:31:58,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:31:58,195 INFO L87 Difference]: Start difference. First operand 1386 states and 2072 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 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-03 18:31:59,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:59,068 INFO L93 Difference]: Finished difference Result 2720 states and 4067 transitions. [2025-03-03 18:31:59,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:31:59,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-03 18:31:59,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:59,073 INFO L225 Difference]: With dead ends: 2720 [2025-03-03 18:31:59,074 INFO L226 Difference]: Without dead ends: 1388 [2025-03-03 18:31:59,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:31:59,076 INFO L435 NwaCegarLoop]: 1692 mSDtfsCounter, 2001 mSDsluCounter, 5063 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2001 SdHoareTripleChecker+Valid, 6755 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:59,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2001 Valid, 6755 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 18:31:59,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2025-03-03 18:31:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1388. [2025-03-03 18:31:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1387 states have (on average 1.4953136265320837) internal successors, (2074), 1387 states have internal predecessors, (2074), 0 states have call successors, (0), 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-03 18:31:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2074 transitions. [2025-03-03 18:31:59,098 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2074 transitions. Word has length 55 [2025-03-03 18:31:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:59,098 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 2074 transitions. [2025-03-03 18:31:59,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 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-03 18:31:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2074 transitions. [2025-03-03 18:31:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 18:31:59,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:59,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:59,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:31:59,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:59,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:59,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1268419462, now seen corresponding path program 1 times [2025-03-03 18:31:59,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:59,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104311698] [2025-03-03 18:31:59,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:59,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:59,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 18:31:59,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 18:31:59,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:59,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:31:59,365 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-03 18:31:59,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:31:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104311698] [2025-03-03 18:31:59,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104311698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:31:59,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:31:59,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:31:59,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84394254] [2025-03-03 18:31:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:31:59,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:31:59,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:31:59,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:31:59,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:31:59,367 INFO L87 Difference]: Start difference. First operand 1388 states and 2074 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-03 18:31:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:31:59,782 INFO L93 Difference]: Finished difference Result 2715 states and 4058 transitions. [2025-03-03 18:31:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:31:59,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 18:31:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:31:59,786 INFO L225 Difference]: With dead ends: 2715 [2025-03-03 18:31:59,786 INFO L226 Difference]: Without dead ends: 1381 [2025-03-03 18:31:59,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-03 18:31:59,788 INFO L435 NwaCegarLoop]: 1690 mSDtfsCounter, 2 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:31:59,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3377 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:31:59,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-03-03 18:31:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2025-03-03 18:31:59,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1380 states have (on average 1.4942028985507247) internal successors, (2062), 1380 states have internal predecessors, (2062), 0 states have call successors, (0), 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-03 18:31:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2062 transitions. [2025-03-03 18:31:59,808 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2062 transitions. Word has length 56 [2025-03-03 18:31:59,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:31:59,808 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 2062 transitions. [2025-03-03 18:31:59,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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-03 18:31:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2062 transitions. [2025-03-03 18:31:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 18:31:59,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:31:59,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:31:59,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:31:59,810 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:31:59,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:31:59,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1111760149, now seen corresponding path program 1 times [2025-03-03 18:31:59,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:31:59,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754684666] [2025-03-03 18:31:59,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:31:59,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:31:59,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 18:31:59,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 18:31:59,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:31:59,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:00,078 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-03 18:32:00,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:00,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754684666] [2025-03-03 18:32:00,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754684666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:00,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:00,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:00,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853574780] [2025-03-03 18:32:00,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:00,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:00,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:00,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:00,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:00,081 INFO L87 Difference]: Start difference. First operand 1381 states and 2062 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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-03 18:32:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:00,741 INFO L93 Difference]: Finished difference Result 2967 states and 4424 transitions. [2025-03-03 18:32:00,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:00,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 18:32:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:00,746 INFO L225 Difference]: With dead ends: 2967 [2025-03-03 18:32:00,746 INFO L226 Difference]: Without dead ends: 1640 [2025-03-03 18:32:00,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:00,748 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 2685 mSDsluCounter, 3350 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2685 SdHoareTripleChecker+Valid, 5027 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:00,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2685 Valid, 5027 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:32:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2025-03-03 18:32:00,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1423. [2025-03-03 18:32:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1422 states have (on average 1.4908579465541492) internal successors, (2120), 1422 states have internal predecessors, (2120), 0 states have call successors, (0), 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-03 18:32:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2120 transitions. [2025-03-03 18:32:00,770 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 2120 transitions. Word has length 56 [2025-03-03 18:32:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:00,770 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 2120 transitions. [2025-03-03 18:32:00,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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-03 18:32:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2120 transitions. [2025-03-03 18:32:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 18:32:00,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:00,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:00,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:32:00,771 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:00,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:00,772 INFO L85 PathProgramCache]: Analyzing trace with hash 471093462, now seen corresponding path program 1 times [2025-03-03 18:32:00,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:00,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636593403] [2025-03-03 18:32:00,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:00,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:00,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 18:32:00,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 18:32:00,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:00,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:01,282 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-03 18:32:01,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:01,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636593403] [2025-03-03 18:32:01,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636593403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:01,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:01,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:32:01,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827822056] [2025-03-03 18:32:01,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:01,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:32:01,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:01,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:32:01,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:32:01,284 INFO L87 Difference]: Start difference. First operand 1423 states and 2120 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:02,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:02,495 INFO L93 Difference]: Finished difference Result 3039 states and 4530 transitions. [2025-03-03 18:32:02,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:32:02,496 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-03 18:32:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:02,500 INFO L225 Difference]: With dead ends: 3039 [2025-03-03 18:32:02,500 INFO L226 Difference]: Without dead ends: 1712 [2025-03-03 18:32:02,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:32:02,503 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 2916 mSDsluCounter, 8717 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2916 SdHoareTripleChecker+Valid, 10390 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:02,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2916 Valid, 10390 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 18:32:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2025-03-03 18:32:02,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1427. [2025-03-03 18:32:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.4901823281907434) internal successors, (2125), 1426 states have internal predecessors, (2125), 0 states have call successors, (0), 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-03 18:32:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2125 transitions. [2025-03-03 18:32:02,525 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 2125 transitions. Word has length 57 [2025-03-03 18:32:02,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:02,526 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 2125 transitions. [2025-03-03 18:32:02,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:32:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2125 transitions. [2025-03-03 18:32:02,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 18:32:02,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:02,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:02,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:32:02,527 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:02,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:02,530 INFO L85 PathProgramCache]: Analyzing trace with hash -765945682, now seen corresponding path program 1 times [2025-03-03 18:32:02,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:02,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372911503] [2025-03-03 18:32:02,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:02,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:02,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 18:32:02,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 18:32:02,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:02,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:02,765 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-03 18:32:02,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:02,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372911503] [2025-03-03 18:32:02,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372911503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:02,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:02,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:02,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274027918] [2025-03-03 18:32:02,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:02,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:02,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:02,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:02,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:02,767 INFO L87 Difference]: Start difference. First operand 1427 states and 2125 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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-03 18:32:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:03,471 INFO L93 Difference]: Finished difference Result 2794 states and 4161 transitions. [2025-03-03 18:32:03,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:03,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 18:32:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:03,475 INFO L225 Difference]: With dead ends: 2794 [2025-03-03 18:32:03,475 INFO L226 Difference]: Without dead ends: 1443 [2025-03-03 18:32:03,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:32:03,477 INFO L435 NwaCegarLoop]: 1687 mSDtfsCounter, 2011 mSDsluCounter, 5051 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 6738 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:03,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 6738 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:32:03,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2025-03-03 18:32:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1435. [2025-03-03 18:32:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1434 states have (on average 1.49023709902371) internal successors, (2137), 1434 states have internal predecessors, (2137), 0 states have call successors, (0), 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-03 18:32:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 2137 transitions. [2025-03-03 18:32:03,497 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 2137 transitions. Word has length 58 [2025-03-03 18:32:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:03,497 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 2137 transitions. [2025-03-03 18:32:03,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 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-03 18:32:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2137 transitions. [2025-03-03 18:32:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 18:32:03,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:03,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:03,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:32:03,498 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:03,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:03,498 INFO L85 PathProgramCache]: Analyzing trace with hash -662551760, now seen corresponding path program 1 times [2025-03-03 18:32:03,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:03,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631999274] [2025-03-03 18:32:03,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:03,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:03,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 18:32:03,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 18:32:03,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:03,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:03,643 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-03 18:32:03,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:03,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631999274] [2025-03-03 18:32:03,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631999274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:03,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:03,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:03,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567757408] [2025-03-03 18:32:03,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:03,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:03,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:03,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:03,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:03,645 INFO L87 Difference]: Start difference. First operand 1435 states and 2137 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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-03 18:32:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:04,326 INFO L93 Difference]: Finished difference Result 2997 states and 4464 transitions. [2025-03-03 18:32:04,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:04,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 18:32:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:04,330 INFO L225 Difference]: With dead ends: 2997 [2025-03-03 18:32:04,330 INFO L226 Difference]: Without dead ends: 1622 [2025-03-03 18:32:04,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:04,333 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 2696 mSDsluCounter, 3289 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2696 SdHoareTripleChecker+Valid, 4937 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:04,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2696 Valid, 4937 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:32:04,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2025-03-03 18:32:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1410. [2025-03-03 18:32:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1409 states have (on average 1.4904187366926898) internal successors, (2100), 1409 states have internal predecessors, (2100), 0 states have call successors, (0), 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-03 18:32:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2100 transitions. [2025-03-03 18:32:04,353 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2100 transitions. Word has length 59 [2025-03-03 18:32:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:04,353 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 2100 transitions. [2025-03-03 18:32:04,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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-03 18:32:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2100 transitions. [2025-03-03 18:32:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-03-03 18:32:04,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:04,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:04,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:32:04,362 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:04,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:04,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1565782034, now seen corresponding path program 1 times [2025-03-03 18:32:04,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:04,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61092478] [2025-03-03 18:32:04,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:04,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:04,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-03 18:32:10,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-03 18:32:10,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:10,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:13,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:13,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61092478] [2025-03-03 18:32:13,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61092478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:13,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:13,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:13,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84161444] [2025-03-03 18:32:13,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:13,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:13,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:13,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:13,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:13,991 INFO L87 Difference]: Start difference. First operand 1410 states and 2100 transitions. Second operand has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 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-03 18:32:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:14,617 INFO L93 Difference]: Finished difference Result 3009 states and 4487 transitions. [2025-03-03 18:32:14,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:14,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 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 709 [2025-03-03 18:32:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:14,622 INFO L225 Difference]: With dead ends: 3009 [2025-03-03 18:32:14,622 INFO L226 Difference]: Without dead ends: 1678 [2025-03-03 18:32:14,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:32:14,624 INFO L435 NwaCegarLoop]: 1649 mSDtfsCounter, 2841 mSDsluCounter, 3295 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2841 SdHoareTripleChecker+Valid, 4944 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:14,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2841 Valid, 4944 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:32:14,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2025-03-03 18:32:14,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1418. [2025-03-03 18:32:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1417 states have (on average 1.487649964714185) internal successors, (2108), 1417 states have internal predecessors, (2108), 0 states have call successors, (0), 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-03 18:32:14,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2108 transitions. [2025-03-03 18:32:14,641 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2108 transitions. Word has length 709 [2025-03-03 18:32:14,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:14,641 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 2108 transitions. [2025-03-03 18:32:14,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 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-03 18:32:14,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2108 transitions. [2025-03-03 18:32:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-03 18:32:14,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:14,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:14,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 18:32:14,651 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:14,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash -340449381, now seen corresponding path program 1 times [2025-03-03 18:32:14,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:14,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108221235] [2025-03-03 18:32:14,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:14,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:14,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-03 18:32:19,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-03 18:32:19,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:19,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:22,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:22,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108221235] [2025-03-03 18:32:22,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108221235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:22,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:22,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:32:22,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128300698] [2025-03-03 18:32:22,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:22,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:32:22,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:22,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:32:22,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:32:22,332 INFO L87 Difference]: Start difference. First operand 1418 states and 2108 transitions. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 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-03 18:32:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:23,000 INFO L93 Difference]: Finished difference Result 3009 states and 4486 transitions. [2025-03-03 18:32:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:32:23,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 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 710 [2025-03-03 18:32:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:23,004 INFO L225 Difference]: With dead ends: 3009 [2025-03-03 18:32:23,004 INFO L226 Difference]: Without dead ends: 1678 [2025-03-03 18:32:23,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:32:23,005 INFO L435 NwaCegarLoop]: 1649 mSDtfsCounter, 2837 mSDsluCounter, 3295 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2837 SdHoareTripleChecker+Valid, 4944 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:23,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2837 Valid, 4944 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:32:23,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2025-03-03 18:32:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1419. [2025-03-03 18:32:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1418 states have (on average 1.4873060648801129) internal successors, (2109), 1418 states have internal predecessors, (2109), 0 states have call successors, (0), 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-03 18:32:23,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2109 transitions. [2025-03-03 18:32:23,020 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2109 transitions. Word has length 710 [2025-03-03 18:32:23,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:23,020 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 2109 transitions. [2025-03-03 18:32:23,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 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-03 18:32:23,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2109 transitions. [2025-03-03 18:32:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2025-03-03 18:32:23,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:23,029 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:23,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 18:32:23,029 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:23,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:23,030 INFO L85 PathProgramCache]: Analyzing trace with hash 985345724, now seen corresponding path program 1 times [2025-03-03 18:32:23,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:23,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570114769] [2025-03-03 18:32:23,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:23,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:23,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-03-03 18:32:29,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-03-03 18:32:29,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:29,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 18:32:31,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:31,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570114769] [2025-03-03 18:32:31,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570114769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:32:31,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624884292] [2025-03-03 18:32:31,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:31,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:31,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:31,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:32:31,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:32:32,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-03-03 18:32:35,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-03-03 18:32:35,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:35,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:35,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 4622 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 18:32:35,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:32:37,636 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:37,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:32:37,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624884292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:37,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:32:37,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2025-03-03 18:32:37,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645005719] [2025-03-03 18:32:37,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:37,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:32:37,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:37,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:32:37,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-03 18:32:37,639 INFO L87 Difference]: Start difference. First operand 1419 states and 2109 transitions. Second operand has 9 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 0 states have call successors, (0), 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-03 18:32:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:39,743 INFO L93 Difference]: Finished difference Result 5209 states and 7775 transitions. [2025-03-03 18:32:39,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:32:39,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 0 states have call successors, (0), 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 711 [2025-03-03 18:32:39,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:39,753 INFO L225 Difference]: With dead ends: 5209 [2025-03-03 18:32:39,753 INFO L226 Difference]: Without dead ends: 3878 [2025-03-03 18:32:39,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:32:39,756 INFO L435 NwaCegarLoop]: 1612 mSDtfsCounter, 4972 mSDsluCounter, 9403 mSDsCounter, 0 mSdLazyCounter, 5201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4972 SdHoareTripleChecker+Valid, 11015 SdHoareTripleChecker+Invalid, 5201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:39,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4972 Valid, 11015 Invalid, 5201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5201 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 18:32:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2025-03-03 18:32:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 2552. [2025-03-03 18:32:39,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2551 states have (on average 1.4907879263034105) internal successors, (3803), 2551 states have internal predecessors, (3803), 0 states have call successors, (0), 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-03 18:32:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3803 transitions. [2025-03-03 18:32:39,787 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3803 transitions. Word has length 711 [2025-03-03 18:32:39,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:39,788 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3803 transitions. [2025-03-03 18:32:39,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 79.0) internal successors, (711), 9 states have internal predecessors, (711), 0 states have call successors, (0), 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-03 18:32:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3803 transitions. [2025-03-03 18:32:39,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2025-03-03 18:32:39,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:39,796 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:39,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 18:32:39,996 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-03 18:32:39,997 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:39,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1781175121, now seen corresponding path program 1 times [2025-03-03 18:32:39,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:39,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875667478] [2025-03-03 18:32:39,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:39,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:40,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 712 statements into 1 equivalence classes. [2025-03-03 18:32:42,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 712 of 712 statements. [2025-03-03 18:32:42,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:42,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:45,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:45,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875667478] [2025-03-03 18:32:45,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875667478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:45,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:32:45,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:32:45,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915765848] [2025-03-03 18:32:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:45,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:32:45,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:45,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:32:45,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:32:45,139 INFO L87 Difference]: Start difference. First operand 2552 states and 3803 transitions. Second operand has 6 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 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-03 18:32:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:45,879 INFO L93 Difference]: Finished difference Result 5220 states and 7790 transitions. [2025-03-03 18:32:45,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:32:45,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 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 712 [2025-03-03 18:32:45,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:45,886 INFO L225 Difference]: With dead ends: 5220 [2025-03-03 18:32:45,886 INFO L226 Difference]: Without dead ends: 2756 [2025-03-03 18:32:45,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:32:45,888 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 2534 mSDsluCounter, 4863 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2534 SdHoareTripleChecker+Valid, 6487 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:45,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2534 Valid, 6487 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:32:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2025-03-03 18:32:45,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 2738. [2025-03-03 18:32:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2738 states, 2737 states have (on average 1.4906832298136645) internal successors, (4080), 2737 states have internal predecessors, (4080), 0 states have call successors, (0), 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-03 18:32:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 4080 transitions. [2025-03-03 18:32:45,914 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 4080 transitions. Word has length 712 [2025-03-03 18:32:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:45,914 INFO L471 AbstractCegarLoop]: Abstraction has 2738 states and 4080 transitions. [2025-03-03 18:32:45,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 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-03 18:32:45,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 4080 transitions. [2025-03-03 18:32:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2025-03-03 18:32:45,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:45,920 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:32:45,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 18:32:45,920 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:32:45,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:32:45,921 INFO L85 PathProgramCache]: Analyzing trace with hash 847213583, now seen corresponding path program 1 times [2025-03-03 18:32:45,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:32:45,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388532989] [2025-03-03 18:32:45,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:45,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:32:46,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 712 statements into 1 equivalence classes. [2025-03-03 18:32:51,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 712 of 712 statements. [2025-03-03 18:32:51,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:51,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 18:32:54,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:32:54,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388532989] [2025-03-03 18:32:54,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388532989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:32:54,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594666251] [2025-03-03 18:32:54,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:32:54,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:32:54,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:32:54,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:32:54,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:32:55,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 712 statements into 1 equivalence classes. [2025-03-03 18:32:58,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 712 of 712 statements. [2025-03-03 18:32:58,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:32:58,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:32:58,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 4623 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 18:32:58,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:32:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:32:58,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:32:58,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594666251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:32:58,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:32:58,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-03-03 18:32:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879056073] [2025-03-03 18:32:58,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:32:58,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:32:58,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:32:58,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:32:58,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-03 18:32:58,612 INFO L87 Difference]: Start difference. First operand 2738 states and 4080 transitions. Second operand has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 0 states have call successors, (0), 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-03 18:32:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:32:59,952 INFO L93 Difference]: Finished difference Result 5664 states and 8442 transitions. [2025-03-03 18:32:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:32:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 0 states have call successors, (0), 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 712 [2025-03-03 18:32:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:32:59,958 INFO L225 Difference]: With dead ends: 5664 [2025-03-03 18:32:59,958 INFO L226 Difference]: Without dead ends: 3022 [2025-03-03 18:32:59,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 707 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-03-03 18:32:59,961 INFO L435 NwaCegarLoop]: 1361 mSDtfsCounter, 2648 mSDsluCounter, 6790 mSDsCounter, 0 mSdLazyCounter, 4027 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2648 SdHoareTripleChecker+Valid, 8151 SdHoareTripleChecker+Invalid, 4029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:32:59,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2648 Valid, 8151 Invalid, 4029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4027 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 18:32:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2025-03-03 18:32:59,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 2802. [2025-03-03 18:32:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2802 states, 2801 states have (on average 1.4866119243127454) internal successors, (4164), 2801 states have internal predecessors, (4164), 0 states have call successors, (0), 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-03 18:32:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4164 transitions. [2025-03-03 18:32:59,986 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 4164 transitions. Word has length 712 [2025-03-03 18:32:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:32:59,986 INFO L471 AbstractCegarLoop]: Abstraction has 2802 states and 4164 transitions. [2025-03-03 18:32:59,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 0 states have call successors, (0), 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-03 18:32:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 4164 transitions. [2025-03-03 18:32:59,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2025-03-03 18:32:59,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:32:59,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:33:00,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 18:33:00,192 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,SelfDestructingSolverStorable15 [2025-03-03 18:33:00,192 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:33:00,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:33:00,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2138598616, now seen corresponding path program 1 times [2025-03-03 18:33:00,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:33:00,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864494836] [2025-03-03 18:33:00,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:33:00,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:33:00,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 713 statements into 1 equivalence classes.