./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.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 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 16:16:07,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 16:16:07,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 16:16:07,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 16:16:07,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 16:16:08,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 16:16:08,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 16:16:08,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 16:16:08,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 16:16:08,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 16:16:08,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 16:16:08,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 16:16:08,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 16:16:08,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 16:16:08,024 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 16:16:08,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 16:16:08,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 16:16:08,026 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 16:16:08,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 16:16:08,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 16:16:08,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 16:16:08,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 16:16:08,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 16:16:08,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 16:16:08,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 16:16:08,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 16:16:08,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 16:16:08,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 16:16:08,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 16:16:08,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 16:16:08,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 16:16:08,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 16:16:08,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 16:16:08,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 16:16:08,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 16:16:08,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 16:16:08,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 16:16:08,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 16:16:08,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 16:16:08,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 16:16:08,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 16:16:08,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 16:16:08,040 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 -> 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 [2024-11-18 16:16:08,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 16:16:08,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 16:16:08,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 16:16:08,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 16:16:08,352 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 16:16:08,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2024-11-18 16:16:09,842 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 16:16:10,052 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 16:16:10,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2024-11-18 16:16:10,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25ff9961f/05bad43f58dd4cdcb5ef66de5a0e7aee/FLAG823434a99 [2024-11-18 16:16:10,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25ff9961f/05bad43f58dd4cdcb5ef66de5a0e7aee [2024-11-18 16:16:10,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 16:16:10,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 16:16:10,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 16:16:10,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 16:16:10,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 16:16:10,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:16:10" (1/1) ... [2024-11-18 16:16:10,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6828b677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10, skipping insertion in model container [2024-11-18 16:16:10,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:16:10" (1/1) ... [2024-11-18 16:16:10,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 16:16:10,373 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/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2024-11-18 16:16:10,437 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/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2024-11-18 16:16:10,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 16:16:10,495 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 16:16:10,511 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/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2024-11-18 16:16:10,532 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/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2024-11-18 16:16:10,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 16:16:10,590 INFO L204 MainTranslator]: Completed translation [2024-11-18 16:16:10,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10 WrapperNode [2024-11-18 16:16:10,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 16:16:10,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 16:16:10,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 16:16:10,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 16:16:10,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10" (1/1) ... [2024-11-18 16:16:10,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10" (1/1) ... [2024-11-18 16:16:10,651 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 423 [2024-11-18 16:16:10,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 16:16:10,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 16:16:10,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 16:16:10,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 16:16:10,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10" (1/1) ... [2024-11-18 16:16:10,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10" (1/1) ... [2024-11-18 16:16:10,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10" (1/1) ... [2024-11-18 16:16:10,698 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-18 16:16:10,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10" (1/1) ... [2024-11-18 16:16:10,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10" (1/1) ... [2024-11-18 16:16:10,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10" (1/1) ... [2024-11-18 16:16:10,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10" (1/1) ... [2024-11-18 16:16:10,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10" (1/1) ... [2024-11-18 16:16:10,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10" (1/1) ... [2024-11-18 16:16:10,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 16:16:10,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 16:16:10,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 16:16:10,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 16:16:10,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10" (1/1) ... [2024-11-18 16:16:10,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 16:16:10,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:10,771 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-18 16:16:10,778 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-18 16:16:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 16:16:10,836 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-18 16:16:10,837 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-18 16:16:10,837 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-18 16:16:10,838 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-18 16:16:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-18 16:16:10,838 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-18 16:16:10,838 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-18 16:16:10,838 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-18 16:16:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-18 16:16:10,839 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-18 16:16:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-18 16:16:10,839 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-18 16:16:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-18 16:16:10,839 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-18 16:16:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 16:16:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-18 16:16:10,839 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-18 16:16:10,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 16:16:10,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 16:16:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-18 16:16:10,840 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-18 16:16:10,952 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 16:16:10,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 16:16:11,442 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-18 16:16:11,446 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 16:16:11,464 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 16:16:11,464 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-18 16:16:11,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:16:11 BoogieIcfgContainer [2024-11-18 16:16:11,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 16:16:11,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 16:16:11,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 16:16:11,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 16:16:11,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:16:10" (1/3) ... [2024-11-18 16:16:11,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48755758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:16:11, skipping insertion in model container [2024-11-18 16:16:11,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:16:10" (2/3) ... [2024-11-18 16:16:11,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48755758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:16:11, skipping insertion in model container [2024-11-18 16:16:11,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:16:11" (3/3) ... [2024-11-18 16:16:11,478 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2024-11-18 16:16:11,496 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 16:16:11,499 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-18 16:16:11,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 16:16:11,565 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;@12321790, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 16:16:11,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-18 16:16:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 153 states have internal predecessors, (227), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-18 16:16:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 16:16:11,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:11,584 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] [2024-11-18 16:16:11,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:11,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:11,591 INFO L85 PathProgramCache]: Analyzing trace with hash 730224026, now seen corresponding path program 1 times [2024-11-18 16:16:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:11,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362466737] [2024-11-18 16:16:11,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:11,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:11,880 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-18 16:16:11,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362466737] [2024-11-18 16:16:11,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362466737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:11,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:11,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:16:11,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959603708] [2024-11-18 16:16:11,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:11,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:11,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:11,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:11,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:11,919 INFO L87 Difference]: Start difference. First operand has 181 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 153 states have internal predecessors, (227), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 16:16:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:12,037 INFO L93 Difference]: Finished difference Result 407 states and 612 transitions. [2024-11-18 16:16:12,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:12,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-18 16:16:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:12,058 INFO L225 Difference]: With dead ends: 407 [2024-11-18 16:16:12,058 INFO L226 Difference]: Without dead ends: 230 [2024-11-18 16:16:12,063 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-18 16:16:12,066 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 227 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:12,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 347 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-18 16:16:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2024-11-18 16:16:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 189 states have (on average 1.402116402116402) internal successors, (265), 192 states have internal predecessors, (265), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (27), 23 states have call predecessors, (27), 23 states have call successors, (27) [2024-11-18 16:16:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 317 transitions. [2024-11-18 16:16:12,138 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 317 transitions. Word has length 44 [2024-11-18 16:16:12,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:12,139 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 317 transitions. [2024-11-18 16:16:12,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 16:16:12,140 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 317 transitions. [2024-11-18 16:16:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-18 16:16:12,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:12,143 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] [2024-11-18 16:16:12,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 16:16:12,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:12,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:12,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2090661330, now seen corresponding path program 1 times [2024-11-18 16:16:12,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:12,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340641467] [2024-11-18 16:16:12,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:12,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:12,253 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-18 16:16:12,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:12,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340641467] [2024-11-18 16:16:12,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340641467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:12,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:12,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:16:12,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486130610] [2024-11-18 16:16:12,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:12,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:12,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:12,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:12,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:12,258 INFO L87 Difference]: Start difference. First operand 226 states and 317 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 16:16:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:12,330 INFO L93 Difference]: Finished difference Result 434 states and 605 transitions. [2024-11-18 16:16:12,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:12,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-18 16:16:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:12,338 INFO L225 Difference]: With dead ends: 434 [2024-11-18 16:16:12,338 INFO L226 Difference]: Without dead ends: 319 [2024-11-18 16:16:12,342 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-18 16:16:12,343 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 67 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:12,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 479 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:12,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-18 16:16:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 293. [2024-11-18 16:16:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 250 states have (on average 1.396) internal successors, (349), 253 states have internal predecessors, (349), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (31), 26 states have call predecessors, (31), 26 states have call successors, (31) [2024-11-18 16:16:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 408 transitions. [2024-11-18 16:16:12,387 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 408 transitions. Word has length 45 [2024-11-18 16:16:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:12,387 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 408 transitions. [2024-11-18 16:16:12,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 16:16:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 408 transitions. [2024-11-18 16:16:12,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-18 16:16:12,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:12,390 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] [2024-11-18 16:16:12,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 16:16:12,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:12,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:12,391 INFO L85 PathProgramCache]: Analyzing trace with hash 806303869, now seen corresponding path program 1 times [2024-11-18 16:16:12,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:12,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101232341] [2024-11-18 16:16:12,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:12,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:12,475 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-18 16:16:12,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:12,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101232341] [2024-11-18 16:16:12,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101232341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:12,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:12,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:16:12,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536759396] [2024-11-18 16:16:12,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:12,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:12,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:12,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:12,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:12,478 INFO L87 Difference]: Start difference. First operand 293 states and 408 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 16:16:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:12,537 INFO L93 Difference]: Finished difference Result 646 states and 896 transitions. [2024-11-18 16:16:12,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:12,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-18 16:16:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:12,545 INFO L225 Difference]: With dead ends: 646 [2024-11-18 16:16:12,545 INFO L226 Difference]: Without dead ends: 464 [2024-11-18 16:16:12,549 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-18 16:16:12,551 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 214 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:12,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 326 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-18 16:16:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 450. [2024-11-18 16:16:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 389 states have (on average 1.365038560411311) internal successors, (531), 394 states have internal predecessors, (531), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (47), 35 states have call predecessors, (47), 37 states have call successors, (47) [2024-11-18 16:16:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 617 transitions. [2024-11-18 16:16:12,593 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 617 transitions. Word has length 45 [2024-11-18 16:16:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:12,593 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 617 transitions. [2024-11-18 16:16:12,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 16:16:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 617 transitions. [2024-11-18 16:16:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-18 16:16:12,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:12,597 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:12,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 16:16:12,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:12,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash -737201202, now seen corresponding path program 1 times [2024-11-18 16:16:12,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:12,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924326461] [2024-11-18 16:16:12,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:12,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:12,658 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-18 16:16:12,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:12,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924326461] [2024-11-18 16:16:12,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924326461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:12,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:12,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:16:12,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930134244] [2024-11-18 16:16:12,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:12,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:12,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:12,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:12,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:12,662 INFO L87 Difference]: Start difference. First operand 450 states and 617 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:12,694 INFO L93 Difference]: Finished difference Result 548 states and 755 transitions. [2024-11-18 16:16:12,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:12,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-18 16:16:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:12,698 INFO L225 Difference]: With dead ends: 548 [2024-11-18 16:16:12,699 INFO L226 Difference]: Without dead ends: 450 [2024-11-18 16:16:12,700 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-18 16:16:12,704 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 140 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:12,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 330 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:12,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-18 16:16:12,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2024-11-18 16:16:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 389 states have (on average 1.3624678663239074) internal successors, (530), 394 states have internal predecessors, (530), 39 states have call successors, (39), 21 states have call predecessors, (39), 20 states have return successors, (47), 35 states have call predecessors, (47), 37 states have call successors, (47) [2024-11-18 16:16:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 616 transitions. [2024-11-18 16:16:12,741 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 616 transitions. Word has length 57 [2024-11-18 16:16:12,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:12,742 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 616 transitions. [2024-11-18 16:16:12,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:12,742 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 616 transitions. [2024-11-18 16:16:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-18 16:16:12,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:12,748 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:12,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 16:16:12,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:12,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash -721682484, now seen corresponding path program 1 times [2024-11-18 16:16:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:12,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897900426] [2024-11-18 16:16:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:12,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:12,920 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-18 16:16:12,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:12,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897900426] [2024-11-18 16:16:12,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897900426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:12,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:12,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 16:16:12,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653837724] [2024-11-18 16:16:12,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:12,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:16:12,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:12,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:16:12,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:16:12,926 INFO L87 Difference]: Start difference. First operand 450 states and 616 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:13,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:13,346 INFO L93 Difference]: Finished difference Result 644 states and 892 transitions. [2024-11-18 16:16:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 16:16:13,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-18 16:16:13,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:13,351 INFO L225 Difference]: With dead ends: 644 [2024-11-18 16:16:13,352 INFO L226 Difference]: Without dead ends: 549 [2024-11-18 16:16:13,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:13,355 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 335 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:13,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 560 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 16:16:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-18 16:16:13,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 542. [2024-11-18 16:16:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 464 states have (on average 1.3728448275862069) internal successors, (637), 470 states have internal predecessors, (637), 49 states have call successors, (49), 27 states have call predecessors, (49), 27 states have return successors, (58), 45 states have call predecessors, (58), 47 states have call successors, (58) [2024-11-18 16:16:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 744 transitions. [2024-11-18 16:16:13,409 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 744 transitions. Word has length 57 [2024-11-18 16:16:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:13,410 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 744 transitions. [2024-11-18 16:16:13,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:13,410 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 744 transitions. [2024-11-18 16:16:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-18 16:16:13,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:13,414 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:13,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 16:16:13,414 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:13,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:13,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1633634480, now seen corresponding path program 1 times [2024-11-18 16:16:13,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:13,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192413715] [2024-11-18 16:16:13,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:13,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:13,565 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-18 16:16:13,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:13,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192413715] [2024-11-18 16:16:13,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192413715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:13,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:13,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:16:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129672227] [2024-11-18 16:16:13,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:13,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:16:13,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:13,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:16:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:13,570 INFO L87 Difference]: Start difference. First operand 542 states and 744 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:14,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:14,066 INFO L93 Difference]: Finished difference Result 839 states and 1161 transitions. [2024-11-18 16:16:14,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:16:14,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-18 16:16:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:14,072 INFO L225 Difference]: With dead ends: 839 [2024-11-18 16:16:14,073 INFO L226 Difference]: Without dead ends: 652 [2024-11-18 16:16:14,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:16:14,075 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 323 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:14,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 889 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 16:16:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-18 16:16:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 629. [2024-11-18 16:16:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 534 states have (on average 1.3745318352059925) internal successors, (734), 541 states have internal predecessors, (734), 59 states have call successors, (59), 33 states have call predecessors, (59), 34 states have return successors, (71), 56 states have call predecessors, (71), 57 states have call successors, (71) [2024-11-18 16:16:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 864 transitions. [2024-11-18 16:16:14,157 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 864 transitions. Word has length 57 [2024-11-18 16:16:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:14,158 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 864 transitions. [2024-11-18 16:16:14,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 864 transitions. [2024-11-18 16:16:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-18 16:16:14,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:14,160 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:14,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 16:16:14,160 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:14,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:14,160 INFO L85 PathProgramCache]: Analyzing trace with hash 611944974, now seen corresponding path program 1 times [2024-11-18 16:16:14,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:14,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742623828] [2024-11-18 16:16:14,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:14,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:14,278 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-18 16:16:14,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:14,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742623828] [2024-11-18 16:16:14,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742623828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:14,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:14,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:16:14,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51600289] [2024-11-18 16:16:14,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:14,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:16:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:14,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:16:14,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:14,281 INFO L87 Difference]: Start difference. First operand 629 states and 864 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:14,710 INFO L93 Difference]: Finished difference Result 1104 states and 1523 transitions. [2024-11-18 16:16:14,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:16:14,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-18 16:16:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:14,715 INFO L225 Difference]: With dead ends: 1104 [2024-11-18 16:16:14,715 INFO L226 Difference]: Without dead ends: 830 [2024-11-18 16:16:14,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:16:14,716 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 328 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:14,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 842 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 16:16:14,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2024-11-18 16:16:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 789. [2024-11-18 16:16:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 660 states have (on average 1.371212121212121) internal successors, (905), 671 states have internal predecessors, (905), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (101), 76 states have call predecessors, (101), 75 states have call successors, (101) [2024-11-18 16:16:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2024-11-18 16:16:14,777 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 57 [2024-11-18 16:16:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:14,777 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2024-11-18 16:16:14,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2024-11-18 16:16:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-18 16:16:14,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:14,779 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:14,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 16:16:14,780 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:14,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:14,780 INFO L85 PathProgramCache]: Analyzing trace with hash 860091468, now seen corresponding path program 1 times [2024-11-18 16:16:14,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:14,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185311998] [2024-11-18 16:16:14,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:14,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:14,860 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-18 16:16:14,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:14,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185311998] [2024-11-18 16:16:14,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185311998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:14,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:14,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 16:16:14,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590570551] [2024-11-18 16:16:14,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:14,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:16:14,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:14,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:16:14,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:16:14,862 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:14,921 INFO L93 Difference]: Finished difference Result 1237 states and 1721 transitions. [2024-11-18 16:16:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 16:16:14,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-18 16:16:14,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:14,926 INFO L225 Difference]: With dead ends: 1237 [2024-11-18 16:16:14,926 INFO L226 Difference]: Without dead ends: 804 [2024-11-18 16:16:14,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:16:14,928 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:14,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 934 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:14,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-11-18 16:16:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2024-11-18 16:16:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 675 states have (on average 1.362962962962963) internal successors, (920), 686 states have internal predecessors, (920), 77 states have call successors, (77), 45 states have call predecessors, (77), 50 states have return successors, (101), 76 states have call predecessors, (101), 75 states have call successors, (101) [2024-11-18 16:16:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1098 transitions. [2024-11-18 16:16:14,978 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1098 transitions. Word has length 57 [2024-11-18 16:16:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:14,978 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1098 transitions. [2024-11-18 16:16:14,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1098 transitions. [2024-11-18 16:16:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-18 16:16:14,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:14,980 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:14,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 16:16:14,980 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:14,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:14,981 INFO L85 PathProgramCache]: Analyzing trace with hash 787704910, now seen corresponding path program 1 times [2024-11-18 16:16:14,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:14,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125078472] [2024-11-18 16:16:14,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:14,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:15,016 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-18 16:16:15,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:15,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125078472] [2024-11-18 16:16:15,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125078472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:15,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:15,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 16:16:15,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545916543] [2024-11-18 16:16:15,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:15,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 16:16:15,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 16:16:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:16:15,018 INFO L87 Difference]: Start difference. First operand 804 states and 1098 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:15,216 INFO L93 Difference]: Finished difference Result 1663 states and 2300 transitions. [2024-11-18 16:16:15,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 16:16:15,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-18 16:16:15,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:15,225 INFO L225 Difference]: With dead ends: 1663 [2024-11-18 16:16:15,225 INFO L226 Difference]: Without dead ends: 1215 [2024-11-18 16:16:15,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:16:15,228 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 335 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:15,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 633 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 16:16:15,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-11-18 16:16:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1203. [2024-11-18 16:16:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 998 states have (on average 1.346693386773547) internal successors, (1344), 1015 states have internal predecessors, (1344), 119 states have call successors, (119), 73 states have call predecessors, (119), 84 states have return successors, (156), 118 states have call predecessors, (156), 117 states have call successors, (156) [2024-11-18 16:16:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1619 transitions. [2024-11-18 16:16:15,322 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1619 transitions. Word has length 57 [2024-11-18 16:16:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:15,323 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1619 transitions. [2024-11-18 16:16:15,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1619 transitions. [2024-11-18 16:16:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-18 16:16:15,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:15,326 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:15,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 16:16:15,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:15,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:15,330 INFO L85 PathProgramCache]: Analyzing trace with hash -983766065, now seen corresponding path program 1 times [2024-11-18 16:16:15,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:15,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477419146] [2024-11-18 16:16:15,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:15,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:15,394 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-18 16:16:15,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:15,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477419146] [2024-11-18 16:16:15,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477419146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:15,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:15,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 16:16:15,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011998798] [2024-11-18 16:16:15,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:15,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 16:16:15,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:15,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 16:16:15,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:16:15,395 INFO L87 Difference]: Start difference. First operand 1203 states and 1619 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:15,477 INFO L93 Difference]: Finished difference Result 2065 states and 2805 transitions. [2024-11-18 16:16:15,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 16:16:15,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-18 16:16:15,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:15,484 INFO L225 Difference]: With dead ends: 2065 [2024-11-18 16:16:15,484 INFO L226 Difference]: Without dead ends: 1218 [2024-11-18 16:16:15,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 16:16:15,487 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:15,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 930 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:15,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2024-11-18 16:16:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1218. [2024-11-18 16:16:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1013 states have (on average 1.3366238894373148) internal successors, (1354), 1030 states have internal predecessors, (1354), 119 states have call successors, (119), 73 states have call predecessors, (119), 84 states have return successors, (156), 118 states have call predecessors, (156), 117 states have call successors, (156) [2024-11-18 16:16:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1629 transitions. [2024-11-18 16:16:15,625 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1629 transitions. Word has length 57 [2024-11-18 16:16:15,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:15,625 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1629 transitions. [2024-11-18 16:16:15,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1629 transitions. [2024-11-18 16:16:15,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-18 16:16:15,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:15,627 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:15,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 16:16:15,628 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:15,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:15,628 INFO L85 PathProgramCache]: Analyzing trace with hash 939461969, now seen corresponding path program 1 times [2024-11-18 16:16:15,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:15,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255029288] [2024-11-18 16:16:15,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:15,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:15,743 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-18 16:16:15,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:15,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255029288] [2024-11-18 16:16:15,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255029288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:15,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:15,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:16:15,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108792604] [2024-11-18 16:16:15,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:15,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:16:15,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:15,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:16:15,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:15,746 INFO L87 Difference]: Start difference. First operand 1218 states and 1629 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:16,165 INFO L93 Difference]: Finished difference Result 1640 states and 2199 transitions. [2024-11-18 16:16:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:16:16,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-18 16:16:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:16,172 INFO L225 Difference]: With dead ends: 1640 [2024-11-18 16:16:16,172 INFO L226 Difference]: Without dead ends: 1098 [2024-11-18 16:16:16,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:16:16,175 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 320 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:16,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 691 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 16:16:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-11-18 16:16:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1046. [2024-11-18 16:16:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 876 states have (on average 1.3344748858447488) internal successors, (1169), 885 states have internal predecessors, (1169), 103 states have call successors, (103), 62 states have call predecessors, (103), 65 states have return successors, (118), 100 states have call predecessors, (118), 101 states have call successors, (118) [2024-11-18 16:16:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1390 transitions. [2024-11-18 16:16:16,285 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1390 transitions. Word has length 57 [2024-11-18 16:16:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:16,285 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1390 transitions. [2024-11-18 16:16:16,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1390 transitions. [2024-11-18 16:16:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-18 16:16:16,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:16,287 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:16,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 16:16:16,287 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:16,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1158316687, now seen corresponding path program 1 times [2024-11-18 16:16:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:16,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521002505] [2024-11-18 16:16:16,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:16,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:16,386 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-18 16:16:16,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:16,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521002505] [2024-11-18 16:16:16,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521002505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:16,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:16,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:16:16,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135585638] [2024-11-18 16:16:16,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:16,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:16:16,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:16,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:16:16,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:16,389 INFO L87 Difference]: Start difference. First operand 1046 states and 1390 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:16,858 INFO L93 Difference]: Finished difference Result 2173 states and 2862 transitions. [2024-11-18 16:16:16,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:16:16,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-18 16:16:16,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:16,868 INFO L225 Difference]: With dead ends: 2173 [2024-11-18 16:16:16,868 INFO L226 Difference]: Without dead ends: 1484 [2024-11-18 16:16:16,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:16:16,871 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 325 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:16,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 673 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 16:16:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2024-11-18 16:16:16,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1366. [2024-11-18 16:16:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1134 states have (on average 1.32010582010582) internal successors, (1497), 1149 states have internal predecessors, (1497), 137 states have call successors, (137), 84 states have call predecessors, (137), 93 states have return successors, (166), 136 states have call predecessors, (166), 135 states have call successors, (166) [2024-11-18 16:16:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1800 transitions. [2024-11-18 16:16:16,970 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1800 transitions. Word has length 57 [2024-11-18 16:16:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:16,970 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1800 transitions. [2024-11-18 16:16:16,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1800 transitions. [2024-11-18 16:16:16,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-18 16:16:16,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:16,973 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:16,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 16:16:16,973 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:16,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:16,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1581018513, now seen corresponding path program 1 times [2024-11-18 16:16:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:16,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193420544] [2024-11-18 16:16:16,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:16,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:17,071 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-18 16:16:17,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:17,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193420544] [2024-11-18 16:16:17,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193420544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:17,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:17,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 16:16:17,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631951228] [2024-11-18 16:16:17,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:17,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:16:17,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:17,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:16:17,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:17,073 INFO L87 Difference]: Start difference. First operand 1366 states and 1800 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:17,557 INFO L93 Difference]: Finished difference Result 2145 states and 2821 transitions. [2024-11-18 16:16:17,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 16:16:17,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-18 16:16:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:17,565 INFO L225 Difference]: With dead ends: 2145 [2024-11-18 16:16:17,565 INFO L226 Difference]: Without dead ends: 1432 [2024-11-18 16:16:17,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 16:16:17,568 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 306 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:17,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 656 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 16:16:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2024-11-18 16:16:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1358. [2024-11-18 16:16:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1130 states have (on average 1.3176991150442479) internal successors, (1489), 1141 states have internal predecessors, (1489), 137 states have call successors, (137), 84 states have call predecessors, (137), 89 states have return successors, (156), 134 states have call predecessors, (156), 135 states have call successors, (156) [2024-11-18 16:16:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1782 transitions. [2024-11-18 16:16:17,649 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1782 transitions. Word has length 57 [2024-11-18 16:16:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:17,649 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1782 transitions. [2024-11-18 16:16:17,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 16:16:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1782 transitions. [2024-11-18 16:16:17,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-18 16:16:17,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:17,651 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:17,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 16:16:17,651 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:17,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:17,651 INFO L85 PathProgramCache]: Analyzing trace with hash 763370063, now seen corresponding path program 1 times [2024-11-18 16:16:17,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:17,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191801046] [2024-11-18 16:16:17,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:17,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:17,677 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-18 16:16:17,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:17,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191801046] [2024-11-18 16:16:17,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191801046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:17,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:17,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:16:17,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588415520] [2024-11-18 16:16:17,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:17,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:17,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:17,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:17,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:17,679 INFO L87 Difference]: Start difference. First operand 1358 states and 1782 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-18 16:16:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:17,803 INFO L93 Difference]: Finished difference Result 2779 states and 3644 transitions. [2024-11-18 16:16:17,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:17,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-11-18 16:16:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:17,813 INFO L225 Difference]: With dead ends: 2779 [2024-11-18 16:16:17,814 INFO L226 Difference]: Without dead ends: 1778 [2024-11-18 16:16:17,817 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-18 16:16:17,818 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 205 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:17,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 358 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2024-11-18 16:16:17,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1770. [2024-11-18 16:16:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1460 states have (on average 1.3006849315068494) internal successors, (1899), 1481 states have internal predecessors, (1899), 185 states have call successors, (185), 116 states have call predecessors, (185), 123 states have return successors, (206), 174 states have call predecessors, (206), 183 states have call successors, (206) [2024-11-18 16:16:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2290 transitions. [2024-11-18 16:16:17,943 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2290 transitions. Word has length 57 [2024-11-18 16:16:17,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:17,944 INFO L471 AbstractCegarLoop]: Abstraction has 1770 states and 2290 transitions. [2024-11-18 16:16:17,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-18 16:16:17,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2290 transitions. [2024-11-18 16:16:17,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-18 16:16:17,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:17,947 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:17,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 16:16:17,947 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:17,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:17,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1207485526, now seen corresponding path program 1 times [2024-11-18 16:16:17,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:17,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501672132] [2024-11-18 16:16:17,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:17,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 16:16:17,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:17,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501672132] [2024-11-18 16:16:17,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501672132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:17,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:17,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:16:17,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53843488] [2024-11-18 16:16:17,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:17,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:17,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:17,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:17,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:17,993 INFO L87 Difference]: Start difference. First operand 1770 states and 2290 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 16:16:18,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:18,124 INFO L93 Difference]: Finished difference Result 2282 states and 2987 transitions. [2024-11-18 16:16:18,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:18,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2024-11-18 16:16:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:18,135 INFO L225 Difference]: With dead ends: 2282 [2024-11-18 16:16:18,135 INFO L226 Difference]: Without dead ends: 1943 [2024-11-18 16:16:18,138 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-18 16:16:18,139 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 55 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:18,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 520 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2024-11-18 16:16:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1943. [2024-11-18 16:16:18,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1943 states, 1611 states have (on average 1.2911235257603972) internal successors, (2080), 1632 states have internal predecessors, (2080), 199 states have call successors, (199), 124 states have call predecessors, (199), 131 states have return successors, (228), 188 states have call predecessors, (228), 197 states have call successors, (228) [2024-11-18 16:16:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2507 transitions. [2024-11-18 16:16:18,261 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 2507 transitions. Word has length 62 [2024-11-18 16:16:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:18,262 INFO L471 AbstractCegarLoop]: Abstraction has 1943 states and 2507 transitions. [2024-11-18 16:16:18,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 16:16:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2507 transitions. [2024-11-18 16:16:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-18 16:16:18,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:18,264 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:18,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-18 16:16:18,264 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:18,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:18,265 INFO L85 PathProgramCache]: Analyzing trace with hash -231379727, now seen corresponding path program 1 times [2024-11-18 16:16:18,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:18,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173115170] [2024-11-18 16:16:18,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:18,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 16:16:18,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173115170] [2024-11-18 16:16:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173115170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:18,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:18,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:16:18,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867989699] [2024-11-18 16:16:18,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:18,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:18,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:18,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:18,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:18,302 INFO L87 Difference]: Start difference. First operand 1943 states and 2507 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 16:16:18,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:18,431 INFO L93 Difference]: Finished difference Result 2490 states and 3228 transitions. [2024-11-18 16:16:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:18,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-18 16:16:18,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:18,443 INFO L225 Difference]: With dead ends: 2490 [2024-11-18 16:16:18,444 INFO L226 Difference]: Without dead ends: 2070 [2024-11-18 16:16:18,446 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-18 16:16:18,447 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 199 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:18,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 320 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2024-11-18 16:16:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 2070. [2024-11-18 16:16:18,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2070 states, 1724 states have (on average 1.283062645011601) internal successors, (2212), 1745 states have internal predecessors, (2212), 207 states have call successors, (207), 130 states have call predecessors, (207), 137 states have return successors, (240), 196 states have call predecessors, (240), 205 states have call successors, (240) [2024-11-18 16:16:18,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 2659 transitions. [2024-11-18 16:16:18,585 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 2659 transitions. Word has length 67 [2024-11-18 16:16:18,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:18,585 INFO L471 AbstractCegarLoop]: Abstraction has 2070 states and 2659 transitions. [2024-11-18 16:16:18,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 16:16:18,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2659 transitions. [2024-11-18 16:16:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-18 16:16:18,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:18,588 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:18,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-18 16:16:18,589 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:18,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:18,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2093542921, now seen corresponding path program 1 times [2024-11-18 16:16:18,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:18,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261993161] [2024-11-18 16:16:18,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:18,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 16:16:18,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:18,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261993161] [2024-11-18 16:16:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261993161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:18,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28572974] [2024-11-18 16:16:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:18,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:18,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:18,649 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-18 16:16:18,651 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-18 16:16:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:18,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 16:16:18,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:16:18,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 16:16:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 16:16:18,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28572974] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:18,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-18 16:16:18,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 7 [2024-11-18 16:16:18,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746213197] [2024-11-18 16:16:18,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:18,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 16:16:18,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:18,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 16:16:18,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:16:18,934 INFO L87 Difference]: Start difference. First operand 2070 states and 2659 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 16:16:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:19,160 INFO L93 Difference]: Finished difference Result 2126 states and 2727 transitions. [2024-11-18 16:16:19,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 16:16:19,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2024-11-18 16:16:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:19,173 INFO L225 Difference]: With dead ends: 2126 [2024-11-18 16:16:19,173 INFO L226 Difference]: Without dead ends: 2123 [2024-11-18 16:16:19,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-18 16:16:19,175 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 401 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:19,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 328 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 16:16:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2024-11-18 16:16:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2069. [2024-11-18 16:16:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 1724 states have (on average 1.2819025522041763) internal successors, (2210), 1744 states have internal predecessors, (2210), 206 states have call successors, (206), 130 states have call predecessors, (206), 137 states have return successors, (240), 196 states have call predecessors, (240), 205 states have call successors, (240) [2024-11-18 16:16:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 2656 transitions. [2024-11-18 16:16:19,387 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 2656 transitions. Word has length 68 [2024-11-18 16:16:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:19,387 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 2656 transitions. [2024-11-18 16:16:19,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 16:16:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2656 transitions. [2024-11-18 16:16:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-18 16:16:19,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:19,391 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:19,412 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-18 16:16:19,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-18 16:16:19,592 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:19,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:19,593 INFO L85 PathProgramCache]: Analyzing trace with hash -475909068, now seen corresponding path program 1 times [2024-11-18 16:16:19,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:19,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113923710] [2024-11-18 16:16:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:19,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 16:16:19,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:19,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113923710] [2024-11-18 16:16:19,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113923710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:19,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904537752] [2024-11-18 16:16:19,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:19,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:19,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:19,664 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-18 16:16:19,665 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-18 16:16:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:19,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 16:16:19,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:20,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 16:16:20,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 16:16:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 16:16:20,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904537752] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 16:16:20,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 16:16:20,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2024-11-18 16:16:20,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749182808] [2024-11-18 16:16:20,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 16:16:20,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 16:16:20,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:20,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 16:16:20,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-18 16:16:20,145 INFO L87 Difference]: Start difference. First operand 2069 states and 2656 transitions. Second operand has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-18 16:16:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:20,697 INFO L93 Difference]: Finished difference Result 3413 states and 4440 transitions. [2024-11-18 16:16:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-18 16:16:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2024-11-18 16:16:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:20,712 INFO L225 Difference]: With dead ends: 3413 [2024-11-18 16:16:20,713 INFO L226 Difference]: Without dead ends: 2920 [2024-11-18 16:16:20,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2024-11-18 16:16:20,716 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 551 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1985 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:20,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1985 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 16:16:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2024-11-18 16:16:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2426. [2024-11-18 16:16:20,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 2045 states have (on average 1.2748166259168705) internal successors, (2607), 2070 states have internal predecessors, (2607), 226 states have call successors, (226), 144 states have call predecessors, (226), 153 states have return successors, (271), 213 states have call predecessors, (271), 225 states have call successors, (271) [2024-11-18 16:16:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3104 transitions. [2024-11-18 16:16:20,905 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3104 transitions. Word has length 69 [2024-11-18 16:16:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:20,906 INFO L471 AbstractCegarLoop]: Abstraction has 2426 states and 3104 transitions. [2024-11-18 16:16:20,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 7 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-18 16:16:20,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3104 transitions. [2024-11-18 16:16:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-18 16:16:20,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:20,911 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:20,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 16:16:21,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-18 16:16:21,112 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:21,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1613897456, now seen corresponding path program 1 times [2024-11-18 16:16:21,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:21,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25724283] [2024-11-18 16:16:21,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:21,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-18 16:16:21,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:21,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25724283] [2024-11-18 16:16:21,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25724283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:21,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204374454] [2024-11-18 16:16:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:21,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:21,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:21,186 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-18 16:16:21,188 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-18 16:16:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:21,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 16:16:21,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-18 16:16:21,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:21,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204374454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:21,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:21,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 16:16:21,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554655614] [2024-11-18 16:16:21,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:21,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:21,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:21,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:21,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:21,310 INFO L87 Difference]: Start difference. First operand 2426 states and 3104 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-18 16:16:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:21,500 INFO L93 Difference]: Finished difference Result 3072 states and 3945 transitions. [2024-11-18 16:16:21,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:21,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-18 16:16:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:21,516 INFO L225 Difference]: With dead ends: 3072 [2024-11-18 16:16:21,517 INFO L226 Difference]: Without dead ends: 2308 [2024-11-18 16:16:21,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:21,520 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 197 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:21,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 342 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:21,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2024-11-18 16:16:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2293. [2024-11-18 16:16:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 1926 states have (on average 1.2725856697819315) internal successors, (2451), 1952 states have internal predecessors, (2451), 218 states have call successors, (218), 138 states have call predecessors, (218), 147 states have return successors, (259), 204 states have call predecessors, (259), 217 states have call successors, (259) [2024-11-18 16:16:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 2928 transitions. [2024-11-18 16:16:21,696 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 2928 transitions. Word has length 88 [2024-11-18 16:16:21,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:21,697 INFO L471 AbstractCegarLoop]: Abstraction has 2293 states and 2928 transitions. [2024-11-18 16:16:21,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-18 16:16:21,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 2928 transitions. [2024-11-18 16:16:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-18 16:16:21,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:21,701 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 16:16:21,723 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-18 16:16:21,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:21,902 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:21,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:21,903 INFO L85 PathProgramCache]: Analyzing trace with hash 667474523, now seen corresponding path program 1 times [2024-11-18 16:16:21,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:21,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30366283] [2024-11-18 16:16:21,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:21,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-18 16:16:22,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:22,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30366283] [2024-11-18 16:16:22,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30366283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:22,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:22,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 16:16:22,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978813567] [2024-11-18 16:16:22,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:22,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 16:16:22,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:22,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 16:16:22,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:16:22,013 INFO L87 Difference]: Start difference. First operand 2293 states and 2928 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 16:16:22,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:22,492 INFO L93 Difference]: Finished difference Result 5088 states and 6591 transitions. [2024-11-18 16:16:22,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 16:16:22,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2024-11-18 16:16:22,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:22,514 INFO L225 Difference]: With dead ends: 5088 [2024-11-18 16:16:22,515 INFO L226 Difference]: Without dead ends: 3677 [2024-11-18 16:16:22,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-18 16:16:22,522 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 279 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:22,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 389 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 16:16:22,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2024-11-18 16:16:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 3655. [2024-11-18 16:16:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3655 states, 3009 states have (on average 1.268195413758724) internal successors, (3816), 3062 states have internal predecessors, (3816), 371 states have call successors, (371), 238 states have call predecessors, (371), 273 states have return successors, (505), 358 states have call predecessors, (505), 370 states have call successors, (505) [2024-11-18 16:16:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 4692 transitions. [2024-11-18 16:16:22,985 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 4692 transitions. Word has length 93 [2024-11-18 16:16:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:22,985 INFO L471 AbstractCegarLoop]: Abstraction has 3655 states and 4692 transitions. [2024-11-18 16:16:22,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 16:16:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 4692 transitions. [2024-11-18 16:16:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-18 16:16:22,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:22,992 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 16:16:22,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-18 16:16:22,992 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:22,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:22,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1211656423, now seen corresponding path program 1 times [2024-11-18 16:16:22,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:22,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702795865] [2024-11-18 16:16:22,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:22,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:23,029 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-18 16:16:23,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:23,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702795865] [2024-11-18 16:16:23,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702795865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:23,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:23,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 16:16:23,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040302540] [2024-11-18 16:16:23,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:23,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:23,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:23,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 16:16:23,032 INFO L87 Difference]: Start difference. First operand 3655 states and 4692 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 16:16:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:23,368 INFO L93 Difference]: Finished difference Result 5786 states and 7409 transitions. [2024-11-18 16:16:23,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:23,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2024-11-18 16:16:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:23,385 INFO L225 Difference]: With dead ends: 5786 [2024-11-18 16:16:23,386 INFO L226 Difference]: Without dead ends: 3013 [2024-11-18 16:16:23,394 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-18 16:16:23,395 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 137 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:23,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 324 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:23,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2024-11-18 16:16:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3013. [2024-11-18 16:16:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 2500 states have (on average 1.2636) internal successors, (3159), 2544 states have internal predecessors, (3159), 292 states have call successors, (292), 188 states have call predecessors, (292), 219 states have return successors, (395), 282 states have call predecessors, (395), 291 states have call successors, (395) [2024-11-18 16:16:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 3846 transitions. [2024-11-18 16:16:23,674 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 3846 transitions. Word has length 93 [2024-11-18 16:16:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:23,675 INFO L471 AbstractCegarLoop]: Abstraction has 3013 states and 3846 transitions. [2024-11-18 16:16:23,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 16:16:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 3846 transitions. [2024-11-18 16:16:23,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-18 16:16:23,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:23,681 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 16:16:23,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-18 16:16:23,682 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:23,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:23,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1243514336, now seen corresponding path program 1 times [2024-11-18 16:16:23,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:23,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314162788] [2024-11-18 16:16:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:23,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:23,763 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 16:16:23,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:23,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314162788] [2024-11-18 16:16:23,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314162788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:23,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:23,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 16:16:23,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210069337] [2024-11-18 16:16:23,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:23,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 16:16:23,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:23,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 16:16:23,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:16:23,767 INFO L87 Difference]: Start difference. First operand 3013 states and 3846 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-18 16:16:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:24,702 INFO L93 Difference]: Finished difference Result 6235 states and 8101 transitions. [2024-11-18 16:16:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 16:16:24,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2024-11-18 16:16:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:24,740 INFO L225 Difference]: With dead ends: 6235 [2024-11-18 16:16:24,742 INFO L226 Difference]: Without dead ends: 4104 [2024-11-18 16:16:24,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-18 16:16:24,753 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 1040 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:24,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1021 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 16:16:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4104 states. [2024-11-18 16:16:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4104 to 4021. [2024-11-18 16:16:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4021 states, 3327 states have (on average 1.2437631499849715) internal successors, (4138), 3383 states have internal predecessors, (4138), 387 states have call successors, (387), 259 states have call predecessors, (387), 305 states have return successors, (546), 380 states have call predecessors, (546), 386 states have call successors, (546) [2024-11-18 16:16:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 5071 transitions. [2024-11-18 16:16:25,122 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 5071 transitions. Word has length 95 [2024-11-18 16:16:25,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:25,123 INFO L471 AbstractCegarLoop]: Abstraction has 4021 states and 5071 transitions. [2024-11-18 16:16:25,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-18 16:16:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 5071 transitions. [2024-11-18 16:16:25,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-18 16:16:25,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:25,129 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:25,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-18 16:16:25,129 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:25,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash -801124630, now seen corresponding path program 1 times [2024-11-18 16:16:25,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:25,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21867184] [2024-11-18 16:16:25,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:25,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-18 16:16:25,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:25,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21867184] [2024-11-18 16:16:25,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21867184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:25,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885955877] [2024-11-18 16:16:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:25,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:25,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:25,208 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-18 16:16:25,209 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-18 16:16:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:25,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 16:16:25,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 16:16:25,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:25,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885955877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:25,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:25,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 16:16:25,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717113104] [2024-11-18 16:16:25,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:25,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:25,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:25,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:25,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:25,339 INFO L87 Difference]: Start difference. First operand 4021 states and 5071 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 16:16:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:25,672 INFO L93 Difference]: Finished difference Result 4398 states and 5537 transitions. [2024-11-18 16:16:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:25,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2024-11-18 16:16:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:25,701 INFO L225 Difference]: With dead ends: 4398 [2024-11-18 16:16:25,701 INFO L226 Difference]: Without dead ends: 3153 [2024-11-18 16:16:25,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 16:16:25,706 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 62 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:25,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 492 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2024-11-18 16:16:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 3153. [2024-11-18 16:16:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3153 states, 2555 states have (on average 1.2414872798434442) internal successors, (3172), 2602 states have internal predecessors, (3172), 330 states have call successors, (330), 222 states have call predecessors, (330), 267 states have return successors, (461), 330 states have call predecessors, (461), 330 states have call successors, (461) [2024-11-18 16:16:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3153 states to 3153 states and 3963 transitions. [2024-11-18 16:16:25,967 INFO L78 Accepts]: Start accepts. Automaton has 3153 states and 3963 transitions. Word has length 103 [2024-11-18 16:16:25,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:25,968 INFO L471 AbstractCegarLoop]: Abstraction has 3153 states and 3963 transitions. [2024-11-18 16:16:25,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 16:16:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3153 states and 3963 transitions. [2024-11-18 16:16:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-18 16:16:25,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:25,974 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 16:16:25,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 16:16:26,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:26,176 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:26,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:26,177 INFO L85 PathProgramCache]: Analyzing trace with hash -291436951, now seen corresponding path program 1 times [2024-11-18 16:16:26,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:26,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415829107] [2024-11-18 16:16:26,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:26,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-18 16:16:26,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:26,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415829107] [2024-11-18 16:16:26,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415829107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:26,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446797095] [2024-11-18 16:16:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:26,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:26,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:26,268 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-18 16:16:26,270 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-18 16:16:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:26,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 16:16:26,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:26,435 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-18 16:16:26,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:26,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446797095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:26,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:26,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-18 16:16:26,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219490270] [2024-11-18 16:16:26,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:26,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:26,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:26,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:26,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:16:26,438 INFO L87 Difference]: Start difference. First operand 3153 states and 3963 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-18 16:16:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:26,825 INFO L93 Difference]: Finished difference Result 6470 states and 8240 transitions. [2024-11-18 16:16:26,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:26,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 138 [2024-11-18 16:16:26,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:26,844 INFO L225 Difference]: With dead ends: 6470 [2024-11-18 16:16:26,844 INFO L226 Difference]: Without dead ends: 3464 [2024-11-18 16:16:26,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:16:26,857 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 101 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:26,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 166 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:26,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2024-11-18 16:16:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3316. [2024-11-18 16:16:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3316 states, 2711 states have (on average 1.1947620804131316) internal successors, (3239), 2750 states have internal predecessors, (3239), 333 states have call successors, (333), 237 states have call predecessors, (333), 271 states have return successors, (410), 330 states have call predecessors, (410), 333 states have call successors, (410) [2024-11-18 16:16:27,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 3982 transitions. [2024-11-18 16:16:27,308 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 3982 transitions. Word has length 138 [2024-11-18 16:16:27,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:27,309 INFO L471 AbstractCegarLoop]: Abstraction has 3316 states and 3982 transitions. [2024-11-18 16:16:27,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-18 16:16:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 3982 transitions. [2024-11-18 16:16:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-18 16:16:27,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:27,316 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 16:16:27,338 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-18 16:16:27,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-18 16:16:27,521 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:27,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:27,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2075512362, now seen corresponding path program 1 times [2024-11-18 16:16:27,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:27,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449415186] [2024-11-18 16:16:27,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:27,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-18 16:16:27,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:27,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449415186] [2024-11-18 16:16:27,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449415186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770347541] [2024-11-18 16:16:27,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:27,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:27,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:27,626 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-18 16:16:27,627 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-18 16:16:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:27,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 16:16:27,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-18 16:16:27,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:27,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770347541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:27,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:27,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-18 16:16:27,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001821943] [2024-11-18 16:16:27,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:27,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 16:16:27,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:27,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 16:16:27,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:16:27,780 INFO L87 Difference]: Start difference. First operand 3316 states and 3982 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-18 16:16:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:28,006 INFO L93 Difference]: Finished difference Result 5136 states and 6173 transitions. [2024-11-18 16:16:28,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 16:16:28,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 139 [2024-11-18 16:16:28,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:28,022 INFO L225 Difference]: With dead ends: 5136 [2024-11-18 16:16:28,022 INFO L226 Difference]: Without dead ends: 3136 [2024-11-18 16:16:28,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 16:16:28,029 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 97 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:28,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 368 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2024-11-18 16:16:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 3134. [2024-11-18 16:16:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3134 states, 2583 states have (on average 1.1897018970189701) internal successors, (3073), 2620 states have internal predecessors, (3073), 298 states have call successors, (298), 220 states have call predecessors, (298), 252 states have return successors, (360), 295 states have call predecessors, (360), 298 states have call successors, (360) [2024-11-18 16:16:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 3731 transitions. [2024-11-18 16:16:28,302 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 3731 transitions. Word has length 139 [2024-11-18 16:16:28,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:28,303 INFO L471 AbstractCegarLoop]: Abstraction has 3134 states and 3731 transitions. [2024-11-18 16:16:28,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-18 16:16:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 3731 transitions. [2024-11-18 16:16:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-18 16:16:28,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:28,308 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 16:16:28,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 16:16:28,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:28,509 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:28,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:28,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1715579866, now seen corresponding path program 1 times [2024-11-18 16:16:28,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:28,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604211921] [2024-11-18 16:16:28,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:28,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 16:16:28,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:28,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604211921] [2024-11-18 16:16:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604211921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:28,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 16:16:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 16:16:28,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256358209] [2024-11-18 16:16:28,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:28,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 16:16:28,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:28,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 16:16:28,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:16:28,649 INFO L87 Difference]: Start difference. First operand 3134 states and 3731 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-18 16:16:29,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:29,099 INFO L93 Difference]: Finished difference Result 6168 states and 7363 transitions. [2024-11-18 16:16:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 16:16:29,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 140 [2024-11-18 16:16:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:29,117 INFO L225 Difference]: With dead ends: 6168 [2024-11-18 16:16:29,117 INFO L226 Difference]: Without dead ends: 3600 [2024-11-18 16:16:29,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 16:16:29,126 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 219 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:29,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 433 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 16:16:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2024-11-18 16:16:29,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 3571. [2024-11-18 16:16:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 2944 states have (on average 1.1905570652173914) internal successors, (3505), 2983 states have internal predecessors, (3505), 342 states have call successors, (342), 250 states have call predecessors, (342), 284 states have return successors, (410), 339 states have call predecessors, (410), 342 states have call successors, (410) [2024-11-18 16:16:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 4257 transitions. [2024-11-18 16:16:29,455 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 4257 transitions. Word has length 140 [2024-11-18 16:16:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:29,456 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 4257 transitions. [2024-11-18 16:16:29,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-18 16:16:29,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 4257 transitions. [2024-11-18 16:16:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-18 16:16:29,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:29,487 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:29,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-18 16:16:29,487 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:29,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:29,488 INFO L85 PathProgramCache]: Analyzing trace with hash -575413283, now seen corresponding path program 1 times [2024-11-18 16:16:29,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:29,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587757478] [2024-11-18 16:16:29,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:29,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-18 16:16:29,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:29,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587757478] [2024-11-18 16:16:29,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587757478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:29,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039047909] [2024-11-18 16:16:29,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:29,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:29,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:29,611 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-18 16:16:29,613 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-18 16:16:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:29,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 16:16:29,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-18 16:16:29,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:29,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039047909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:29,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:29,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-18 16:16:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013509096] [2024-11-18 16:16:29,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:29,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 16:16:29,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:29,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 16:16:29,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-18 16:16:29,792 INFO L87 Difference]: Start difference. First operand 3571 states and 4257 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 16:16:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:29,934 INFO L93 Difference]: Finished difference Result 5080 states and 6009 transitions. [2024-11-18 16:16:29,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 16:16:29,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 161 [2024-11-18 16:16:29,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:29,944 INFO L225 Difference]: With dead ends: 5080 [2024-11-18 16:16:29,944 INFO L226 Difference]: Without dead ends: 1523 [2024-11-18 16:16:29,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-18 16:16:29,952 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:29,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 681 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 16:16:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2024-11-18 16:16:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1506. [2024-11-18 16:16:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1258 states have (on average 1.1573926868044515) internal successors, (1456), 1270 states have internal predecessors, (1456), 122 states have call successors, (122), 92 states have call predecessors, (122), 125 states have return successors, (160), 143 states have call predecessors, (160), 122 states have call successors, (160) [2024-11-18 16:16:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1738 transitions. [2024-11-18 16:16:30,076 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1738 transitions. Word has length 161 [2024-11-18 16:16:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:30,077 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 1738 transitions. [2024-11-18 16:16:30,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-18 16:16:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1738 transitions. [2024-11-18 16:16:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-18 16:16:30,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 16:16:30,081 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 16:16:30,101 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-18 16:16:30,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:30,281 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 16:16:30,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 16:16:30,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1040199976, now seen corresponding path program 1 times [2024-11-18 16:16:30,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 16:16:30,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122257537] [2024-11-18 16:16:30,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:30,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 16:16:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 35 proven. 12 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-18 16:16:30,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 16:16:30,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122257537] [2024-11-18 16:16:30,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122257537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 16:16:30,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139113343] [2024-11-18 16:16:30,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 16:16:30,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 16:16:30,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 16:16:30,472 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 16:16:30,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 16:16:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 16:16:30,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 16:16:30,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 16:16:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-18 16:16:30,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 16:16:30,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139113343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 16:16:30,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 16:16:30,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2024-11-18 16:16:30,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076610813] [2024-11-18 16:16:30,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 16:16:30,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 16:16:30,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 16:16:30,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 16:16:30,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-18 16:16:30,743 INFO L87 Difference]: Start difference. First operand 1506 states and 1738 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-18 16:16:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 16:16:30,946 INFO L93 Difference]: Finished difference Result 2131 states and 2505 transitions. [2024-11-18 16:16:30,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 16:16:30,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 166 [2024-11-18 16:16:30,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 16:16:30,952 INFO L225 Difference]: With dead ends: 2131 [2024-11-18 16:16:30,952 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 16:16:30,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-18 16:16:30,957 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 106 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 16:16:30,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 147 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 16:16:30,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 16:16:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 16:16:30,958 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-18 16:16:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 16:16:30,961 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 166 [2024-11-18 16:16:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 16:16:30,962 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 16:16:30,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-18 16:16:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 16:16:30,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 16:16:30,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-18 16:16:30,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-18 16:16:30,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-18 16:16:31,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-18 16:16:31,169 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 16:16:31,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 16:16:47,101 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 16:16:47,202 WARN L156 FloydHoareUtils]: Requires clause for immediate_notify contained old-variable. Original clause: (and (= |old(~t1_st~0)| ~t1_st~0) (let ((.cse12 (= ~token~0 ~local~0)) (.cse14 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= |old(~m_st~0)| 0))) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~t1_pc~0 0) .cse4 .cse5 .cse6 (= |old(~t1_st~0)| 0) .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 (= ~E_M~0 ~M_E~0) .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~E_M~0) .cse6 (<= 2 |old(~t1_st~0)|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13))) (not (= ~m_st~0 0))) Eliminated clause: (and (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~m_i~0 1)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~token~0 ~local~0)) (.cse13 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~E_M~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 (= (+ ~local~0 1) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 .cse3 (= ~t1_pc~0 0) .cse4 .cse5 .cse6 .cse7 (= ~t1_st~0 0) .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 (= ~E_M~0 2) .cse12 .cse13))) (not (= ~m_st~0 0))) [2024-11-18 16:16:47,281 WARN L156 FloydHoareUtils]: Requires clause for immediate_notify_threads contained old-variable. Original clause: (let ((.cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse1 (= 2 |old(~c_dr_st~0)|)) (.cse0 (= ~q_free~0 1))) (and (or (not .cse0) (<= 2 ~p_dw_st~0)) (or (= ~c_dr_st~0 2) (not .cse1) (not .cse2)) (let ((.cse3 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~E_1~0 ~M_E~0)) (.cse5 (= ~t1_pc~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse3 .cse4 .cse5 .cse6 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11 .cse1 .cse12) (and .cse3 .cse4 (= ~c_num_read~0 ~p_num_write~0) .cse5 .cse6 .cse7 .cse0 .cse9 .cse10 (<= 2 |old(~p_dw_st~0)|) (= ~c_last_read~0 ~p_last_write~0) .cse11 .cse12) (and (= ~p_dw_pc~0 0) .cse3 .cse4 (= ~c_num_read~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_dr_pc~0 0) .cse10 (= ~p_num_write~0 1) .cse11 .cse12))))) Eliminated clause: (let ((.cse0 (= ~q_free~0 1))) (and (or (< 1 ~p_dw_st~0) (not .cse0)) (exists ((|old(~c_dr_st~0)| Int) (|old(~p_dw_st~0)| Int)) (let ((.cse12 (= 2 |old(~c_dr_st~0)|)) (.cse11 (= (+ ~c_num_read~0 1) ~p_num_write~0))) (and (let ((.cse1 (= ~t1_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~m_st~0 0)) (.cse10 (= ~q_free~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ~M_E~0 2))) (or (and (= ~c_num_read~0 ~p_num_write~0) .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 .cse6 (<= 2 |old(~p_dw_st~0)|) (= ~c_last_read~0 ~p_last_write~0) .cse7 .cse8 .cse9) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 (= ~c_dr_pc~0 0) .cse6 (= ~p_num_write~0 1) .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse12 .cse8 .cse9))) (or (= ~c_dr_st~0 2) (not .cse12) (not .cse11))))))) [2024-11-18 16:16:47,321 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 16:16:47,354 WARN L156 FloydHoareUtils]: Requires clause for fire_delta_events2 contained old-variable. Original clause: (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (let ((.cse16 (= ~m_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse8 (<= 2 |old(~E_M~0)|)) (.cse10 (<= 2 |old(~E_1~0)|)) (.cse12 (not .cse16)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 (= ~t1_pc~0 0) .cse5 .cse6 .cse16 .cse7 (= |old(~T1_E~0)| |old(~M_E~0)|) (= ~t1_st~0 0) .cse9 .cse11 .cse13 (= ~m_pc~0 0) .cse14 (= |old(~E_M~0)| |old(~M_E~0)|) .cse15 (= |old(~E_1~0)| |old(~M_E~0)|) (= 2 |old(~M_E~0)|))))) (= ~E_1~0 |old(~E_1~0)|)) Eliminated clause: (let ((.cse15 (= ~m_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not .cse15)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse4 .cse5 (= ~t1_pc~0 0) .cse6 .cse7 (= ~T1_E~0 2) .cse15 .cse9 (= ~t1_st~0 0) .cse10 .cse11 .cse13 (= ~m_pc~0 0) .cse14 (= ~E_M~0 2) .cse16 (= ~E_1~0 2) (= ~M_E~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16)))) [2024-11-18 16:16:47,445 WARN L156 FloydHoareUtils]: Requires clause for activate_threads2 contained old-variable. Original clause: (let ((.cse2 (= ~m_st~0 0)) (.cse26 (= |old(~m_st~0)| 0))) (let ((.cse4 (not .cse26)) (.cse0 (= ~t1_pc~0 1)) (.cse22 (= ~t1_pc~0 0)) (.cse3 (= ~t1_st~0 0)) (.cse1 (not .cse2))) (and (or (not .cse0) (and (= |old(~t1_st~0)| ~t1_st~0) .cse1)) (or (and .cse2 .cse3) .cse4) (let ((.cse23 (= |old(~t1_st~0)| 0)) (.cse24 (= ~m_pc~0 0)) (.cse25 (= ~E_M~0 ~M_E~0)) (.cse7 (<= 2 ~E_1~0)) (.cse11 (= (+ ~local~0 1) ~token~0)) (.cse5 (= ~p_dw_pc~0 0)) (.cse6 (= ~T1_E~0 ~M_E~0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse10 (= ~t1_i~0 1)) (.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (<= 2 ~E_M~0)) (.cse13 (= ~q_free~0 0)) (.cse20 (<= 2 |old(~t1_st~0)|)) (.cse14 (= ~m_i~0 1)) (.cse15 (= ~p_dw_st~0 0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~token~0 ~local~0)) (.cse18 (= ~M_E~0 2))) (or (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse19 .cse13 .cse20 .cse14 .cse15 .cse16 .cse17 .cse21) (and .cse5 .cse6 .cse8 .cse9 .cse22 .cse10 .cse12 .cse13 .cse23 .cse14 .cse15 .cse4 .cse16 .cse24 .cse17 .cse25 .cse21 .cse18) (and .cse5 .cse6 .cse8 (= ~E_1~0 ~M_E~0) .cse9 .cse22 .cse10 .cse12 .cse13 .cse23 .cse14 .cse15 .cse16 .cse24 .cse17 .cse25 .cse21 .cse18) (and .cse0 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse20 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse19 .cse13 .cse20 .cse14 .cse15 .cse16 .cse17 .cse21 .cse18))) (or .cse26 (not .cse22) (and .cse3 .cse1))))) Eliminated clause: (exists ((|old(~t1_st~0)| Int) (|old(~m_st~0)| Int)) (let ((.cse2 (= ~m_st~0 0)) (.cse26 (= |old(~m_st~0)| 0))) (let ((.cse4 (not .cse26)) (.cse0 (= ~t1_pc~0 1)) (.cse19 (= ~t1_pc~0 0)) (.cse3 (= ~t1_st~0 0)) (.cse1 (not .cse2))) (and (or (not .cse0) (and (= |old(~t1_st~0)| ~t1_st~0) .cse1)) (or (and .cse2 .cse3) .cse4) (let ((.cse21 (= |old(~t1_st~0)| 0)) (.cse22 (= ~m_pc~0 0)) (.cse23 (= ~E_M~0 2)) (.cse6 (<= 2 ~E_1~0)) (.cse25 (= (+ ~local~0 1) ~token~0)) (.cse5 (= ~p_dw_pc~0 0)) (.cse7 (= ~p_num_write~0 0)) (.cse8 (= ~c_num_read~0 0)) (.cse9 (= ~t1_i~0 1)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (<= 2 ~E_M~0)) (.cse20 (= ~T1_E~0 2)) (.cse12 (= ~q_free~0 0)) (.cse13 (<= 2 |old(~t1_st~0)|)) (.cse14 (= ~m_i~0 1)) (.cse15 (= ~p_dw_st~0 0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~token~0 ~local~0)) (.cse24 (= ~M_E~0 2))) (or (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse5 .cse7 .cse8 .cse19 .cse9 .cse10 .cse20 .cse12 .cse21 .cse14 .cse15 .cse16 .cse22 .cse17 .cse23 .cse18 (= ~E_1~0 2) .cse24) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse20 .cse12 .cse14 .cse15 .cse16 .cse17 .cse24) (and .cse5 .cse7 .cse8 .cse19 .cse9 .cse10 .cse20 .cse12 .cse21 .cse14 .cse15 .cse4 .cse16 .cse22 .cse17 .cse23 .cse18 .cse24) (and .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse24))) (or .cse26 (not .cse19) (and .cse3 .cse1)))))) [2024-11-18 16:16:47,503 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 16:16:47,736 WARN L156 FloydHoareUtils]: Requires clause for reset_delta_events2 contained old-variable. Original clause: (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (let ((.cse16 (= ~m_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse8 (<= 2 |old(~E_M~0)|)) (.cse10 (<= 2 |old(~E_1~0)|)) (.cse12 (not .cse16)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse4 (= ~t1_pc~0 0) .cse5 .cse6 .cse16 .cse7 (= |old(~T1_E~0)| |old(~M_E~0)|) (= ~t1_st~0 0) .cse9 .cse11 .cse13 (= ~m_pc~0 0) .cse14 (= |old(~E_M~0)| |old(~M_E~0)|) .cse15 (= |old(~E_1~0)| |old(~M_E~0)|) (= 2 |old(~M_E~0)|))))) (= ~E_1~0 |old(~E_1~0)|)) Eliminated clause: (let ((.cse15 (= ~m_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (<= 2 ~E_1~0)) (.cse4 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not .cse15)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (+ ~local~0 1) ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse4 .cse5 (= ~t1_pc~0 0) .cse6 .cse7 (= ~T1_E~0 2) .cse15 .cse9 (= ~t1_st~0 0) .cse10 .cse11 .cse13 (= ~m_pc~0 0) .cse14 (= ~E_M~0 2) .cse16 (= ~E_1~0 2) (= ~M_E~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16)))) [2024-11-18 16:16:47,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:16:47 BoogieIcfgContainer [2024-11-18 16:16:47,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 16:16:47,786 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 16:16:47,786 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 16:16:47,786 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 16:16:47,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:16:11" (3/4) ... [2024-11-18 16:16:47,791 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 16:16:47,795 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2024-11-18 16:16:47,795 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2024-11-18 16:16:47,795 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2024-11-18 16:16:47,795 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2024-11-18 16:16:47,795 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2024-11-18 16:16:47,796 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2024-11-18 16:16:47,796 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2024-11-18 16:16:47,796 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2024-11-18 16:16:47,796 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2024-11-18 16:16:47,812 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-18 16:16:47,814 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 16:16:47,815 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 16:16:47,815 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 16:16:47,992 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 16:16:47,992 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 16:16:47,992 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 16:16:47,993 INFO L158 Benchmark]: Toolchain (without parser) took 37902.66ms. Allocated memory was 163.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 96.3MB in the beginning and 1.1GB in the end (delta: -966.9MB). Peak memory consumption was 467.7MB. Max. memory is 16.1GB. [2024-11-18 16:16:47,993 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 163.6MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 16:16:47,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.87ms. Allocated memory is still 163.6MB. Free memory was 96.0MB in the beginning and 128.2MB in the end (delta: -32.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 16:16:47,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.11ms. Allocated memory is still 163.6MB. Free memory was 127.4MB in the beginning and 125.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 16:16:47,994 INFO L158 Benchmark]: Boogie Preprocessor took 73.02ms. Allocated memory is still 163.6MB. Free memory was 125.3MB in the beginning and 122.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 16:16:47,994 INFO L158 Benchmark]: RCFGBuilder took 734.56ms. Allocated memory is still 163.6MB. Free memory was 122.4MB in the beginning and 93.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-18 16:16:47,995 INFO L158 Benchmark]: TraceAbstraction took 36314.48ms. Allocated memory was 163.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 91.7MB in the beginning and 1.1GB in the end (delta: -986.1MB). Peak memory consumption was 928.2MB. Max. memory is 16.1GB. [2024-11-18 16:16:47,995 INFO L158 Benchmark]: Witness Printer took 206.38ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 16:16:47,996 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.23ms. Allocated memory is still 163.6MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.87ms. Allocated memory is still 163.6MB. Free memory was 96.0MB in the beginning and 128.2MB in the end (delta: -32.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.11ms. Allocated memory is still 163.6MB. Free memory was 127.4MB in the beginning and 125.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.02ms. Allocated memory is still 163.6MB. Free memory was 125.3MB in the beginning and 122.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 734.56ms. Allocated memory is still 163.6MB. Free memory was 122.4MB in the beginning and 93.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 36314.48ms. Allocated memory was 163.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 91.7MB in the beginning and 1.1GB in the end (delta: -986.1MB). Peak memory consumption was 928.2MB. Max. memory is 16.1GB. * Witness Printer took 206.38ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 390]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 27]: 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 10 procedures, 181 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 28, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6671 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6569 mSDsluCounter, 16164 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9772 mSDsCounter, 657 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3787 IncrementalHoareTripleChecker+Invalid, 4444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 657 mSolverCounterUnsat, 6392 mSDtfsCounter, 3787 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1271 GetRequests, 1133 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4021occurred in iteration=22, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 1243 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 3175 NumberOfCodeBlocks, 3175 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3274 ConstructedInterpolants, 0 QuantifiedInterpolants, 5405 SizeOfPredicates, 2 NumberOfNonLiveVariables, 3000 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 38 InterpolantComputations, 27 PerfectInterpolantSequences, 1201/1312 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 2 specifications checked. All of them hold - InvariantResult [Line: 425]: Location Invariant Derived location invariant: ((((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2)) || ((2 <= E_M) && ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (M_E == 2)) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))))) - InvariantResult [Line: 469]: Location Invariant Derived location invariant: ((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (((((t1_pc == 1) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || ((((t1_pc == 0) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)))) && (m_st != 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2)) || (((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (T1_E == 2)) && (q_free == 0)) && (((((t1_pc == 1) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || ((((t1_pc == 0) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)))) && (c_last_read == p_last_write)) && (M_E == 2))) || ((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (((((t1_pc == 1) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || ((((t1_pc == 0) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)))) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (T1_E == 2)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2)) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (M_E == 2))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 168]: Location Invariant Derived location invariant: ((((((((((((((t1_pc == 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2)) || (((((((((((((c_num_read == p_num_write) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || (((((((((((((c_num_read == p_num_write) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2)) || ((((((((((((c_dr_st == 2) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 125]: Location Invariant Derived location invariant: ((((((((((((((t1_pc == 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)) || (((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || (((((((((((c_dr_st == 2) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2)) || ((((((((((((c_dr_st == 2) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) - InvariantResult [Line: 798]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || (((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) - ProcedureContractResult [Line: 706]: Procedure Contract for immediate_notify Derived contract for procedure immediate_notify. Requires: (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2)) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (M_E == 2))) || (((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) && (m_st != 0)) Ensures: (((((((m_pc != 0) || (m_st != 0)) || (token != local)) && ((\old(t1_st) == t1_st) || (t1_st == 0))) && ((\old(t1_st) == t1_st) || (((long long) local + 1) != token))) && ((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (\old(m_st) != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (M_E == 2)) || ((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (\old(t1_st) == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (\old(m_st) != 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (T1_E == 2)) && (q_free == 0)) && (2 <= \old(t1_st))) && (m_i == 1)) && (p_dw_st == 0)) && (\old(m_st) != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2)))) && (((((((((((((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 84]: Procedure Contract for immediate_notify_threads Derived contract for procedure immediate_notify_threads. Requires: ((1 < p_dw_st) || (q_free != 1)) Ensures: (((((((((((((((((c_num_read == p_num_write) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (m_pc == 0)) && (2 <= \old(p_dw_st))) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2)) || ((((((((((((((p_dw_pc == 0) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (p_num_write == 1)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((t1_pc == 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (2 == \old(c_dr_st))) && (E_1 == 2)) && (M_E == 2))) && (((1 < p_dw_st) || (p_dw_st == 0)) || (q_free != 1))) && (((((((((((((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 625]: Procedure Contract for fire_delta_events2 Derived contract for procedure fire_delta_events2. Requires: ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || (((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) Ensures: ((((((((((2 <= E_1) && ((M_E == \old(M_E)) || (\old(M_E) == 0))) && (\old(E_M) <= E_M)) && (m_st != 0)) || (t1_pc != 1)) && ((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (2 == \old(E_1))) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 == \old(M_E))) && (\old(T1_E) == 2)) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= \old(E_M))) && (m_i == 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || (((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= \old(E_M))) && (m_i == 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)))) && ((t1_st != 0) || (M_E == 2))) && ((((E_M == \old(E_M)) || (\old(T1_E) != 2)) || (2 != \old(M_E))) || (token != local))) && ((((E_1 == \old(E_1)) && (((((\old(T1_E) == T1_E) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || ((((\old(T1_E) != 2) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)))) || (2 != \old(M_E))) || ((2 != \old(E_1)) && (((((\old(T1_E) == T1_E) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) || ((((\old(T1_E) != 2) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)))))) && (((((((((((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 681]: Procedure Contract for activate_threads2 Derived contract for procedure activate_threads2. Ensures: ((((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= \old(t1_st))) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) || ((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (\old(t1_st) == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (\old(m_st) != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (M_E == 2))) || ((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (\old(t1_st) == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (\old(m_st) != 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (2 <= \old(t1_st))) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (T1_E == 2)) && (q_free == 0)) && (2 <= \old(t1_st))) && (m_i == 1)) && (p_dw_st == 0)) && (\old(m_st) != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2))) && ((((\old(t1_st) < 2) || (E_M < 2)) || ((\old(t1_st) == t1_st) && (m_st != 0))) || (((long long) local + 1) != token))) && ((m_st == 0) || (\old(m_st) != 0))) && (((\old(m_st) == 0) || (t1_pc != 0)) || (m_st != 0))) && ((((t1_pc != 1) || ((\old(t1_st) == t1_st) && (m_st != 0))) || (E_1 < 2)) || (token != local))) && ((\old(t1_st) == t1_st) || (t1_st == 0))) && ((\old(t1_st) == t1_st) || (((long long) local + 1) != token))) && ((((t1_pc != 1) || (m_pc != 0)) || (m_st != 0)) || (token != local))) && (((((((((((((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 528]: Procedure Contract for update_channels2 Derived contract for procedure update_channels2. Requires: ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || (((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) Ensures: (((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || (((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) && (((((((((((((((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 228]: Procedure Contract for exists_runnable_thread1 Derived contract for procedure exists_runnable_thread1. Requires: (((((((((((((((((t1_pc == 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2)) || ((((((((((((c_dr_st == 2) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) Ensures: ((((((((((((((((((t1_pc == 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2)) || ((((((((((((c_dr_st == 2) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (2 <= p_dw_st)) && (M_E == 2))) || (((((((((((((c_num_read == p_num_write) && (c_dr_st == 2)) && (t1_pc == 0)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 1)) && (t1_st == 0)) && (p_dw_st == 0)) && (m_pc == 0)) && (E_M == 2)) && (E_1 == 2)) && (M_E == 2))) && (((((((((((((((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 23]: Procedure Contract for error1 Derived contract for procedure error1. Requires: 0 Ensures: (0 && (((((((((((((((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 554]: Procedure Contract for exists_runnable_thread2 Derived contract for procedure exists_runnable_thread2. Requires: ((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (T1_E == 2)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2)) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (M_E == 2))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) Ensures: (((((((((((((((((((((((((((t1_pc == 1) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (T1_E == 2)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (M_E == 2)) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || ((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) || ((((((((((((((((((p_dw_pc == 0) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (M_E == 2))) || (((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (M_E == 2))) || ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) && ((0 < \result) || (m_st != 0))) && ((0 < \result) || (t1_st != 0))) && (((((((((((((((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (M_E == \old(M_E))) && (T1_E == \old(T1_E))) && (E_M == \old(E_M))) && (E_1 == \old(E_1))) && (token == \old(token))) && (local == \old(local)))) - ProcedureContractResult [Line: 653]: Procedure Contract for reset_delta_events2 Derived contract for procedure reset_delta_events2. Requires: ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) || (((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (T1_E == 2)) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (E_M == 2)) && (token == local)) && (E_1 == 2)) && (M_E == 2))) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (2 <= E_1)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 <= E_M)) && (q_free == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local))) Ensures: ((((((((2 <= E_1) && (M_E == \old(M_E))) && (\old(E_M) <= E_M)) && (((\old(E_1) != \old(M_E)) && (((\old(E_M) != \old(M_E)) && ((\old(T1_E) != \old(M_E)) || ((\old(M_E) != 1) && (\old(T1_E) == T1_E)))) || (((\old(M_E) != 1) && (E_M == \old(E_M))) && ((\old(T1_E) == T1_E) || (\old(T1_E) != \old(M_E)))))) || (((((E_M == \old(E_M)) && ((\old(T1_E) == T1_E) || (\old(T1_E) != \old(M_E)))) || ((\old(E_M) != \old(M_E)) && ((\old(T1_E) == T1_E) || (\old(T1_E) != \old(M_E))))) && (\old(M_E) != 1)) && (E_1 == \old(E_1))))) || ((((2 <= E_1) && (\old(E_M) <= E_M)) && (\old(M_E) != 0)) && (M_E == 2))) && ((((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= \old(E_M))) && (m_i == 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) || ((((((((((((((((t1_pc == 1) && (2 <= t1_st)) && (p_dw_pc == 0)) && (p_num_write == 0)) && (c_num_read == 0)) && (t1_i == 1)) && (((long long) local + 1) == token)) && (p_last_write == q_buf_0)) && (q_free == 0)) && (2 <= \old(E_M))) && (m_i == 1)) && (2 <= \old(E_1))) && (p_dw_st == 0)) && (m_st != 0)) && (c_dr_pc == 0)) && (c_last_read == p_last_write))) || (((((((((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (2 == \old(E_1))) && (c_num_read == 0)) && (t1_pc == 0)) && (t1_i == 1)) && (p_last_write == q_buf_0)) && (2 == \old(E_M))) && (m_st == 0)) && (q_free == 0)) && (t1_st == 0)) && (m_i == 1)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (m_pc == 0)) && (c_last_read == p_last_write)) && (token == local)) && (2 == \old(M_E))) && (\old(T1_E) == 2)))) && (((((((T1_E == 2) || (\old(T1_E) != 2)) && (E_M == \old(E_M))) || (((T1_E == 2) || (\old(T1_E) != 2)) && (2 != \old(E_M)))) && (E_1 == \old(E_1))) || ((2 != \old(E_1)) && ((((T1_E == 2) || (\old(T1_E) != 2)) && (E_M == \old(E_M))) || (((T1_E == 2) || (\old(T1_E) != 2)) && (2 != \old(E_M)))))) || (2 != \old(M_E)))) && (((((((((((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_read_ev == \old(q_read_ev))) && (q_write_ev == \old(q_write_ev))) && (p_num_write == \old(p_num_write))) && (p_last_write == \old(p_last_write))) && (p_dw_st == \old(p_dw_st))) && (p_dw_pc == \old(p_dw_pc))) && (p_dw_i == \old(p_dw_i))) && (c_num_read == \old(c_num_read))) && (c_last_read == \old(c_last_read))) && (c_dr_st == \old(c_dr_st))) && (c_dr_pc == \old(c_dr_pc))) && (c_dr_i == \old(c_dr_i))) && (a_t == \old(a_t))) && (m_pc == \old(m_pc))) && (t1_pc == \old(t1_pc))) && (m_st == \old(m_st))) && (t1_st == \old(t1_st))) && (m_i == \old(m_i))) && (t1_i == \old(t1_i))) && (token == \old(token))) && (local == \old(local)))) RESULT: Ultimate proved your program to be correct! [2024-11-18 16:16:48,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE