./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal31.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.cal31.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 556ee5f077e44a10f79de84b7855b160129225c107bd30004497880f626c8ee1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:06:32,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:06:32,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:06:32,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:06:32,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:06:32,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:06:32,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:06:32,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:06:32,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:06:32,865 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:06:32,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:06:32,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:06:32,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:06:32,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:06:32,865 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:06:32,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:06:32,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:06:32,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:06:32,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:06:32,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:06:32,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:06:32,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:06:32,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:06:32,867 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 -> 556ee5f077e44a10f79de84b7855b160129225c107bd30004497880f626c8ee1 [2025-03-03 17:06:33,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:06:33,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:06:33,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:06:33,084 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:06:33,084 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:06:33,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal31.c [2025-03-03 17:06:34,179 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45c6710a/123a7e3375ce4d24a5f7cd4817da415a/FLAG046e147c2 [2025-03-03 17:06:34,574 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:06:34,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal31.c [2025-03-03 17:06:34,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45c6710a/123a7e3375ce4d24a5f7cd4817da415a/FLAG046e147c2 [2025-03-03 17:06:34,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45c6710a/123a7e3375ce4d24a5f7cd4817da415a [2025-03-03 17:06:34,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:06:34,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:06:34,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:06:34,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:06:34,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:06:34,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:06:34" (1/1) ... [2025-03-03 17:06:34,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7fc280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:34, skipping insertion in model container [2025-03-03 17:06:34,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:06:34" (1/1) ... [2025-03-03 17:06:34,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:06:34,929 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.cal31.c[1245,1258] [2025-03-03 17:06:35,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:06:35,770 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:06:35,779 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.cal31.c[1245,1258] [2025-03-03 17:06:36,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:06:36,282 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:06:36,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:36 WrapperNode [2025-03-03 17:06:36,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:06:36,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:06:36,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:06:36,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:06:36,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:36" (1/1) ... [2025-03-03 17:06:36,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:36" (1/1) ... [2025-03-03 17:06:38,718 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34302 [2025-03-03 17:06:38,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:06:38,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:06:38,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:06:38,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:06:38,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:36" (1/1) ... [2025-03-03 17:06:38,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:36" (1/1) ... [2025-03-03 17:06:39,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:36" (1/1) ... [2025-03-03 17:06:40,354 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-03 17:06:40,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:36" (1/1) ... [2025-03-03 17:06:40,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:36" (1/1) ... [2025-03-03 17:06:41,025 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:36" (1/1) ... [2025-03-03 17:06:41,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:36" (1/1) ... [2025-03-03 17:06:41,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:36" (1/1) ... [2025-03-03 17:06:41,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:36" (1/1) ... [2025-03-03 17:06:41,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:06:41,769 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:06:41,769 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:06:41,769 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:06:41,770 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:36" (1/1) ... [2025-03-03 17:06:41,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:06:41,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:06:41,794 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 17:06:41,796 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 17:06:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:06:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:06:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 17:06:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:06:41,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:06:42,864 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:06:42,866 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:07:44,157 INFO L? ?]: Removed 18657 outVars from TransFormulas that were not future-live. [2025-03-03 17:07:44,157 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:07:44,710 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:07:44,711 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:07:44,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:07:44 BoogieIcfgContainer [2025-03-03 17:07:44,712 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:07:44,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:07:44,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:07:44,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:07:44,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:06:34" (1/3) ... [2025-03-03 17:07:44,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bff153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:07:44, skipping insertion in model container [2025-03-03 17:07:44,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:06:36" (2/3) ... [2025-03-03 17:07:44,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bff153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:07:44, skipping insertion in model container [2025-03-03 17:07:44,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:07:44" (3/3) ... [2025-03-03 17:07:44,719 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal31.c [2025-03-03 17:07:44,732 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:07:44,734 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal31.c that has 1 procedures, 11950 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:07:45,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:07:45,032 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;@324d8399, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:07:45,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:07:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 11950 states, 11948 states have (on average 1.5004184800803482) internal successors, (17927), 11949 states have internal predecessors, (17927), 0 states have call successors, (0), 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 17:07:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 17:07:45,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:07:45,067 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, 1, 1, 1, 1, 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 17:07:45,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:07:45,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:07:45,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2114456252, now seen corresponding path program 1 times [2025-03-03 17:07:45,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:07:45,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857196495] [2025-03-03 17:07:45,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:07:45,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:07:45,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 17:07:45,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 17:07:45,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:07:45,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:07:45,902 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 17:07:45,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:07:45,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857196495] [2025-03-03 17:07:45,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857196495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:07:45,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:07:45,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:07:45,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20820019] [2025-03-03 17:07:45,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:07:45,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:07:45,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:07:45,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:07:45,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:07:45,945 INFO L87 Difference]: Start difference. First operand has 11950 states, 11948 states have (on average 1.5004184800803482) internal successors, (17927), 11949 states have internal predecessors, (17927), 0 states have call successors, (0), 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 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 17:07:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:07:49,879 INFO L93 Difference]: Finished difference Result 23817 states and 35733 transitions. [2025-03-03 17:07:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:07:49,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-03 17:07:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:07:49,933 INFO L225 Difference]: With dead ends: 23817 [2025-03-03 17:07:49,933 INFO L226 Difference]: Without dead ends: 11949 [2025-03-03 17:07:49,954 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 17:07:49,957 INFO L435 NwaCegarLoop]: 14939 mSDtfsCounter, 0 mSDsluCounter, 29873 mSDsCounter, 0 mSdLazyCounter, 8956 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44812 SdHoareTripleChecker+Invalid, 8956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-03 17:07:49,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44812 Invalid, 8956 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 8956 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-03 17:07:49,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11949 states. [2025-03-03 17:07:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11949 to 11949. [2025-03-03 17:07:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11949 states, 11948 states have (on average 1.500251088048209) internal successors, (17925), 11948 states have internal predecessors, (17925), 0 states have call successors, (0), 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 17:07:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11949 states to 11949 states and 17925 transitions. [2025-03-03 17:07:50,255 INFO L78 Accepts]: Start accepts. Automaton has 11949 states and 17925 transitions. Word has length 87 [2025-03-03 17:07:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:07:50,257 INFO L471 AbstractCegarLoop]: Abstraction has 11949 states and 17925 transitions. [2025-03-03 17:07:50,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 17:07:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 11949 states and 17925 transitions. [2025-03-03 17:07:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 17:07:50,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:07:50,260 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, 1, 1, 1, 1, 1, 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 17:07:50,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:07:50,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:07:50,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:07:50,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1128334128, now seen corresponding path program 1 times [2025-03-03 17:07:50,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:07:50,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875373399] [2025-03-03 17:07:50,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:07:50,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:07:50,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 17:07:50,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 17:07:50,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:07:50,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:07:50,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 17:07:50,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:07:50,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875373399] [2025-03-03 17:07:50,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875373399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:07:50,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:07:50,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:07:50,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179642220] [2025-03-03 17:07:50,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:07:50,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:07:50,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:07:50,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:07:50,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:07:50,594 INFO L87 Difference]: Start difference. First operand 11949 states and 17925 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 17:07:54,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:07:54,139 INFO L93 Difference]: Finished difference Result 23818 states and 35731 transitions. [2025-03-03 17:07:54,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:07:54,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-03 17:07:54,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:07:54,169 INFO L225 Difference]: With dead ends: 23818 [2025-03-03 17:07:54,169 INFO L226 Difference]: Without dead ends: 11951 [2025-03-03 17:07:54,181 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 17:07:54,182 INFO L435 NwaCegarLoop]: 14939 mSDtfsCounter, 0 mSDsluCounter, 29870 mSDsCounter, 0 mSdLazyCounter, 8959 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44809 SdHoareTripleChecker+Invalid, 8959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:07:54,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44809 Invalid, 8959 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 8959 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 17:07:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11951 states. [2025-03-03 17:07:54,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11951 to 11951. [2025-03-03 17:07:54,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11951 states, 11950 states have (on average 1.5001673640167363) internal successors, (17927), 11950 states have internal predecessors, (17927), 0 states have call successors, (0), 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 17:07:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11951 states to 11951 states and 17927 transitions. [2025-03-03 17:07:54,368 INFO L78 Accepts]: Start accepts. Automaton has 11951 states and 17927 transitions. Word has length 88 [2025-03-03 17:07:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:07:54,368 INFO L471 AbstractCegarLoop]: Abstraction has 11951 states and 17927 transitions. [2025-03-03 17:07:54,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 17:07:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 11951 states and 17927 transitions. [2025-03-03 17:07:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 17:07:54,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:07:54,371 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, 1, 1, 1, 1, 1, 1, 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 17:07:54,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:07:54,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:07:54,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:07:54,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1744817865, now seen corresponding path program 1 times [2025-03-03 17:07:54,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:07:54,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330787131] [2025-03-03 17:07:54,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:07:54,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:07:54,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 17:07:54,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 17:07:54,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:07:54,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:07:54,875 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 17:07:54,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:07:54,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330787131] [2025-03-03 17:07:54,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330787131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:07:54,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:07:54,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:07:54,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281271892] [2025-03-03 17:07:54,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:07:54,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:07:54,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:07:54,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:07:54,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:07:54,878 INFO L87 Difference]: Start difference. First operand 11951 states and 17927 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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 17:07:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:07:59,916 INFO L93 Difference]: Finished difference Result 23913 states and 35867 transitions. [2025-03-03 17:07:59,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:07:59,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-03 17:07:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:07:59,936 INFO L225 Difference]: With dead ends: 23913 [2025-03-03 17:07:59,936 INFO L226 Difference]: Without dead ends: 12044 [2025-03-03 17:07:59,948 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 17:07:59,949 INFO L435 NwaCegarLoop]: 14887 mSDtfsCounter, 18119 mSDsluCounter, 44662 mSDsCounter, 0 mSdLazyCounter, 12143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18119 SdHoareTripleChecker+Valid, 59549 SdHoareTripleChecker+Invalid, 12143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-03 17:07:59,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18119 Valid, 59549 Invalid, 12143 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 12143 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-03 17:07:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12044 states. [2025-03-03 17:08:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12044 to 12025. [2025-03-03 17:08:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12025 states, 12024 states have (on average 1.5000831669993346) internal successors, (18037), 12024 states have internal predecessors, (18037), 0 states have call successors, (0), 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 17:08:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12025 states to 12025 states and 18037 transitions. [2025-03-03 17:08:00,106 INFO L78 Accepts]: Start accepts. Automaton has 12025 states and 18037 transitions. Word has length 89 [2025-03-03 17:08:00,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:08:00,107 INFO L471 AbstractCegarLoop]: Abstraction has 12025 states and 18037 transitions. [2025-03-03 17:08:00,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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 17:08:00,108 INFO L276 IsEmpty]: Start isEmpty. Operand 12025 states and 18037 transitions. [2025-03-03 17:08:00,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 17:08:00,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:08:00,109 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, 1, 1, 1, 1, 1, 1, 1, 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 17:08:00,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:08:00,109 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:08:00,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:08:00,110 INFO L85 PathProgramCache]: Analyzing trace with hash -661363147, now seen corresponding path program 1 times [2025-03-03 17:08:00,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:08:00,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136831987] [2025-03-03 17:08:00,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:08:00,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:08:00,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 17:08:00,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 17:08:00,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:08:00,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:08:00,525 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 17:08:00,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:08:00,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136831987] [2025-03-03 17:08:00,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136831987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:08:00,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:08:00,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:08:00,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388532989] [2025-03-03 17:08:00,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:08:00,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:08:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:08:00,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:08:00,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:08:00,528 INFO L87 Difference]: Start difference. First operand 12025 states and 18037 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)