./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/eca-rers2012/Problem14_label09.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b3a5c95c10076386b15606d0ac6559403dceee57f74bca8a711eb692be2f98e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:46:50,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:46:50,454 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:46:50,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:46:50,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:46:50,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:46:50,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:46:50,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:46:50,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:46:50,479 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:46:50,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:46:50,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:46:50,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:46:50,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:46:50,481 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:46:50,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:46:50,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:46:50,481 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:46:50,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:46:50,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:46:50,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:46:50,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:46:50,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:46:50,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:46:50,482 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:46:50,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:46:50,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:46:50,482 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:46:50,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:46:50,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:46:50,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:46:50,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:46:50,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:46:50,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:46:50,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:46:50,483 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:46:50,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:46:50,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:46:50,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:46:50,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:46:50,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:46:50,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:46:50,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:46:50,484 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b3a5c95c10076386b15606d0ac6559403dceee57f74bca8a711eb692be2f98e [2025-03-03 10:46:50,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:46:50,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:46:50,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:46:50,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:46:50,731 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:46:50,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label09.c [2025-03-03 10:46:51,864 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1a01cbe/74eeb81d63b1461589fc20ca70c9aeb1/FLAGc393fc0ef [2025-03-03 10:46:51,903 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-03-03 10:46:52,176 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:46:52,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label09.c [2025-03-03 10:46:52,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1a01cbe/74eeb81d63b1461589fc20ca70c9aeb1/FLAGc393fc0ef [2025-03-03 10:46:52,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c1a01cbe/74eeb81d63b1461589fc20ca70c9aeb1 [2025-03-03 10:46:52,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:46:52,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:46:52,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:46:52,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:46:52,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:46:52,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:46:52" (1/1) ... [2025-03-03 10:46:52,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1816b03d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52, skipping insertion in model container [2025-03-03 10:46:52,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:46:52" (1/1) ... [2025-03-03 10:46:52,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:46:52,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label09.c[4722,4735] [2025-03-03 10:46:52,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:46:52,557 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:46:52,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label09.c[4722,4735] [2025-03-03 10:46:52,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:46:52,676 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:46:52,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52 WrapperNode [2025-03-03 10:46:52,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:46:52,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:46:52,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:46:52,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:46:52,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52" (1/1) ... [2025-03-03 10:46:52,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52" (1/1) ... [2025-03-03 10:46:52,755 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-03 10:46:52,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:46:52,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:46:52,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:46:52,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:46:52,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52" (1/1) ... [2025-03-03 10:46:52,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52" (1/1) ... [2025-03-03 10:46:52,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52" (1/1) ... [2025-03-03 10:46:52,799 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 10:46:52,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52" (1/1) ... [2025-03-03 10:46:52,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52" (1/1) ... [2025-03-03 10:46:52,820 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52" (1/1) ... [2025-03-03 10:46:52,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52" (1/1) ... [2025-03-03 10:46:52,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52" (1/1) ... [2025-03-03 10:46:52,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52" (1/1) ... [2025-03-03 10:46:52,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:46:52,847 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:46:52,847 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:46:52,847 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:46:52,848 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52" (1/1) ... [2025-03-03 10:46:52,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:46:52,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:52,877 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 10:46:52,883 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 10:46:52,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:46:52,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:46:52,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:46:52,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:46:52,950 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:46:52,951 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:46:53,903 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-03 10:46:53,903 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:46:53,920 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:46:53,921 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:46:53,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:53 BoogieIcfgContainer [2025-03-03 10:46:53,922 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:46:53,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:46:53,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:46:53,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:46:53,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:46:52" (1/3) ... [2025-03-03 10:46:53,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9848dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:46:53, skipping insertion in model container [2025-03-03 10:46:53,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:52" (2/3) ... [2025-03-03 10:46:53,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9848dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:46:53, skipping insertion in model container [2025-03-03 10:46:53,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:53" (3/3) ... [2025-03-03 10:46:53,928 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label09.c [2025-03-03 10:46:53,941 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:46:53,943 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label09.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:46:53,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:46:54,003 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;@116ea711, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:46:54,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:46:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 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 10:46:54,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 10:46:54,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:54,016 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] [2025-03-03 10:46:54,016 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:54,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:54,021 INFO L85 PathProgramCache]: Analyzing trace with hash -836132359, now seen corresponding path program 1 times [2025-03-03 10:46:54,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:54,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276710905] [2025-03-03 10:46:54,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:54,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:54,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 10:46:54,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 10:46:54,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:54,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:54,375 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 10:46:54,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:54,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276710905] [2025-03-03 10:46:54,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276710905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:54,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:54,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:54,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195927206] [2025-03-03 10:46:54,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:54,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:46:54,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:54,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:46:54,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:46:54,397 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 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 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 10:46:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:55,660 INFO L93 Difference]: Finished difference Result 850 states and 1554 transitions. [2025-03-03 10:46:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:46:55,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-03-03 10:46:55,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:55,675 INFO L225 Difference]: With dead ends: 850 [2025-03-03 10:46:55,675 INFO L226 Difference]: Without dead ends: 538 [2025-03-03 10:46:55,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:46:55,679 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 499 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:55,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 194 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:46:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-03 10:46:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-03-03 10:46:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.4487895716945995) internal successors, (778), 537 states have internal predecessors, (778), 0 states have call successors, (0), 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 10:46:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2025-03-03 10:46:55,743 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 45 [2025-03-03 10:46:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:55,744 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2025-03-03 10:46:55,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 10:46:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2025-03-03 10:46:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 10:46:55,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:55,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:46:55,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:46:55,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:55,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:55,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1444331329, now seen corresponding path program 1 times [2025-03-03 10:46:55,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:55,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299208567] [2025-03-03 10:46:55,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:55,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:55,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 10:46:55,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 10:46:55,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:55,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:46:56,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:56,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299208567] [2025-03-03 10:46:56,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299208567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:56,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:56,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:56,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748331582] [2025-03-03 10:46:56,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:56,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:46:56,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:56,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:46:56,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:46:56,067 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 10:46:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:56,858 INFO L93 Difference]: Finished difference Result 1281 states and 1978 transitions. [2025-03-03 10:46:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:46:56,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-03 10:46:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:56,864 INFO L225 Difference]: With dead ends: 1281 [2025-03-03 10:46:56,864 INFO L226 Difference]: Without dead ends: 894 [2025-03-03 10:46:56,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:46:56,866 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 116 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:56,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 119 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:46:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-03-03 10:46:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 716. [2025-03-03 10:46:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.220979020979021) internal successors, (873), 715 states have internal predecessors, (873), 0 states have call successors, (0), 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 10:46:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 873 transitions. [2025-03-03 10:46:56,891 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 873 transitions. Word has length 125 [2025-03-03 10:46:56,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:56,891 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 873 transitions. [2025-03-03 10:46:56,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 10:46:56,892 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 873 transitions. [2025-03-03 10:46:56,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 10:46:56,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:56,895 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:56,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:46:56,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:56,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:56,896 INFO L85 PathProgramCache]: Analyzing trace with hash 641933998, now seen corresponding path program 1 times [2025-03-03 10:46:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:56,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684028094] [2025-03-03 10:46:56,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:56,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:56,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 10:46:56,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 10:46:56,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:56,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:46:57,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:57,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684028094] [2025-03-03 10:46:57,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684028094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:57,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738169951] [2025-03-03 10:46:57,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:57,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:57,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:57,365 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 10:46:57,366 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 10:46:57,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 10:46:57,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 10:46:57,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:57,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:57,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:46:57,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-03 10:46:57,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:57,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738169951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:57,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:57,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 10:46:57,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725088463] [2025-03-03 10:46:57,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:57,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:57,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:57,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:57,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:57,667 INFO L87 Difference]: Start difference. First operand 716 states and 873 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 10:46:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:58,172 INFO L93 Difference]: Finished difference Result 1608 states and 2071 transitions. [2025-03-03 10:46:58,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:58,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 216 [2025-03-03 10:46:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:58,182 INFO L225 Difference]: With dead ends: 1608 [2025-03-03 10:46:58,182 INFO L226 Difference]: Without dead ends: 1072 [2025-03-03 10:46:58,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:58,185 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:58,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 47 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:46:58,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-03-03 10:46:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2025-03-03 10:46:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.2156862745098038) internal successors, (1302), 1071 states have internal predecessors, (1302), 0 states have call successors, (0), 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 10:46:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1302 transitions. [2025-03-03 10:46:58,205 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1302 transitions. Word has length 216 [2025-03-03 10:46:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:58,206 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1302 transitions. [2025-03-03 10:46:58,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 10:46:58,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1302 transitions. [2025-03-03 10:46:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 10:46:58,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:58,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:58,218 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 10:46:58,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:58,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:58,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:58,413 INFO L85 PathProgramCache]: Analyzing trace with hash 382230815, now seen corresponding path program 1 times [2025-03-03 10:46:58,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:58,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822067252] [2025-03-03 10:46:58,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:58,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:58,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 10:46:58,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 10:46:58,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:58,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:46:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:58,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822067252] [2025-03-03 10:46:58,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822067252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:58,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:58,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274110948] [2025-03-03 10:46:58,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:58,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:58,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:58,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:58,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:58,605 INFO L87 Difference]: Start difference. First operand 1072 states and 1302 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 10:46:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:59,047 INFO L93 Difference]: Finished difference Result 2498 states and 3070 transitions. [2025-03-03 10:46:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:59,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2025-03-03 10:46:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:59,053 INFO L225 Difference]: With dead ends: 2498 [2025-03-03 10:46:59,053 INFO L226 Difference]: Without dead ends: 1606 [2025-03-03 10:46:59,054 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 10:46:59,055 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:59,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 77 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:46:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-03-03 10:46:59,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-03-03 10:46:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.168847352024922) internal successors, (1876), 1605 states have internal predecessors, (1876), 0 states have call successors, (0), 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 10:46:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1876 transitions. [2025-03-03 10:46:59,082 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1876 transitions. Word has length 219 [2025-03-03 10:46:59,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:59,083 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1876 transitions. [2025-03-03 10:46:59,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 10:46:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1876 transitions. [2025-03-03 10:46:59,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-03 10:46:59,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:59,086 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:59,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:46:59,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:59,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:59,087 INFO L85 PathProgramCache]: Analyzing trace with hash -969559128, now seen corresponding path program 1 times [2025-03-03 10:46:59,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:59,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050365922] [2025-03-03 10:46:59,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:59,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:59,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-03 10:46:59,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-03 10:46:59,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:59,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-03-03 10:46:59,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:59,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050365922] [2025-03-03 10:46:59,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050365922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:59,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:59,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:59,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764079341] [2025-03-03 10:46:59,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:59,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:46:59,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:59,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:46:59,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:46:59,345 INFO L87 Difference]: Start difference. First operand 1606 states and 1876 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 10:46:59,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:59,832 INFO L93 Difference]: Finished difference Result 3061 states and 3636 transitions. [2025-03-03 10:46:59,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:46:59,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 336 [2025-03-03 10:46:59,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:59,837 INFO L225 Difference]: With dead ends: 3061 [2025-03-03 10:46:59,838 INFO L226 Difference]: Without dead ends: 1784 [2025-03-03 10:46:59,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:46:59,839 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:59,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 17 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:46:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-03-03 10:46:59,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1606. [2025-03-03 10:46:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1196261682242992) internal successors, (1797), 1605 states have internal predecessors, (1797), 0 states have call successors, (0), 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 10:46:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1797 transitions. [2025-03-03 10:46:59,862 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1797 transitions. Word has length 336 [2025-03-03 10:46:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:59,862 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1797 transitions. [2025-03-03 10:46:59,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 10:46:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1797 transitions. [2025-03-03 10:46:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-03-03 10:46:59,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:59,866 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:46:59,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:46:59,866 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:59,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:59,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1715454, now seen corresponding path program 1 times [2025-03-03 10:46:59,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:59,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551415663] [2025-03-03 10:46:59,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:59,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:59,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-03 10:46:59,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-03 10:46:59,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:59,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-03 10:47:00,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:00,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551415663] [2025-03-03 10:47:00,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551415663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:00,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944924044] [2025-03-03 10:47:00,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:00,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:00,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:00,250 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 10:47:00,252 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 10:47:00,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-03 10:47:00,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-03 10:47:00,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:00,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:00,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:47:00,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-03-03 10:47:00,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:00,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944924044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:00,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:00,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:47:00,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959685568] [2025-03-03 10:47:00,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:00,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:00,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:00,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:00,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:47:00,766 INFO L87 Difference]: Start difference. First operand 1606 states and 1797 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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 10:47:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:01,128 INFO L93 Difference]: Finished difference Result 2320 states and 2566 transitions. [2025-03-03 10:47:01,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:01,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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 425 [2025-03-03 10:47:01,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:01,134 INFO L225 Difference]: With dead ends: 2320 [2025-03-03 10:47:01,135 INFO L226 Difference]: Without dead ends: 2318 [2025-03-03 10:47:01,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:47:01,136 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:01,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 11 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:47:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-03-03 10:47:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1428. [2025-03-03 10:47:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.0939032936229853) internal successors, (1561), 1427 states have internal predecessors, (1561), 0 states have call successors, (0), 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 10:47:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1561 transitions. [2025-03-03 10:47:01,159 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1561 transitions. Word has length 425 [2025-03-03 10:47:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:01,159 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1561 transitions. [2025-03-03 10:47:01,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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 10:47:01,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1561 transitions. [2025-03-03 10:47:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-03 10:47:01,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:01,167 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:01,178 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 10:47:01,367 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,SelfDestructingSolverStorable5 [2025-03-03 10:47:01,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:01,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:01,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1603548225, now seen corresponding path program 1 times [2025-03-03 10:47:01,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:01,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168440294] [2025-03-03 10:47:01,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:01,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:01,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-03 10:47:01,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-03 10:47:01,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:01,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:47:01,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:01,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168440294] [2025-03-03 10:47:01,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168440294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:01,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:01,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:01,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617200772] [2025-03-03 10:47:01,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:01,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:01,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:01,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:01,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:01,736 INFO L87 Difference]: Start difference. First operand 1428 states and 1561 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 10:47:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:02,135 INFO L93 Difference]: Finished difference Result 3210 states and 3559 transitions. [2025-03-03 10:47:02,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:02,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 431 [2025-03-03 10:47:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:02,141 INFO L225 Difference]: With dead ends: 3210 [2025-03-03 10:47:02,141 INFO L226 Difference]: Without dead ends: 1962 [2025-03-03 10:47:02,142 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 10:47:02,143 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:02,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 245 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-03-03 10:47:02,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1606. [2025-03-03 10:47:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.0841121495327102) internal successors, (1740), 1605 states have internal predecessors, (1740), 0 states have call successors, (0), 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 10:47:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1740 transitions. [2025-03-03 10:47:02,166 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1740 transitions. Word has length 431 [2025-03-03 10:47:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:02,167 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1740 transitions. [2025-03-03 10:47:02,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 10:47:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1740 transitions. [2025-03-03 10:47:02,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-03-03 10:47:02,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:02,171 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:02,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:47:02,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:02,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1134604210, now seen corresponding path program 1 times [2025-03-03 10:47:02,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:02,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715354997] [2025-03-03 10:47:02,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:02,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:02,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-03 10:47:02,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-03 10:47:02,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:02,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:47:02,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:02,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715354997] [2025-03-03 10:47:02,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715354997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:02,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:02,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:02,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631495332] [2025-03-03 10:47:02,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:02,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:02,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:02,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:02,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:02,472 INFO L87 Difference]: Start difference. First operand 1606 states and 1740 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 10:47:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:02,848 INFO L93 Difference]: Finished difference Result 3566 states and 3917 transitions. [2025-03-03 10:47:02,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:02,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 438 [2025-03-03 10:47:02,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:02,853 INFO L225 Difference]: With dead ends: 3566 [2025-03-03 10:47:02,854 INFO L226 Difference]: Without dead ends: 2140 [2025-03-03 10:47:02,855 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 10:47:02,855 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:02,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 220 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:02,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-03-03 10:47:02,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2025-03-03 10:47:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.0877103518612952) internal successors, (2133), 1961 states have internal predecessors, (2133), 0 states have call successors, (0), 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 10:47:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2133 transitions. [2025-03-03 10:47:02,881 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2133 transitions. Word has length 438 [2025-03-03 10:47:02,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:02,882 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2133 transitions. [2025-03-03 10:47:02,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 10:47:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2133 transitions. [2025-03-03 10:47:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-03 10:47:02,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:02,887 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:02,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:47:02,887 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:02,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:02,887 INFO L85 PathProgramCache]: Analyzing trace with hash -42883671, now seen corresponding path program 1 times [2025-03-03 10:47:02,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:02,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717190096] [2025-03-03 10:47:02,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:02,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:02,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-03 10:47:02,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-03 10:47:02,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:02,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 491 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:47:03,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:03,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717190096] [2025-03-03 10:47:03,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717190096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:03,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:03,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:03,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279767774] [2025-03-03 10:47:03,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:03,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:03,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:03,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:03,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:03,078 INFO L87 Difference]: Start difference. First operand 1962 states and 2133 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 10:47:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:03,476 INFO L93 Difference]: Finished difference Result 4634 states and 5094 transitions. [2025-03-03 10:47:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:03,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 479 [2025-03-03 10:47:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:03,484 INFO L225 Difference]: With dead ends: 4634 [2025-03-03 10:47:03,484 INFO L226 Difference]: Without dead ends: 2852 [2025-03-03 10:47:03,486 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 10:47:03,486 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:03,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 52 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:03,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2025-03-03 10:47:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2674. [2025-03-03 10:47:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.081556303778526) internal successors, (2891), 2673 states have internal predecessors, (2891), 0 states have call successors, (0), 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 10:47:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2891 transitions. [2025-03-03 10:47:03,521 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2891 transitions. Word has length 479 [2025-03-03 10:47:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:03,521 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 2891 transitions. [2025-03-03 10:47:03,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 10:47:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2891 transitions. [2025-03-03 10:47:03,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-03 10:47:03,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:03,528 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-03 10:47:03,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:47:03,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:03,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:03,529 INFO L85 PathProgramCache]: Analyzing trace with hash -266627585, now seen corresponding path program 1 times [2025-03-03 10:47:03,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:03,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536905102] [2025-03-03 10:47:03,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:03,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-03-03 10:47:03,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-03-03 10:47:03,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:03,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-03 10:47:03,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:03,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536905102] [2025-03-03 10:47:03,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536905102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:03,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:03,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:03,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951779487] [2025-03-03 10:47:03,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:03,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:03,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:03,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:03,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:03,904 INFO L87 Difference]: Start difference. First operand 2674 states and 2891 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 10:47:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:04,303 INFO L93 Difference]: Finished difference Result 5702 states and 6241 transitions. [2025-03-03 10:47:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:04,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 593 [2025-03-03 10:47:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:04,313 INFO L225 Difference]: With dead ends: 5702 [2025-03-03 10:47:04,313 INFO L226 Difference]: Without dead ends: 3208 [2025-03-03 10:47:04,317 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 10:47:04,317 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:04,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 240 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2025-03-03 10:47:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3208. [2025-03-03 10:47:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.078578110383536) internal successors, (3459), 3207 states have internal predecessors, (3459), 0 states have call successors, (0), 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 10:47:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3459 transitions. [2025-03-03 10:47:04,377 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3459 transitions. Word has length 593 [2025-03-03 10:47:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:04,377 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 3459 transitions. [2025-03-03 10:47:04,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 10:47:04,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3459 transitions. [2025-03-03 10:47:04,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2025-03-03 10:47:04,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:04,382 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:04,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:47:04,382 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:04,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash -691033245, now seen corresponding path program 1 times [2025-03-03 10:47:04,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:04,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488840378] [2025-03-03 10:47:04,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:04,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes. [2025-03-03 10:47:04,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements. [2025-03-03 10:47:04,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:04,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 1084 proven. 104 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2025-03-03 10:47:04,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:04,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488840378] [2025-03-03 10:47:04,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488840378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:04,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158543599] [2025-03-03 10:47:04,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:04,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:04,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:04,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:47:04,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:47:04,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes. [2025-03-03 10:47:04,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements. [2025-03-03 10:47:04,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:04,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:04,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:47:05,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2025-03-03 10:47:05,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:05,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158543599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:05,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:05,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:47:05,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307379341] [2025-03-03 10:47:05,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:05,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:05,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:05,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:05,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:47:05,063 INFO L87 Difference]: Start difference. First operand 3208 states and 3459 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 10:47:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:05,418 INFO L93 Difference]: Finished difference Result 4456 states and 4793 transitions. [2025-03-03 10:47:05,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:05,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 624 [2025-03-03 10:47:05,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:05,431 INFO L225 Difference]: With dead ends: 4456 [2025-03-03 10:47:05,431 INFO L226 Difference]: Without dead ends: 4454 [2025-03-03 10:47:05,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:47:05,433 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 157 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:05,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 11 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:47:05,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-03-03 10:47:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 3208. [2025-03-03 10:47:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.078578110383536) internal successors, (3459), 3207 states have internal predecessors, (3459), 0 states have call successors, (0), 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 10:47:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3459 transitions. [2025-03-03 10:47:05,481 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3459 transitions. Word has length 624 [2025-03-03 10:47:05,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:05,482 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 3459 transitions. [2025-03-03 10:47:05,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 10:47:05,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3459 transitions. [2025-03-03 10:47:05,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2025-03-03 10:47:05,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:05,486 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 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] [2025-03-03 10:47:05,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:47:05,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:05,686 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:05,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:05,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1231190524, now seen corresponding path program 1 times [2025-03-03 10:47:05,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:05,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662658855] [2025-03-03 10:47:05,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:05,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:05,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 634 statements into 1 equivalence classes. [2025-03-03 10:47:05,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 634 of 634 statements. [2025-03-03 10:47:05,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:05,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:47:05,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:05,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662658855] [2025-03-03 10:47:05,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662658855] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:05,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102270363] [2025-03-03 10:47:05,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:05,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:05,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:05,991 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:47:05,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:47:06,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 634 statements into 1 equivalence classes. [2025-03-03 10:47:06,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 634 of 634 statements. [2025-03-03 10:47:06,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:06,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:06,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:47:06,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:47:06,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:47:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:47:06,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102270363] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:47:06,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:47:06,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 10:47:06,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371957295] [2025-03-03 10:47:06,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:47:06,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:47:06,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:06,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:47:06,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:47:06,605 INFO L87 Difference]: Start difference. First operand 3208 states and 3459 transitions. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 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 10:47:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:07,338 INFO L93 Difference]: Finished difference Result 7838 states and 8472 transitions. [2025-03-03 10:47:07,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:47:07,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 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 634 [2025-03-03 10:47:07,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:07,349 INFO L225 Difference]: With dead ends: 7838 [2025-03-03 10:47:07,350 INFO L226 Difference]: Without dead ends: 4810 [2025-03-03 10:47:07,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1270 GetRequests, 1266 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:47:07,354 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 197 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:07,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 60 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:47:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-03-03 10:47:07,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3920. [2025-03-03 10:47:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.07374330186272) internal successors, (4208), 3919 states have internal predecessors, (4208), 0 states have call successors, (0), 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 10:47:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4208 transitions. [2025-03-03 10:47:07,430 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4208 transitions. Word has length 634 [2025-03-03 10:47:07,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:07,430 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 4208 transitions. [2025-03-03 10:47:07,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 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 10:47:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4208 transitions. [2025-03-03 10:47:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-03-03 10:47:07,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:07,438 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-03 10:47:07,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 10:47:07,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:07,639 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:07,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1687236240, now seen corresponding path program 1 times [2025-03-03 10:47:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:07,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113140611] [2025-03-03 10:47:07,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:07,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-03-03 10:47:07,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-03-03 10:47:07,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:07,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1545 backedges. 1111 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2025-03-03 10:47:07,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:07,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113140611] [2025-03-03 10:47:07,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113140611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:07,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:07,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:07,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372005508] [2025-03-03 10:47:07,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:07,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:07,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:07,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:07,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:07,972 INFO L87 Difference]: Start difference. First operand 3920 states and 4208 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 10:47:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:08,291 INFO L93 Difference]: Finished difference Result 8016 states and 8610 transitions. [2025-03-03 10:47:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:08,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 644 [2025-03-03 10:47:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:08,300 INFO L225 Difference]: With dead ends: 8016 [2025-03-03 10:47:08,300 INFO L226 Difference]: Without dead ends: 4276 [2025-03-03 10:47:08,303 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 10:47:08,303 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:08,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 243 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:47:08,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2025-03-03 10:47:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2025-03-03 10:47:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.065263157894737) internal successors, (4554), 4275 states have internal predecessors, (4554), 0 states have call successors, (0), 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 10:47:08,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4554 transitions. [2025-03-03 10:47:08,352 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4554 transitions. Word has length 644 [2025-03-03 10:47:08,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:08,352 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4554 transitions. [2025-03-03 10:47:08,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 10:47:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4554 transitions. [2025-03-03 10:47:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2025-03-03 10:47:08,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:08,357 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 10:47:08,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:47:08,357 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:08,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2006225551, now seen corresponding path program 1 times [2025-03-03 10:47:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828471425] [2025-03-03 10:47:08,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:08,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 762 statements into 1 equivalence classes. [2025-03-03 10:47:08,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 762 of 762 statements. [2025-03-03 10:47:08,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:08,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1716 backedges. 755 proven. 258 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 10:47:09,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:09,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828471425] [2025-03-03 10:47:09,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828471425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:09,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793844680] [2025-03-03 10:47:09,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:09,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:09,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:09,115 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:47:09,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:47:09,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 762 statements into 1 equivalence classes. [2025-03-03 10:47:09,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 762 of 762 statements. [2025-03-03 10:47:09,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:09,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:09,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:47:09,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1716 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2025-03-03 10:47:09,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:09,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793844680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:09,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:09,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-03 10:47:09,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509885241] [2025-03-03 10:47:09,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:09,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:47:09,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:09,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:47:09,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:47:09,933 INFO L87 Difference]: Start difference. First operand 4276 states and 4554 transitions. Second operand has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:47:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:10,449 INFO L93 Difference]: Finished difference Result 8906 states and 9508 transitions. [2025-03-03 10:47:10,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:10,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 762 [2025-03-03 10:47:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:10,460 INFO L225 Difference]: With dead ends: 8906 [2025-03-03 10:47:10,460 INFO L226 Difference]: Without dead ends: 4632 [2025-03-03 10:47:10,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:47:10,464 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:10,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 49 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:47:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-03-03 10:47:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2025-03-03 10:47:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0583876038625646) internal successors, (4713), 4453 states have internal predecessors, (4713), 0 states have call successors, (0), 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 10:47:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4713 transitions. [2025-03-03 10:47:10,505 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4713 transitions. Word has length 762 [2025-03-03 10:47:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:10,505 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4713 transitions. [2025-03-03 10:47:10,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:47:10,506 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4713 transitions. [2025-03-03 10:47:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2025-03-03 10:47:10,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:10,510 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 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] [2025-03-03 10:47:10,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:47:10,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 10:47:10,711 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:10,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:10,711 INFO L85 PathProgramCache]: Analyzing trace with hash 675683149, now seen corresponding path program 1 times [2025-03-03 10:47:10,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:10,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139151974] [2025-03-03 10:47:10,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:10,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:10,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 801 statements into 1 equivalence classes. [2025-03-03 10:47:10,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 801 of 801 statements. [2025-03-03 10:47:10,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:10,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1166 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-03 10:47:11,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139151974] [2025-03-03 10:47:11,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139151974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:11,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492727727] [2025-03-03 10:47:11,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:11,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:11,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:11,756 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:47:11,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:47:11,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 801 statements into 1 equivalence classes. [2025-03-03 10:47:11,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 801 of 801 statements. [2025-03-03 10:47:11,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:11,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:11,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:47:11,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1302 proven. 489 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2025-03-03 10:47:12,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:47:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1238 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-03 10:47:13,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492727727] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:13,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:47:13,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 10 [2025-03-03 10:47:13,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47875066] [2025-03-03 10:47:13,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:13,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:47:13,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:13,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:47:13,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:47:13,311 INFO L87 Difference]: Start difference. First operand 4454 states and 4713 transitions. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 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 10:47:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:13,732 INFO L93 Difference]: Finished difference Result 9084 states and 9635 transitions. [2025-03-03 10:47:13,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:13,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 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 801 [2025-03-03 10:47:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:13,739 INFO L225 Difference]: With dead ends: 9084 [2025-03-03 10:47:13,739 INFO L226 Difference]: Without dead ends: 4810 [2025-03-03 10:47:13,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1605 GetRequests, 1596 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:47:13,742 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 304 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:13,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 10 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:13,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-03-03 10:47:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2025-03-03 10:47:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.0595983588857698) internal successors, (4907), 4631 states have internal predecessors, (4907), 0 states have call successors, (0), 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 10:47:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4907 transitions. [2025-03-03 10:47:13,776 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4907 transitions. Word has length 801 [2025-03-03 10:47:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:13,777 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 4907 transitions. [2025-03-03 10:47:13,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 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 10:47:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4907 transitions. [2025-03-03 10:47:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2025-03-03 10:47:13,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:13,782 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:13,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 10:47:13,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 10:47:13,982 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:13,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:13,983 INFO L85 PathProgramCache]: Analyzing trace with hash 39190471, now seen corresponding path program 1 times [2025-03-03 10:47:13,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:13,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965808477] [2025-03-03 10:47:13,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:13,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:14,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 834 statements into 1 equivalence classes. [2025-03-03 10:47:14,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 834 of 834 statements. [2025-03-03 10:47:14,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:14,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2218 backedges. 1202 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-03 10:47:14,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:14,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965808477] [2025-03-03 10:47:14,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965808477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:14,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070144236] [2025-03-03 10:47:14,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:14,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:14,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:14,864 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:47:14,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 10:47:14,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 834 statements into 1 equivalence classes. [2025-03-03 10:47:15,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 834 of 834 statements. [2025-03-03 10:47:15,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:15,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:15,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 10:47:15,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2218 backedges. 915 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2025-03-03 10:47:15,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:15,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070144236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:15,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:15,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-03-03 10:47:15,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931471549] [2025-03-03 10:47:15,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:15,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:47:15,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:15,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:47:15,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:47:15,220 INFO L87 Difference]: Start difference. First operand 4632 states and 4907 transitions. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 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 10:47:15,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:15,725 INFO L93 Difference]: Finished difference Result 10686 states and 11329 transitions. [2025-03-03 10:47:15,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:15,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 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 834 [2025-03-03 10:47:15,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:15,736 INFO L225 Difference]: With dead ends: 10686 [2025-03-03 10:47:15,736 INFO L226 Difference]: Without dead ends: 6234 [2025-03-03 10:47:15,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 833 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:47:15,741 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 179 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:15,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 60 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:47:15,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2025-03-03 10:47:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 5344. [2025-03-03 10:47:15,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5344 states, 5343 states have (on average 1.059142803668351) internal successors, (5659), 5343 states have internal predecessors, (5659), 0 states have call successors, (0), 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 10:47:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5659 transitions. [2025-03-03 10:47:15,790 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5659 transitions. Word has length 834 [2025-03-03 10:47:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:15,790 INFO L471 AbstractCegarLoop]: Abstraction has 5344 states and 5659 transitions. [2025-03-03 10:47:15,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 4 states have internal predecessors, (367), 0 states have call successors, (0), 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 10:47:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5659 transitions. [2025-03-03 10:47:15,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2025-03-03 10:47:15,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:15,797 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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 10:47:15,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 10:47:15,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:15,997 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:15,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:15,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1950356620, now seen corresponding path program 1 times [2025-03-03 10:47:15,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:15,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497150445] [2025-03-03 10:47:15,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:15,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:16,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 900 statements into 1 equivalence classes. [2025-03-03 10:47:16,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 900 of 900 statements. [2025-03-03 10:47:16,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:16,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 1049 proven. 325 refuted. 0 times theorem prover too weak. 1168 trivial. 0 not checked. [2025-03-03 10:47:16,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:16,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497150445] [2025-03-03 10:47:16,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497150445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:16,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029624640] [2025-03-03 10:47:16,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:16,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:16,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:16,752 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:47:16,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 10:47:16,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 900 statements into 1 equivalence classes. [2025-03-03 10:47:16,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 900 of 900 statements. [2025-03-03 10:47:16,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:16,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:16,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:47:16,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 1240 proven. 0 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2025-03-03 10:47:18,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:18,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029624640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:18,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:18,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:47:18,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730314774] [2025-03-03 10:47:18,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:18,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:47:18,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:18,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:47:18,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:47:18,866 INFO L87 Difference]: Start difference. First operand 5344 states and 5659 transitions. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:47:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:19,265 INFO L93 Difference]: Finished difference Result 10773 states and 11410 transitions. [2025-03-03 10:47:19,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:47:19,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 900 [2025-03-03 10:47:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:19,273 INFO L225 Difference]: With dead ends: 10773 [2025-03-03 10:47:19,273 INFO L226 Difference]: Without dead ends: 5402 [2025-03-03 10:47:19,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:47:19,277 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 102 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:19,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 50 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:47:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2025-03-03 10:47:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5166. [2025-03-03 10:47:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 5165 states have (on average 1.05188770571152) internal successors, (5433), 5165 states have internal predecessors, (5433), 0 states have call successors, (0), 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 10:47:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5433 transitions. [2025-03-03 10:47:19,319 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5433 transitions. Word has length 900 [2025-03-03 10:47:19,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:19,320 INFO L471 AbstractCegarLoop]: Abstraction has 5166 states and 5433 transitions. [2025-03-03 10:47:19,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:47:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5433 transitions. [2025-03-03 10:47:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2025-03-03 10:47:19,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:19,326 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:47:19,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 10:47:19,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 10:47:19,530 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:19,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:19,530 INFO L85 PathProgramCache]: Analyzing trace with hash 84242109, now seen corresponding path program 1 times [2025-03-03 10:47:19,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:19,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424686462] [2025-03-03 10:47:19,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:19,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:19,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 994 statements into 1 equivalence classes. [2025-03-03 10:47:19,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 994 of 994 statements. [2025-03-03 10:47:19,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:19,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2803 backedges. 713 proven. 339 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2025-03-03 10:47:20,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:20,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424686462] [2025-03-03 10:47:20,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424686462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:47:20,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68906229] [2025-03-03 10:47:20,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:20,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:47:20,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:20,124 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:47:20,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 10:47:20,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 994 statements into 1 equivalence classes. [2025-03-03 10:47:20,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 994 of 994 statements. [2025-03-03 10:47:20,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:20,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:20,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:47:20,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:47:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2803 backedges. 1052 proven. 0 refuted. 0 times theorem prover too weak. 1751 trivial. 0 not checked. [2025-03-03 10:47:20,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:47:20,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68906229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:20,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:47:20,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:47:20,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981100245] [2025-03-03 10:47:20,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:20,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:20,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:20,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:20,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:47:20,453 INFO L87 Difference]: Start difference. First operand 5166 states and 5433 transitions. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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 10:47:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:20,808 INFO L93 Difference]: Finished difference Result 10508 states and 11098 transitions. [2025-03-03 10:47:20,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:20,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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 994 [2025-03-03 10:47:20,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:20,815 INFO L225 Difference]: With dead ends: 10508 [2025-03-03 10:47:20,815 INFO L226 Difference]: Without dead ends: 5522 [2025-03-03 10:47:20,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 997 GetRequests, 993 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:47:20,820 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 36 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:20,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 232 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:47:20,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2025-03-03 10:47:20,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 4988. [2025-03-03 10:47:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4988 states, 4987 states have (on average 1.0489272107479446) internal successors, (5231), 4987 states have internal predecessors, (5231), 0 states have call successors, (0), 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 10:47:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5231 transitions. [2025-03-03 10:47:20,861 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5231 transitions. Word has length 994 [2025-03-03 10:47:20,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:20,862 INFO L471 AbstractCegarLoop]: Abstraction has 4988 states and 5231 transitions. [2025-03-03 10:47:20,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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 10:47:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5231 transitions. [2025-03-03 10:47:20,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1394 [2025-03-03 10:47:20,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:20,871 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:20,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 10:47:21,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 10:47:21,072 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:21,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:21,073 INFO L85 PathProgramCache]: Analyzing trace with hash 697657166, now seen corresponding path program 1 times [2025-03-03 10:47:21,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:21,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840440665] [2025-03-03 10:47:21,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:21,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:21,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1393 statements into 1 equivalence classes. [2025-03-03 10:47:21,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1393 of 1393 statements. [2025-03-03 10:47:21,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:21,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5988 backedges. 1412 proven. 0 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2025-03-03 10:47:21,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:21,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840440665] [2025-03-03 10:47:21,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840440665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:21,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:21,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:47:21,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701473488] [2025-03-03 10:47:21,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:21,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:47:21,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:21,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:47:21,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:47:21,852 INFO L87 Difference]: Start difference. First operand 4988 states and 5231 transitions. Second operand has 5 states, 5 states have (on average 66.4) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 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 10:47:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:22,428 INFO L93 Difference]: Finished difference Result 10532 states and 11052 transitions. [2025-03-03 10:47:22,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:47:22,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.4) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 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 1393 [2025-03-03 10:47:22,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:22,436 INFO L225 Difference]: With dead ends: 10532 [2025-03-03 10:47:22,436 INFO L226 Difference]: Without dead ends: 5700 [2025-03-03 10:47:22,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:47:22,441 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 116 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:22,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 23 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:47:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2025-03-03 10:47:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5522. [2025-03-03 10:47:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5522 states, 5521 states have (on average 1.046006158304655) internal successors, (5775), 5521 states have internal predecessors, (5775), 0 states have call successors, (0), 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 10:47:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5775 transitions. [2025-03-03 10:47:22,504 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5775 transitions. Word has length 1393 [2025-03-03 10:47:22,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:22,505 INFO L471 AbstractCegarLoop]: Abstraction has 5522 states and 5775 transitions. [2025-03-03 10:47:22,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.4) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 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 10:47:22,505 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5775 transitions. [2025-03-03 10:47:22,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1545 [2025-03-03 10:47:22,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:22,521 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:22,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:47:22,521 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:22,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:22,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1525292673, now seen corresponding path program 1 times [2025-03-03 10:47:22,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:22,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889427403] [2025-03-03 10:47:22,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:22,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:22,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1544 statements into 1 equivalence classes. [2025-03-03 10:47:22,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1544 of 1544 statements. [2025-03-03 10:47:22,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:22,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7350 backedges. 1773 proven. 0 refuted. 0 times theorem prover too weak. 5577 trivial. 0 not checked. [2025-03-03 10:47:23,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:23,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889427403] [2025-03-03 10:47:23,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889427403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:23,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:23,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:23,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037451348] [2025-03-03 10:47:23,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:23,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:23,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:23,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:23,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:23,231 INFO L87 Difference]: Start difference. First operand 5522 states and 5775 transitions. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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 10:47:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:23,570 INFO L93 Difference]: Finished difference Result 12110 states and 12633 transitions. [2025-03-03 10:47:23,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:23,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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 1544 [2025-03-03 10:47:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:23,574 INFO L225 Difference]: With dead ends: 12110 [2025-03-03 10:47:23,574 INFO L226 Difference]: Without dead ends: 4098 [2025-03-03 10:47:23,578 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 10:47:23,578 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 38 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:23,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 243 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:47:23,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2025-03-03 10:47:23,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2025-03-03 10:47:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.025384427629973) internal successors, (4201), 4097 states have internal predecessors, (4201), 0 states have call successors, (0), 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 10:47:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4201 transitions. [2025-03-03 10:47:23,610 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4201 transitions. Word has length 1544 [2025-03-03 10:47:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:23,611 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4201 transitions. [2025-03-03 10:47:23,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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 10:47:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4201 transitions. [2025-03-03 10:47:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1670 [2025-03-03 10:47:23,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:23,624 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:23,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:47:23,624 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:23,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:23,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1314183225, now seen corresponding path program 1 times [2025-03-03 10:47:23,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:23,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640660879] [2025-03-03 10:47:23,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:23,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:23,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1669 statements into 1 equivalence classes. [2025-03-03 10:47:23,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1669 of 1669 statements. [2025-03-03 10:47:23,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:23,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8717 backedges. 4984 proven. 0 refuted. 0 times theorem prover too weak. 3733 trivial. 0 not checked. [2025-03-03 10:47:24,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:24,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640660879] [2025-03-03 10:47:24,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640660879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:24,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:24,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:47:24,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963021046] [2025-03-03 10:47:24,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:24,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:24,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:24,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:24,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:24,253 INFO L87 Difference]: Start difference. First operand 4098 states and 4201 transitions. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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 10:47:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:47:24,502 INFO L93 Difference]: Finished difference Result 7480 states and 7674 transitions. [2025-03-03 10:47:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:47:24,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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 1669 [2025-03-03 10:47:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:47:24,504 INFO L225 Difference]: With dead ends: 7480 [2025-03-03 10:47:24,504 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:47:24,508 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 10:47:24,509 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:47:24,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 198 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 10:47:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:47:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:47:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:47:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:47:24,510 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1669 [2025-03-03 10:47:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:47:24,511 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:47:24,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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 10:47:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:47:24,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:47:24,514 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:47:24,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:47:24,518 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:47:24,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:47:25,287 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:47:25,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:47:25 BoogieIcfgContainer [2025-03-03 10:47:25,307 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:47:25,307 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:47:25,307 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:47:25,308 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:47:25,311 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:53" (3/4) ... [2025-03-03 10:47:25,312 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:47:25,326 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:47:25,327 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:47:25,327 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:47:25,328 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:47:25,440 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:47:25,440 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:47:25,440 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:47:25,442 INFO L158 Benchmark]: Toolchain (without parser) took 33234.59ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 120.5MB in the beginning and 98.8MB in the end (delta: 21.7MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2025-03-03 10:47:25,442 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:47:25,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.51ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 88.8MB in the end (delta: 31.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 10:47:25,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.21ms. Allocated memory is still 167.8MB. Free memory was 88.8MB in the beginning and 80.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:47:25,443 INFO L158 Benchmark]: Boogie Preprocessor took 90.28ms. Allocated memory is still 167.8MB. Free memory was 80.4MB in the beginning and 68.8MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:47:25,443 INFO L158 Benchmark]: IcfgBuilder took 1074.73ms. Allocated memory is still 167.8MB. Free memory was 68.8MB in the beginning and 114.7MB in the end (delta: -45.9MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2025-03-03 10:47:25,445 INFO L158 Benchmark]: TraceAbstraction took 31383.72ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 114.7MB in the beginning and 111.3MB in the end (delta: 3.4MB). Peak memory consumption was 637.9MB. Max. memory is 16.1GB. [2025-03-03 10:47:25,445 INFO L158 Benchmark]: Witness Printer took 133.05ms. Allocated memory is still 201.3MB. Free memory was 111.3MB in the beginning and 98.8MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:47:25,446 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.51ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 88.8MB in the end (delta: 31.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.21ms. Allocated memory is still 167.8MB. Free memory was 88.8MB in the beginning and 80.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.28ms. Allocated memory is still 167.8MB. Free memory was 80.4MB in the beginning and 68.8MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1074.73ms. Allocated memory is still 167.8MB. Free memory was 68.8MB in the beginning and 114.7MB in the end (delta: -45.9MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * TraceAbstraction took 31383.72ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 114.7MB in the beginning and 111.3MB in the end (delta: 3.4MB). Peak memory consumption was 637.9MB. Max. memory is 16.1GB. * Witness Printer took 133.05ms. Allocated memory is still 201.3MB. Free memory was 111.3MB in the beginning and 98.8MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.5s, OverallIterations: 21, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2680 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2680 mSDsluCounter, 2401 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 138 mSDsCounter, 1507 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12429 IncrementalHoareTripleChecker+Invalid, 13936 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1507 mSolverCounterUnsat, 2263 mSDtfsCounter, 12429 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7695 GetRequests, 7629 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5522occurred in iteration=19, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 6288 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 20296 NumberOfCodeBlocks, 20296 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 21699 ConstructedInterpolants, 115 QuantifiedInterpolants, 73576 SizeOfPredicates, 1 NumberOfNonLiveVariables, 7724 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 32 InterpolantComputations, 20 PerfectInterpolantSequences, 58524/60720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Location Invariant Derived location invariant: (((((((((((((((((((a24 == 1) && (9 <= a15)) && (0 <= ((long long) a12 + 42))) && (((((long long) a12 * 9) >= 0) ? (((long long) a12 * 9) / 10) : ((((long long) a12 * 9) / 10) - 1)) <= 558357)) || ((((a24 == 1) && (7 == a21)) && (((long long) 49 + a12) <= 0)) && (a15 == 8))) || (((((a24 == 1) && (a21 <= 6)) && ((5 < a15) || (a21 != 6))) && (0 <= ((long long) a12 + 42))) && (((((long long) a12 * 9) >= 0) ? (((long long) a12 * 9) / 10) : ((((long long) a12 * 9) / 10) - 1)) <= 558357))) || ((((a12 <= 80) && (a24 == 1)) && (a21 == 9)) && (0 <= ((long long) a12 + 42)))) || (((a12 <= 11) && (a24 == 1)) && (0 <= ((long long) a12 + 42)))) || ((((a21 == 8) && (a24 == 1)) && (a15 <= 7)) && (((((long long) a12 * 9) >= 0) ? (((long long) a12 * 9) / 10) : ((((long long) a12 * 9) / 10) - 1)) <= 558357))) || ((((a12 <= 11) && (6 <= a15)) && (a24 == 1)) && (a15 <= 7))) || ((((a24 == 1) && (a15 <= 8)) && (a21 == 9)) && (((long long) 49 + a12) <= 0))) || ((((a21 == 8) && (a12 <= 73282)) && (a24 == 1)) && (0 <= ((long long) a12 + 42)))) || ((((a24 == 1) && (5 == a15)) && (526013 <= a12)) && (((((long long) a12 * 9) >= 0) ? (((long long) a12 * 9) / 10) : ((((long long) a12 * 9) / 10) - 1)) <= 558357))) || (((a12 <= 11) && (a21 <= 6)) && (a15 <= 7))) || (((((a24 == 1) && (a21 == 9)) && (a15 <= 7)) && (0 <= ((long long) a12 + 42))) && (((((long long) a12 * 9) >= 0) ? (((long long) a12 * 9) / 10) : ((((long long) a12 * 9) / 10) - 1)) <= 558357))) || ((((a24 == 1) && (7 == a21)) && (a15 <= 7)) && (((((long long) a12 * 9) >= 0) ? (((long long) a12 * 9) / 10) : ((((long long) a12 * 9) / 10) - 1)) <= 558357))) || ((((a21 == 8) && (((long long) a12 + 479703) <= 0)) && (a24 == 1)) && (9 <= a15))) || (((a24 == 1) && (10 <= a21)) && (((((long long) a12 * 9) >= 0) ? (((long long) a12 * 9) / 10) : ((((long long) a12 * 9) / 10) - 1)) <= 558357))) || ((((a24 == 1) && (a15 <= 8)) && (a21 <= 6)) && (((long long) 49 + a12) <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:47:25,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE