./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_label53.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 f09951f8169d75602552a0c69d410baacae8493e4742c50eb18d4008647dffd9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:27:18,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:27:18,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:27:18,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:27:18,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:27:18,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:27:18,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:27:18,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:27:18,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:27:18,135 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:27:18,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:27:18,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:27:18,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:27:18,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:27:18,136 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:27:18,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:27:18,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:27:18,137 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:27:18,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:27:18,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:27:18,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:27:18,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:27:18,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:27:18,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:27:18,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:27:18,141 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:27:18,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:27:18,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:27:18,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:27:18,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:27:18,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:27:18,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:27:18,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:27:18,143 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:27:18,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:27:18,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:27:18,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:27:18,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:27:18,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:27:18,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:27:18,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:27:18,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:27:18,147 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> f09951f8169d75602552a0c69d410baacae8493e4742c50eb18d4008647dffd9 [2024-11-08 11:27:18,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:27:18,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:27:18,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:27:18,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:27:18,360 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:27:18,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2024-11-08 11:27:19,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:27:19,559 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException 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) [2024-11-08 11:27:19,744 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:27:19,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2024-11-08 11:27:19,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3b4efa3/ac7e7fa1bcad400fb778eb20467b9d19/FLAG54172f5e6 [2024-11-08 11:27:19,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff3b4efa3/ac7e7fa1bcad400fb778eb20467b9d19 [2024-11-08 11:27:19,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:27:19,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:27:19,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:27:19,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:27:19,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:27:19,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:27:19" (1/1) ... [2024-11-08 11:27:19,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24126645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:19, skipping insertion in model container [2024-11-08 11:27:19,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:27:19" (1/1) ... [2024-11-08 11:27:19,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:27:20,003 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_label53.c[5103,5116] [2024-11-08 11:27:20,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:27:20,141 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:27:20,167 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_label53.c[5103,5116] [2024-11-08 11:27:20,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:27:20,320 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:27:20,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:20 WrapperNode [2024-11-08 11:27:20,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:27:20,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:27:20,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:27:20,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:27:20,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:20" (1/1) ... [2024-11-08 11:27:20,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:20" (1/1) ... [2024-11-08 11:27:20,398 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-11-08 11:27:20,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:27:20,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:27:20,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:27:20,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:27:20,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:20" (1/1) ... [2024-11-08 11:27:20,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:20" (1/1) ... [2024-11-08 11:27:20,412 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:20" (1/1) ... [2024-11-08 11:27:20,447 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]. [2024-11-08 11:27:20,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:20" (1/1) ... [2024-11-08 11:27:20,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:20" (1/1) ... [2024-11-08 11:27:20,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:20" (1/1) ... [2024-11-08 11:27:20,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:20" (1/1) ... [2024-11-08 11:27:20,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:20" (1/1) ... [2024-11-08 11:27:20,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:20" (1/1) ... [2024-11-08 11:27:20,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:27:20,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:27:20,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:27:20,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:27:20,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:20" (1/1) ... [2024-11-08 11:27:20,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:27:20,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:27:20,537 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) [2024-11-08 11:27:20,540 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 [2024-11-08 11:27:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:27:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:27:20,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:27:20,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:27:20,627 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:27:20,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:27:21,520 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-08 11:27:21,520 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:27:21,538 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:27:21,538 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:27:21,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:21 BoogieIcfgContainer [2024-11-08 11:27:21,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:27:21,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:27:21,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:27:21,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:27:21,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:27:19" (1/3) ... [2024-11-08 11:27:21,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6dc770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:27:21, skipping insertion in model container [2024-11-08 11:27:21,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:20" (2/3) ... [2024-11-08 11:27:21,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6dc770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:27:21, skipping insertion in model container [2024-11-08 11:27:21,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:21" (3/3) ... [2024-11-08 11:27:21,547 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label53.c [2024-11-08 11:27:21,562 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:27:21,562 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:27:21,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:27:21,624 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;@52ca2f52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:27:21,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:27:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 11:27:21,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:21,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:27:21,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:21,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:21,641 INFO L85 PathProgramCache]: Analyzing trace with hash 301649817, now seen corresponding path program 1 times [2024-11-08 11:27:21,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:21,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069056228] [2024-11-08 11:27:21,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:21,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:27:21,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069056228] [2024-11-08 11:27:21,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069056228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:21,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:27:21,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:27:21,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975628722] [2024-11-08 11:27:21,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:21,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:27:21,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:21,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:27:21,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:27:21,988 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:23,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:23,100 INFO L93 Difference]: Finished difference Result 852 states and 1560 transitions. [2024-11-08 11:27:23,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:27:23,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-11-08 11:27:23,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:23,112 INFO L225 Difference]: With dead ends: 852 [2024-11-08 11:27:23,112 INFO L226 Difference]: Without dead ends: 538 [2024-11-08 11:27:23,116 INFO L431 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 [2024-11-08 11:27:23,118 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 536 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:23,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 44 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 11:27:23,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-08 11:27:23,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2024-11-08 11:27:23,188 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) [2024-11-08 11:27:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2024-11-08 11:27:23,191 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 49 [2024-11-08 11:27:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:23,191 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2024-11-08 11:27:23,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2024-11-08 11:27:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 11:27:23,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:23,198 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:27:23,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:27:23,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:23,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash -265131167, now seen corresponding path program 1 times [2024-11-08 11:27:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:23,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315680933] [2024-11-08 11:27:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:23,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-08 11:27:23,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:23,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315680933] [2024-11-08 11:27:23,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315680933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:23,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:27:23,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:27:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707222559] [2024-11-08 11:27:23,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:23,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:27:23,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:23,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:27:23,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:27:23,411 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:23,911 INFO L93 Difference]: Finished difference Result 1074 states and 1656 transitions. [2024-11-08 11:27:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:27:23,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 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 197 [2024-11-08 11:27:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:23,913 INFO L225 Difference]: With dead ends: 1074 [2024-11-08 11:27:23,914 INFO L226 Difference]: Without dead ends: 716 [2024-11-08 11:27:23,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:27:23,916 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:23,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:27:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-11-08 11:27:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2024-11-08 11:27:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.353846153846154) internal successors, (968), 715 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2024-11-08 11:27:23,930 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 197 [2024-11-08 11:27:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:23,931 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2024-11-08 11:27:23,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2024-11-08 11:27:23,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-08 11:27:23,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:23,934 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:27:23,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:27:23,934 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:23,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:23,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1568066862, now seen corresponding path program 1 times [2024-11-08 11:27:23,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:23,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540865232] [2024-11-08 11:27:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:23,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 11:27:24,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:24,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540865232] [2024-11-08 11:27:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540865232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:24,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:27:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:27:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111344758] [2024-11-08 11:27:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:24,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:27:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:27:24,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:27:24,174 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:24,751 INFO L93 Difference]: Finished difference Result 1637 states and 2268 transitions. [2024-11-08 11:27:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:27:24,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 220 [2024-11-08 11:27:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:24,757 INFO L225 Difference]: With dead ends: 1637 [2024-11-08 11:27:24,758 INFO L226 Difference]: Without dead ends: 1072 [2024-11-08 11:27:24,759 INFO L431 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 [2024-11-08 11:27:24,760 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 101 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:24,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 114 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:27:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-08 11:27:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 894. [2024-11-08 11:27:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.1724524076147815) internal successors, (1047), 893 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1047 transitions. [2024-11-08 11:27:24,776 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1047 transitions. Word has length 220 [2024-11-08 11:27:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:24,776 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1047 transitions. [2024-11-08 11:27:24,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:24,777 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1047 transitions. [2024-11-08 11:27:24,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-08 11:27:24,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:24,780 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:27:24,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:27:24,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:24,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:24,783 INFO L85 PathProgramCache]: Analyzing trace with hash 555922922, now seen corresponding path program 1 times [2024-11-08 11:27:24,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:24,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994492530] [2024-11-08 11:27:24,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:24,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 204 proven. 130 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-08 11:27:25,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:25,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994492530] [2024-11-08 11:27:25,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994492530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:27:25,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019923105] [2024-11-08 11:27:25,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:25,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:27:25,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:27:25,377 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) [2024-11-08 11:27:25,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:27:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:25,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:27:25,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:27:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-11-08 11:27:25,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:27:25,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019923105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:25,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:27:25,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-08 11:27:25,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169895870] [2024-11-08 11:27:25,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:25,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:27:25,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:25,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:27:25,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:27:25,584 INFO L87 Difference]: Start difference. First operand 894 states and 1047 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:26,026 INFO L93 Difference]: Finished difference Result 2320 states and 2778 transitions. [2024-11-08 11:27:26,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:27:26,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 351 [2024-11-08 11:27:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:26,031 INFO L225 Difference]: With dead ends: 2320 [2024-11-08 11:27:26,031 INFO L226 Difference]: Without dead ends: 1606 [2024-11-08 11:27:26,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:27:26,033 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 132 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:26,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 265 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:27:26,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2024-11-08 11:27:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2024-11-08 11:27:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.1401541695865451) internal successors, (1627), 1427 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1627 transitions. [2024-11-08 11:27:26,059 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1627 transitions. Word has length 351 [2024-11-08 11:27:26,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:26,060 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1627 transitions. [2024-11-08 11:27:26,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1627 transitions. [2024-11-08 11:27:26,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2024-11-08 11:27:26,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:26,066 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:27:26,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 11:27:26,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:27:26,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:26,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:26,270 INFO L85 PathProgramCache]: Analyzing trace with hash 303978021, now seen corresponding path program 1 times [2024-11-08 11:27:26,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:26,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797784411] [2024-11-08 11:27:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:26,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-08 11:27:26,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:26,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797784411] [2024-11-08 11:27:26,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797784411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:26,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:27:26,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:27:26,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278891679] [2024-11-08 11:27:26,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:26,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:27:26,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:26,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:27:26,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:27:26,658 INFO L87 Difference]: Start difference. First operand 1428 states and 1627 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:27,091 INFO L93 Difference]: Finished difference Result 3210 states and 3757 transitions. [2024-11-08 11:27:27,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:27:27,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 450 [2024-11-08 11:27:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:27,096 INFO L225 Difference]: With dead ends: 3210 [2024-11-08 11:27:27,096 INFO L226 Difference]: Without dead ends: 1962 [2024-11-08 11:27:27,097 INFO L431 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 [2024-11-08 11:27:27,098 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 72 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:27,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 77 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:27:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-11-08 11:27:27,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2024-11-08 11:27:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.134043746494672) internal successors, (2022), 1783 states have internal predecessors, (2022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2022 transitions. [2024-11-08 11:27:27,118 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2022 transitions. Word has length 450 [2024-11-08 11:27:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:27,118 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2022 transitions. [2024-11-08 11:27:27,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2022 transitions. [2024-11-08 11:27:27,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2024-11-08 11:27:27,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:27,124 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-08 11:27:27,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:27:27,124 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:27,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1651652833, now seen corresponding path program 1 times [2024-11-08 11:27:27,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:27,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101284388] [2024-11-08 11:27:27,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:27,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-11-08 11:27:27,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:27,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101284388] [2024-11-08 11:27:27,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101284388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:27,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:27:27,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:27:27,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101282919] [2024-11-08 11:27:27,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:27,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:27:27,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:27,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:27:27,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:27:27,515 INFO L87 Difference]: Start difference. First operand 1784 states and 2022 transitions. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:28,111 INFO L93 Difference]: Finished difference Result 3744 states and 4238 transitions. [2024-11-08 11:27:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:27:28,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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 474 [2024-11-08 11:27:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:28,116 INFO L225 Difference]: With dead ends: 3744 [2024-11-08 11:27:28,116 INFO L226 Difference]: Without dead ends: 2140 [2024-11-08 11:27:28,117 INFO L431 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 [2024-11-08 11:27:28,118 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:28,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 90 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:27:28,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2024-11-08 11:27:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2024-11-08 11:27:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.11781206171108) internal successors, (2391), 2139 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2391 transitions. [2024-11-08 11:27:28,140 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2391 transitions. Word has length 474 [2024-11-08 11:27:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:28,141 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2391 transitions. [2024-11-08 11:27:28,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2391 transitions. [2024-11-08 11:27:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2024-11-08 11:27:28,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:28,147 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-11-08 11:27:28,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:27:28,147 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:28,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:28,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1089264344, now seen corresponding path program 1 times [2024-11-08 11:27:28,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:28,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644999451] [2024-11-08 11:27:28,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:28,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-08 11:27:28,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:28,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644999451] [2024-11-08 11:27:28,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644999451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:28,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:27:28,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:27:28,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282504325] [2024-11-08 11:27:28,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:28,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:27:28,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:28,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:27:28,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:27:28,451 INFO L87 Difference]: Start difference. First operand 2140 states and 2391 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:28,925 INFO L93 Difference]: Finished difference Result 4336 states and 4849 transitions. [2024-11-08 11:27:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:27:28,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 530 [2024-11-08 11:27:28,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:28,932 INFO L225 Difference]: With dead ends: 4336 [2024-11-08 11:27:28,932 INFO L226 Difference]: Without dead ends: 2318 [2024-11-08 11:27:28,934 INFO L431 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 [2024-11-08 11:27:28,934 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:28,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 17 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:27:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2024-11-08 11:27:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2024-11-08 11:27:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.0855539971949508) internal successors, (2322), 2139 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2322 transitions. [2024-11-08 11:27:28,957 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2322 transitions. Word has length 530 [2024-11-08 11:27:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:28,957 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2322 transitions. [2024-11-08 11:27:28,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2322 transitions. [2024-11-08 11:27:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2024-11-08 11:27:28,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:28,964 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:27:28,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:27:28,964 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:28,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash -970210919, now seen corresponding path program 2 times [2024-11-08 11:27:28,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:28,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95850456] [2024-11-08 11:27:28,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:28,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 819 proven. 11 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-11-08 11:27:29,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:29,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95850456] [2024-11-08 11:27:29,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95850456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:27:29,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558429313] [2024-11-08 11:27:29,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 11:27:29,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:27:29,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:27:29,372 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) [2024-11-08 11:27:29,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:27:29,534 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 11:27:29,534 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 11:27:29,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:27:29,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:27:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 830 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-11-08 11:27:30,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:27:30,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558429313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:30,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:27:30,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:27:30,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623561665] [2024-11-08 11:27:30,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:30,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:27:30,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:30,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:27:30,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:27:30,077 INFO L87 Difference]: Start difference. First operand 2140 states and 2322 transitions. Second operand has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:30,653 INFO L93 Difference]: Finished difference Result 4990 states and 5475 transitions. [2024-11-08 11:27:30,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:27:30,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 556 [2024-11-08 11:27:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:30,661 INFO L225 Difference]: With dead ends: 4990 [2024-11-08 11:27:30,661 INFO L226 Difference]: Without dead ends: 3030 [2024-11-08 11:27:30,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:27:30,665 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 162 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:30,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 15 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:27:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2024-11-08 11:27:30,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2496. [2024-11-08 11:27:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.0789579158316633) internal successors, (2692), 2495 states have internal predecessors, (2692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:30,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2692 transitions. [2024-11-08 11:27:30,692 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2692 transitions. Word has length 556 [2024-11-08 11:27:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:30,692 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 2692 transitions. [2024-11-08 11:27:30,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2692 transitions. [2024-11-08 11:27:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2024-11-08 11:27:30,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:30,697 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:27:30,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 11:27:30,898 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,SelfDestructingSolverStorable7 [2024-11-08 11:27:30,898 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:30,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:30,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1613402830, now seen corresponding path program 1 times [2024-11-08 11:27:30,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:30,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062096380] [2024-11-08 11:27:30,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-11-08 11:27:31,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:31,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062096380] [2024-11-08 11:27:31,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062096380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:31,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:27:31,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:27:31,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837141880] [2024-11-08 11:27:31,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:31,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:27:31,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:31,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:27:31,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:27:31,199 INFO L87 Difference]: Start difference. First operand 2496 states and 2692 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:31,549 INFO L93 Difference]: Finished difference Result 5702 states and 6216 transitions. [2024-11-08 11:27:31,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:27:31,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 563 [2024-11-08 11:27:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:31,557 INFO L225 Difference]: With dead ends: 5702 [2024-11-08 11:27:31,557 INFO L226 Difference]: Without dead ends: 3386 [2024-11-08 11:27:31,559 INFO L431 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 [2024-11-08 11:27:31,571 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 73 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:31,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 203 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:27:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2024-11-08 11:27:31,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3208. [2024-11-08 11:27:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.0770190208917991) internal successors, (3454), 3207 states have internal predecessors, (3454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3454 transitions. [2024-11-08 11:27:31,602 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3454 transitions. Word has length 563 [2024-11-08 11:27:31,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:31,602 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 3454 transitions. [2024-11-08 11:27:31,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3454 transitions. [2024-11-08 11:27:31,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2024-11-08 11:27:31,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:31,606 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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] [2024-11-08 11:27:31,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:27:31,607 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:31,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:31,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1315980517, now seen corresponding path program 1 times [2024-11-08 11:27:31,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:31,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464235706] [2024-11-08 11:27:31,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:31,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 846 proven. 195 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-08 11:27:32,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:32,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464235706] [2024-11-08 11:27:32,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464235706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:27:32,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274962298] [2024-11-08 11:27:32,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:32,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:27:32,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:27:32,222 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) [2024-11-08 11:27:32,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 11:27:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:32,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:27:32,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:27:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 514 proven. 0 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2024-11-08 11:27:32,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:27:32,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274962298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:32,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:27:32,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-08 11:27:32,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834565304] [2024-11-08 11:27:32,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:32,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:27:32,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:32,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:27:32,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:27:32,775 INFO L87 Difference]: Start difference. First operand 3208 states and 3454 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:33,124 INFO L93 Difference]: Finished difference Result 6948 states and 7481 transitions. [2024-11-08 11:27:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:27:33,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 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 608 [2024-11-08 11:27:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:33,134 INFO L225 Difference]: With dead ends: 6948 [2024-11-08 11:27:33,134 INFO L226 Difference]: Without dead ends: 3920 [2024-11-08 11:27:33,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:27:33,137 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:33,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 50 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:27:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2024-11-08 11:27:33,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3386. [2024-11-08 11:27:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.0782865583456425) internal successors, (3650), 3385 states have internal predecessors, (3650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3650 transitions. [2024-11-08 11:27:33,172 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3650 transitions. Word has length 608 [2024-11-08 11:27:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:33,172 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3650 transitions. [2024-11-08 11:27:33,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3650 transitions. [2024-11-08 11:27:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2024-11-08 11:27:33,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:33,176 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:27:33,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 11:27:33,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:27:33,377 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:33,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash 186723207, now seen corresponding path program 1 times [2024-11-08 11:27:33,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:33,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118889379] [2024-11-08 11:27:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 837 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-11-08 11:27:33,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:33,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118889379] [2024-11-08 11:27:33,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118889379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:33,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:27:33,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:27:33,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133252872] [2024-11-08 11:27:33,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:33,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:27:33,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:33,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:27:33,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:27:33,642 INFO L87 Difference]: Start difference. First operand 3386 states and 3650 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:33,983 INFO L93 Difference]: Finished difference Result 8016 states and 8717 transitions. [2024-11-08 11:27:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:27:33,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 630 [2024-11-08 11:27:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:33,994 INFO L225 Difference]: With dead ends: 8016 [2024-11-08 11:27:33,994 INFO L226 Difference]: Without dead ends: 4810 [2024-11-08 11:27:33,997 INFO L431 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 [2024-11-08 11:27:33,997 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:33,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 52 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:27:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2024-11-08 11:27:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4810. [2024-11-08 11:27:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0721563734664172) internal successors, (5156), 4809 states have internal predecessors, (5156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5156 transitions. [2024-11-08 11:27:34,039 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5156 transitions. Word has length 630 [2024-11-08 11:27:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:34,040 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 5156 transitions. [2024-11-08 11:27:34,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5156 transitions. [2024-11-08 11:27:34,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2024-11-08 11:27:34,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:34,045 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:27:34,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:27:34,045 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:34,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:34,046 INFO L85 PathProgramCache]: Analyzing trace with hash -2069628610, now seen corresponding path program 1 times [2024-11-08 11:27:34,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:34,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285576366] [2024-11-08 11:27:34,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:34,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2084 backedges. 1525 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2024-11-08 11:27:34,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:34,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285576366] [2024-11-08 11:27:34,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285576366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:34,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:27:34,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:27:34,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068500594] [2024-11-08 11:27:34,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:34,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:27:34,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:34,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:27:34,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:27:34,392 INFO L87 Difference]: Start difference. First operand 4810 states and 5156 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:34,706 INFO L93 Difference]: Finished difference Result 9618 states and 10325 transitions. [2024-11-08 11:27:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:27:34,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 709 [2024-11-08 11:27:34,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:34,716 INFO L225 Difference]: With dead ends: 9618 [2024-11-08 11:27:34,716 INFO L226 Difference]: Without dead ends: 4988 [2024-11-08 11:27:34,722 INFO L431 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 [2024-11-08 11:27:34,722 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 102 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 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 [2024-11-08 11:27:34,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 243 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:27:34,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2024-11-08 11:27:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4454. [2024-11-08 11:27:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0700651246350774) internal successors, (4765), 4453 states have internal predecessors, (4765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4765 transitions. [2024-11-08 11:27:34,760 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4765 transitions. Word has length 709 [2024-11-08 11:27:34,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:34,761 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4765 transitions. [2024-11-08 11:27:34,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4765 transitions. [2024-11-08 11:27:34,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2024-11-08 11:27:34,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:34,765 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 1, 1, 1, 1, 1, 1] [2024-11-08 11:27:34,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:27:34,766 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:34,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:34,766 INFO L85 PathProgramCache]: Analyzing trace with hash -287829589, now seen corresponding path program 1 times [2024-11-08 11:27:34,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:34,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92034427] [2024-11-08 11:27:34,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:34,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-11-08 11:27:35,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:35,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92034427] [2024-11-08 11:27:35,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92034427] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:27:35,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553698892] [2024-11-08 11:27:35,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:35,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:27:35,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:27:35,140 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) [2024-11-08 11:27:35,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 11:27:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:35,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:27:35,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:27:35,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-11-08 11:27:35,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:27:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-11-08 11:27:35,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553698892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 11:27:35,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 11:27:35,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-08 11:27:35,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895276621] [2024-11-08 11:27:35,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 11:27:35,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 11:27:35,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:35,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 11:27:35,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:27:35,946 INFO L87 Difference]: Start difference. First operand 4454 states and 4765 transitions. Second operand has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:36,610 INFO L93 Difference]: Finished difference Result 10152 states and 10909 transitions. [2024-11-08 11:27:36,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 11:27:36,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 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 785 [2024-11-08 11:27:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:36,620 INFO L225 Difference]: With dead ends: 10152 [2024-11-08 11:27:36,620 INFO L226 Difference]: Without dead ends: 5878 [2024-11-08 11:27:36,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1572 GetRequests, 1568 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:27:36,624 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 75 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:36,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 68 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 11:27:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2024-11-08 11:27:36,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5166. [2024-11-08 11:27:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 5165 states have (on average 1.0710551790900291) internal successors, (5532), 5165 states have internal predecessors, (5532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5532 transitions. [2024-11-08 11:27:36,667 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5532 transitions. Word has length 785 [2024-11-08 11:27:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:36,667 INFO L471 AbstractCegarLoop]: Abstraction has 5166 states and 5532 transitions. [2024-11-08 11:27:36,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5532 transitions. [2024-11-08 11:27:36,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2024-11-08 11:27:36,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:36,676 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:27:36,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 11:27:36,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:27:36,877 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:36,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:36,877 INFO L85 PathProgramCache]: Analyzing trace with hash -570726484, now seen corresponding path program 1 times [2024-11-08 11:27:36,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:36,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216217215] [2024-11-08 11:27:36,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:36,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2283 backedges. 1470 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2024-11-08 11:27:37,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:37,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216217215] [2024-11-08 11:27:37,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216217215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:37,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:27:37,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:27:37,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020670676] [2024-11-08 11:27:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:37,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:27:37,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:37,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:27:37,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:27:37,188 INFO L87 Difference]: Start difference. First operand 5166 states and 5532 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) [2024-11-08 11:27:37,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:37,537 INFO L93 Difference]: Finished difference Result 11220 states and 12108 transitions. [2024-11-08 11:27:37,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:27:37,537 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 857 [2024-11-08 11:27:37,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:37,544 INFO L225 Difference]: With dead ends: 11220 [2024-11-08 11:27:37,545 INFO L226 Difference]: Without dead ends: 6234 [2024-11-08 11:27:37,548 INFO L431 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 [2024-11-08 11:27:37,548 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 108 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:37,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 33 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:27:37,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2024-11-08 11:27:37,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 6234. [2024-11-08 11:27:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6234 states, 6233 states have (on average 1.074923792716188) internal successors, (6700), 6233 states have internal predecessors, (6700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:37,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 6700 transitions. [2024-11-08 11:27:37,597 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 6700 transitions. Word has length 857 [2024-11-08 11:27:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:37,598 INFO L471 AbstractCegarLoop]: Abstraction has 6234 states and 6700 transitions. [2024-11-08 11:27:37,598 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) [2024-11-08 11:27:37,598 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 6700 transitions. [2024-11-08 11:27:37,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2024-11-08 11:27:37,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:37,604 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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] [2024-11-08 11:27:37,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:27:37,604 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:37,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:37,604 INFO L85 PathProgramCache]: Analyzing trace with hash -948706177, now seen corresponding path program 1 times [2024-11-08 11:27:37,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:37,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195928808] [2024-11-08 11:27:37,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:37,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 1527 proven. 93 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2024-11-08 11:27:38,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:38,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195928808] [2024-11-08 11:27:38,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195928808] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:27:38,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47744944] [2024-11-08 11:27:38,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:38,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:27:38,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:27:38,106 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) [2024-11-08 11:27:38,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 11:27:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:38,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:27:38,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:27:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 1620 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2024-11-08 11:27:38,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:27:38,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47744944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:38,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:27:38,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:27:38,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765595727] [2024-11-08 11:27:38,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:38,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:27:38,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:38,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:27:38,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:27:38,623 INFO L87 Difference]: Start difference. First operand 6234 states and 6700 transitions. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:38,968 INFO L93 Difference]: Finished difference Result 12644 states and 13591 transitions. [2024-11-08 11:27:38,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:27:38,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 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 875 [2024-11-08 11:27:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:38,975 INFO L225 Difference]: With dead ends: 12644 [2024-11-08 11:27:38,975 INFO L226 Difference]: Without dead ends: 6590 [2024-11-08 11:27:38,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:27:38,979 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:38,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 65 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:27:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6590 states. [2024-11-08 11:27:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6590 to 6412. [2024-11-08 11:27:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6412 states, 6411 states have (on average 1.0744033692091717) internal successors, (6888), 6411 states have internal predecessors, (6888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6412 states to 6412 states and 6888 transitions. [2024-11-08 11:27:39,026 INFO L78 Accepts]: Start accepts. Automaton has 6412 states and 6888 transitions. Word has length 875 [2024-11-08 11:27:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:39,026 INFO L471 AbstractCegarLoop]: Abstraction has 6412 states and 6888 transitions. [2024-11-08 11:27:39,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 6412 states and 6888 transitions. [2024-11-08 11:27:39,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 944 [2024-11-08 11:27:39,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:39,033 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 1, 1, 1, 1, 1, 1] [2024-11-08 11:27:39,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 11:27:39,234 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,SelfDestructingSolverStorable14 [2024-11-08 11:27:39,235 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:39,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:39,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1100691125, now seen corresponding path program 1 times [2024-11-08 11:27:39,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:39,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751420157] [2024-11-08 11:27:39,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:39,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 1757 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2024-11-08 11:27:39,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:39,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751420157] [2024-11-08 11:27:39,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751420157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:39,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:27:39,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:27:39,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907954135] [2024-11-08 11:27:39,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:39,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:27:39,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:39,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:27:39,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:27:39,854 INFO L87 Difference]: Start difference. First operand 6412 states and 6888 transitions. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:40,168 INFO L93 Difference]: Finished difference Result 12466 states and 13415 transitions. [2024-11-08 11:27:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:27:40,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 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 943 [2024-11-08 11:27:40,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:40,175 INFO L225 Difference]: With dead ends: 12466 [2024-11-08 11:27:40,175 INFO L226 Difference]: Without dead ends: 6234 [2024-11-08 11:27:40,179 INFO L431 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 [2024-11-08 11:27:40,180 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 21 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:40,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 227 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:27:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2024-11-08 11:27:40,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 6234. [2024-11-08 11:27:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6234 states, 6233 states have (on average 1.067222846141505) internal successors, (6652), 6233 states have internal predecessors, (6652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 6652 transitions. [2024-11-08 11:27:40,228 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 6652 transitions. Word has length 943 [2024-11-08 11:27:40,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:40,228 INFO L471 AbstractCegarLoop]: Abstraction has 6234 states and 6652 transitions. [2024-11-08 11:27:40,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 6652 transitions. [2024-11-08 11:27:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2024-11-08 11:27:40,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:40,235 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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] [2024-11-08 11:27:40,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:27:40,236 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:40,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:40,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1227190264, now seen corresponding path program 1 times [2024-11-08 11:27:40,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:40,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340688006] [2024-11-08 11:27:40,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:40,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1865 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2024-11-08 11:27:41,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:41,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340688006] [2024-11-08 11:27:41,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340688006] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:27:41,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651307606] [2024-11-08 11:27:41,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:41,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:27:41,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:27:41,044 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) [2024-11-08 11:27:41,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 11:27:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:41,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 11:27:41,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:27:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1865 proven. 625 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2024-11-08 11:27:41,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:27:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1937 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2024-11-08 11:27:42,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651307606] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 11:27:42,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 11:27:42,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2024-11-08 11:27:42,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706093308] [2024-11-08 11:27:42,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:42,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 11:27:42,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:42,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 11:27:42,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:27:42,245 INFO L87 Difference]: Start difference. First operand 6234 states and 6652 transitions. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:42,694 INFO L93 Difference]: Finished difference Result 12644 states and 13507 transitions. [2024-11-08 11:27:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:27:42,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 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 952 [2024-11-08 11:27:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:42,702 INFO L225 Difference]: With dead ends: 12644 [2024-11-08 11:27:42,703 INFO L226 Difference]: Without dead ends: 6590 [2024-11-08 11:27:42,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1907 GetRequests, 1899 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:27:42,707 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 147 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:42,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 9 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:27:42,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6590 states. [2024-11-08 11:27:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6590 to 6412. [2024-11-08 11:27:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6412 states, 6411 states have (on average 1.0659803462798316) internal successors, (6834), 6411 states have internal predecessors, (6834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6412 states to 6412 states and 6834 transitions. [2024-11-08 11:27:42,758 INFO L78 Accepts]: Start accepts. Automaton has 6412 states and 6834 transitions. Word has length 952 [2024-11-08 11:27:42,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:42,758 INFO L471 AbstractCegarLoop]: Abstraction has 6412 states and 6834 transitions. [2024-11-08 11:27:42,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 6412 states and 6834 transitions. [2024-11-08 11:27:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2024-11-08 11:27:42,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:42,766 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 5, 4, 4, 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, 1, 1] [2024-11-08 11:27:42,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 11:27:42,966 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,SelfDestructingSolverStorable16 [2024-11-08 11:27:42,967 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:42,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:42,967 INFO L85 PathProgramCache]: Analyzing trace with hash -275538465, now seen corresponding path program 1 times [2024-11-08 11:27:42,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:42,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442145103] [2024-11-08 11:27:42,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:42,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:43,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3627 backedges. 1666 proven. 0 refuted. 0 times theorem prover too weak. 1961 trivial. 0 not checked. [2024-11-08 11:27:43,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:43,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442145103] [2024-11-08 11:27:43,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442145103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:43,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:27:43,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 11:27:43,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120378719] [2024-11-08 11:27:43,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:43,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 11:27:43,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:43,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 11:27:43,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:27:43,648 INFO L87 Difference]: Start difference. First operand 6412 states and 6834 transitions. Second operand has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:44,179 INFO L93 Difference]: Finished difference Result 12360 states and 13167 transitions. [2024-11-08 11:27:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 11:27:44,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 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 995 [2024-11-08 11:27:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:44,185 INFO L225 Difference]: With dead ends: 12360 [2024-11-08 11:27:44,185 INFO L226 Difference]: Without dead ends: 5878 [2024-11-08 11:27:44,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:27:44,189 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:44,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 36 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:27:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2024-11-08 11:27:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5878. [2024-11-08 11:27:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5878 states, 5877 states have (on average 1.0547898587714821) internal successors, (6199), 5877 states have internal predecessors, (6199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6199 transitions. [2024-11-08 11:27:44,233 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6199 transitions. Word has length 995 [2024-11-08 11:27:44,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:44,233 INFO L471 AbstractCegarLoop]: Abstraction has 5878 states and 6199 transitions. [2024-11-08 11:27:44,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6199 transitions. [2024-11-08 11:27:44,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1161 [2024-11-08 11:27:44,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:44,242 INFO L215 NwaCegarLoop]: trace histogram [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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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] [2024-11-08 11:27:44,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 11:27:44,243 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:44,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:44,243 INFO L85 PathProgramCache]: Analyzing trace with hash 703465302, now seen corresponding path program 1 times [2024-11-08 11:27:44,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:44,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048556538] [2024-11-08 11:27:44,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:44,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4570 backedges. 1842 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2024-11-08 11:27:44,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:44,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048556538] [2024-11-08 11:27:44,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048556538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:44,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:27:44,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:27:44,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189201301] [2024-11-08 11:27:44,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:44,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:27:44,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:44,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:27:44,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:27:44,836 INFO L87 Difference]: Start difference. First operand 5878 states and 6199 transitions. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:45,218 INFO L93 Difference]: Finished difference Result 11420 states and 12045 transitions. [2024-11-08 11:27:45,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:27:45,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 1160 [2024-11-08 11:27:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:45,225 INFO L225 Difference]: With dead ends: 11420 [2024-11-08 11:27:45,225 INFO L226 Difference]: Without dead ends: 5700 [2024-11-08 11:27:45,230 INFO L431 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 [2024-11-08 11:27:45,231 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:45,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:27:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2024-11-08 11:27:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5700. [2024-11-08 11:27:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5700 states, 5699 states have (on average 1.052465344797333) internal successors, (5998), 5699 states have internal predecessors, (5998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 5998 transitions. [2024-11-08 11:27:45,272 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 5998 transitions. Word has length 1160 [2024-11-08 11:27:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:45,273 INFO L471 AbstractCegarLoop]: Abstraction has 5700 states and 5998 transitions. [2024-11-08 11:27:45,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 5998 transitions. [2024-11-08 11:27:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1197 [2024-11-08 11:27:45,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:45,284 INFO L215 NwaCegarLoop]: trace histogram [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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 9, 9, 9, 9, 9, 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, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:27:45,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 11:27:45,284 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:45,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:45,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1047532179, now seen corresponding path program 1 times [2024-11-08 11:27:45,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:45,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910737814] [2024-11-08 11:27:45,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:45,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 3500 proven. 72 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2024-11-08 11:27:46,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:46,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910737814] [2024-11-08 11:27:46,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910737814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:27:46,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040488965] [2024-11-08 11:27:46,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:46,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:27:46,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:27:46,361 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) [2024-11-08 11:27:46,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 11:27:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:46,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 11:27:46,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:27:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 3459 proven. 666 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2024-11-08 11:27:47,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:27:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 3572 proven. 0 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2024-11-08 11:27:47,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040488965] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 11:27:47,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 11:27:47,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2024-11-08 11:27:47,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020285600] [2024-11-08 11:27:47,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:47,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 11:27:47,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:47,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 11:27:47,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:27:47,544 INFO L87 Difference]: Start difference. First operand 5700 states and 5998 transitions. Second operand has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:47,887 INFO L93 Difference]: Finished difference Result 11220 states and 11815 transitions. [2024-11-08 11:27:47,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:27:47,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 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 1196 [2024-11-08 11:27:47,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:47,893 INFO L225 Difference]: With dead ends: 11220 [2024-11-08 11:27:47,893 INFO L226 Difference]: Without dead ends: 5700 [2024-11-08 11:27:47,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2395 GetRequests, 2388 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:27:47,897 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 95 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:47,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 10 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:27:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2024-11-08 11:27:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5700. [2024-11-08 11:27:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5700 states, 5699 states have (on average 1.0501842428496226) internal successors, (5985), 5699 states have internal predecessors, (5985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 5985 transitions. [2024-11-08 11:27:47,941 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 5985 transitions. Word has length 1196 [2024-11-08 11:27:47,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:47,941 INFO L471 AbstractCegarLoop]: Abstraction has 5700 states and 5985 transitions. [2024-11-08 11:27:47,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 5985 transitions. [2024-11-08 11:27:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1489 [2024-11-08 11:27:47,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:27:47,978 INFO L215 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, 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, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:27:47,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 11:27:48,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:27:48,179 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:27:48,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:27:48,180 INFO L85 PathProgramCache]: Analyzing trace with hash 290093558, now seen corresponding path program 1 times [2024-11-08 11:27:48,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:27:48,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769073013] [2024-11-08 11:27:48,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:27:48,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:27:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:27:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7072 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 6509 trivial. 0 not checked. [2024-11-08 11:27:48,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:27:48,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769073013] [2024-11-08 11:27:48,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769073013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:27:48,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:27:48,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:27:48,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220786428] [2024-11-08 11:27:48,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:27:48,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:27:48,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:27:48,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:27:48,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:27:48,915 INFO L87 Difference]: Start difference. First operand 5700 states and 5985 transitions. Second operand has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:27:49,238 INFO L93 Difference]: Finished difference Result 11052 states and 11604 transitions. [2024-11-08 11:27:49,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:27:49,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 1488 [2024-11-08 11:27:49,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:27:49,240 INFO L225 Difference]: With dead ends: 11052 [2024-11-08 11:27:49,240 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:27:49,243 INFO L431 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 [2024-11-08 11:27:49,243 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:27:49,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 15 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:27:49,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:27:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:27:49,243 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) [2024-11-08 11:27:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:27:49,244 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1488 [2024-11-08 11:27:49,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:27:49,244 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:27:49,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.75) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:27:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:27:49,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:27:49,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:27:49,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 11:27:49,249 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:27:49,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:27:49,699 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:27:49,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:27:49 BoogieIcfgContainer [2024-11-08 11:27:49,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:27:49,712 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:27:49,712 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:27:49,712 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:27:49,712 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:21" (3/4) ... [2024-11-08 11:27:49,714 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:27:49,727 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:27:49,730 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:27:49,731 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:27:49,731 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:27:49,845 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:27:49,845 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:27:49,845 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:27:49,846 INFO L158 Benchmark]: Toolchain (without parser) took 30071.62ms. Allocated memory was 172.0MB in the beginning and 1.1GB in the end (delta: 960.5MB). Free memory was 97.9MB in the beginning and 687.5MB in the end (delta: -589.7MB). Peak memory consumption was 373.5MB. Max. memory is 16.1GB. [2024-11-08 11:27:49,847 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:27:49,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.90ms. Allocated memory was 172.0MB in the beginning and 237.0MB in the end (delta: 65.0MB). Free memory was 97.9MB in the beginning and 188.1MB in the end (delta: -90.3MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-11-08 11:27:49,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.73ms. Allocated memory is still 237.0MB. Free memory was 188.1MB in the beginning and 178.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 11:27:49,850 INFO L158 Benchmark]: Boogie Preprocessor took 109.49ms. Allocated memory is still 237.0MB. Free memory was 178.7MB in the beginning and 165.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 11:27:49,850 INFO L158 Benchmark]: RCFGBuilder took 1029.37ms. Allocated memory is still 237.0MB. Free memory was 165.9MB in the beginning and 177.4MB in the end (delta: -11.5MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. [2024-11-08 11:27:49,850 INFO L158 Benchmark]: TraceAbstraction took 28171.30ms. Allocated memory was 237.0MB in the beginning and 1.1GB in the end (delta: 895.5MB). Free memory was 176.3MB in the beginning and 702.3MB in the end (delta: -525.9MB). Peak memory consumption was 372.7MB. Max. memory is 16.1GB. [2024-11-08 11:27:49,850 INFO L158 Benchmark]: Witness Printer took 133.56ms. Allocated memory is still 1.1GB. Free memory was 702.3MB in the beginning and 687.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 11:27:49,851 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.16ms. Allocated memory is still 172.0MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.90ms. Allocated memory was 172.0MB in the beginning and 237.0MB in the end (delta: 65.0MB). Free memory was 97.9MB in the beginning and 188.1MB in the end (delta: -90.3MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.73ms. Allocated memory is still 237.0MB. Free memory was 188.1MB in the beginning and 178.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.49ms. Allocated memory is still 237.0MB. Free memory was 178.7MB in the beginning and 165.9MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1029.37ms. Allocated memory is still 237.0MB. Free memory was 165.9MB in the beginning and 177.4MB in the end (delta: -11.5MB). Peak memory consumption was 107.0MB. Max. memory is 16.1GB. * TraceAbstraction took 28171.30ms. Allocated memory was 237.0MB in the beginning and 1.1GB in the end (delta: 895.5MB). Free memory was 176.3MB in the beginning and 702.3MB in the end (delta: -525.9MB). Peak memory consumption was 372.7MB. Max. memory is 16.1GB. * Witness Printer took 133.56ms. Allocated memory is still 1.1GB. Free memory was 702.3MB in the beginning and 687.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: 161]: 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: 27.6s, OverallIterations: 21, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2162 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2162 mSDsluCounter, 1707 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 1565 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12483 IncrementalHoareTripleChecker+Invalid, 14048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1565 mSolverCounterUnsat, 1555 mSDtfsCounter, 12483 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8323 GetRequests, 8260 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6412occurred in iteration=15, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 3560 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 19911 NumberOfCodeBlocks, 19911 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 22813 ConstructedInterpolants, 0 QuantifiedInterpolants, 62617 SizeOfPredicates, 0 NumberOfNonLiveVariables, 6627 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 31 InterpolantComputations, 20 PerfectInterpolantSequences, 63560/65889 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: (((((((((a24 == 1) && (5 == a15)) && (a21 == 6)) && (a12 <= 600129)) || (((a15 <= 8) && (a21 <= 6)) && (((long long) 49 + a12) <= 0))) || (((a21 <= 9) && (a24 == 1)) && (a12 <= 600060))) || (((a24 == 1) && (7 != a15)) && (a12 <= 600060))) || ((a12 <= 11) && (a24 == 1))) || ((((a24 == 1) && (a21 == 10)) && (81 <= a12)) && (a12 <= 600060))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:27:49,876 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