./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_2.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/systemc/pc_sfifo_2.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 b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 14:33:40,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 14:33:40,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 14:33:40,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 14:33:40,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 14:33:40,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 14:33:40,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 14:33:40,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 14:33:40,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 14:33:40,417 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 14:33:40,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 14:33:40,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 14:33:40,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 14:33:40,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 14:33:40,419 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 14:33:40,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 14:33:40,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 14:33:40,420 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 14:33:40,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 14:33:40,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 14:33:40,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 14:33:40,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 14:33:40,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 14:33:40,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 14:33:40,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 14:33:40,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 14:33:40,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 14:33:40,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 14:33:40,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 14:33:40,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 14:33:40,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 14:33:40,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 14:33:40,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:33:40,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 14:33:40,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 14:33:40,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 14:33:40,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 14:33:40,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 14:33:40,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 14:33:40,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 14:33:40,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 14:33:40,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 14:33:40,429 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 -> b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f [2024-11-18 14:33:40,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 14:33:40,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 14:33:40,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 14:33:40,781 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 14:33:40,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 14:33:40,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2024-11-18 14:33:42,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 14:33:42,503 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 14:33:42,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2024-11-18 14:33:42,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8c0f23a3/13bd90f092fb4f85acfc6d356156d411/FLAG816edd255 [2024-11-18 14:33:42,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8c0f23a3/13bd90f092fb4f85acfc6d356156d411 [2024-11-18 14:33:42,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 14:33:42,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 14:33:42,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 14:33:42,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 14:33:42,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 14:33:42,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:33:42" (1/1) ... [2024-11-18 14:33:42,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b18268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:42, skipping insertion in model container [2024-11-18 14:33:42,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:33:42" (1/1) ... [2024-11-18 14:33:42,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 14:33:43,100 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/systemc/pc_sfifo_2.cil-1.c[643,656] [2024-11-18 14:33:43,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:33:43,165 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 14:33:43,174 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/systemc/pc_sfifo_2.cil-1.c[643,656] [2024-11-18 14:33:43,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:33:43,212 INFO L204 MainTranslator]: Completed translation [2024-11-18 14:33:43,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:43 WrapperNode [2024-11-18 14:33:43,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 14:33:43,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 14:33:43,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 14:33:43,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 14:33:43,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:43" (1/1) ... [2024-11-18 14:33:43,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:43" (1/1) ... [2024-11-18 14:33:43,250 INFO L138 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 189 [2024-11-18 14:33:43,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 14:33:43,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 14:33:43,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 14:33:43,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 14:33:43,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:43" (1/1) ... [2024-11-18 14:33:43,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:43" (1/1) ... [2024-11-18 14:33:43,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:43" (1/1) ... [2024-11-18 14:33:43,283 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 14:33:43,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:43" (1/1) ... [2024-11-18 14:33:43,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:43" (1/1) ... [2024-11-18 14:33:43,293 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:43" (1/1) ... [2024-11-18 14:33:43,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:43" (1/1) ... [2024-11-18 14:33:43,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:43" (1/1) ... [2024-11-18 14:33:43,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:43" (1/1) ... [2024-11-18 14:33:43,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 14:33:43,307 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 14:33:43,307 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 14:33:43,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 14:33:43,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:43" (1/1) ... [2024-11-18 14:33:43,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:33:43,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:43,349 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 14:33:43,352 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 14:33:43,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 14:33:43,402 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-18 14:33:43,402 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-18 14:33:43,402 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-18 14:33:43,402 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-18 14:33:43,402 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-18 14:33:43,402 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-18 14:33:43,402 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-18 14:33:43,404 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-18 14:33:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-18 14:33:43,405 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-18 14:33:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-18 14:33:43,405 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-18 14:33:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 14:33:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-18 14:33:43,405 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-18 14:33:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 14:33:43,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 14:33:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-18 14:33:43,405 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-18 14:33:43,493 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 14:33:43,495 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 14:33:43,861 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-18 14:33:43,861 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 14:33:43,881 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 14:33:43,883 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 14:33:43,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:33:43 BoogieIcfgContainer [2024-11-18 14:33:43,884 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 14:33:43,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 14:33:43,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 14:33:43,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 14:33:43,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:33:42" (1/3) ... [2024-11-18 14:33:43,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b76352f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:33:43, skipping insertion in model container [2024-11-18 14:33:43,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:43" (2/3) ... [2024-11-18 14:33:43,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b76352f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:33:43, skipping insertion in model container [2024-11-18 14:33:43,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:33:43" (3/3) ... [2024-11-18 14:33:43,894 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2024-11-18 14:33:43,912 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 14:33:43,912 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 14:33:43,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 14:33:43,992 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;@4188e8aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 14:33:43,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 14:33:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 79 states have (on average 1.518987341772152) internal successors, (120), 83 states have internal predecessors, (120), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-18 14:33:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 14:33:44,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:44,007 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:44,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:44,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:44,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1645662907, now seen corresponding path program 1 times [2024-11-18 14:33:44,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:44,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962659473] [2024-11-18 14:33:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:44,264 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 14:33:44,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:44,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962659473] [2024-11-18 14:33:44,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962659473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:44,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:44,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897237451] [2024-11-18 14:33:44,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:44,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:44,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:44,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:44,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:44,301 INFO L87 Difference]: Start difference. First operand has 103 states, 79 states have (on average 1.518987341772152) internal successors, (120), 83 states have internal predecessors, (120), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 14:33:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:44,348 INFO L93 Difference]: Finished difference Result 197 states and 285 transitions. [2024-11-18 14:33:44,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:44,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2024-11-18 14:33:44,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:44,359 INFO L225 Difference]: With dead ends: 197 [2024-11-18 14:33:44,359 INFO L226 Difference]: Without dead ends: 97 [2024-11-18 14:33:44,362 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 14:33:44,365 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 134 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 14:33:44,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 134 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-18 14:33:44,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-18 14:33:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.4) internal successors, (105), 77 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-18 14:33:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2024-11-18 14:33:44,420 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 64 [2024-11-18 14:33:44,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:44,422 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2024-11-18 14:33:44,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 14:33:44,423 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2024-11-18 14:33:44,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 14:33:44,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:44,427 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:44,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 14:33:44,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:44,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:44,430 INFO L85 PathProgramCache]: Analyzing trace with hash 258877497, now seen corresponding path program 1 times [2024-11-18 14:33:44,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:44,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818095946] [2024-11-18 14:33:44,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:44,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:44,726 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 14:33:44,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:44,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818095946] [2024-11-18 14:33:44,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818095946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:44,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:44,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:33:44,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579192375] [2024-11-18 14:33:44,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:44,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:33:44,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:44,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:33:44,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:33:44,734 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 14:33:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:45,156 INFO L93 Difference]: Finished difference Result 288 states and 399 transitions. [2024-11-18 14:33:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:33:45,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2024-11-18 14:33:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:45,161 INFO L225 Difference]: With dead ends: 288 [2024-11-18 14:33:45,161 INFO L226 Difference]: Without dead ends: 200 [2024-11-18 14:33:45,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 14:33:45,164 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 205 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:45,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 325 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 14:33:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-18 14:33:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 193. [2024-11-18 14:33:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 155 states have internal predecessors, (209), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2024-11-18 14:33:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 262 transitions. [2024-11-18 14:33:45,205 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 262 transitions. Word has length 64 [2024-11-18 14:33:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:45,205 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 262 transitions. [2024-11-18 14:33:45,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 14:33:45,206 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 262 transitions. [2024-11-18 14:33:45,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 14:33:45,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:45,213 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:45,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 14:33:45,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:45,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:45,215 INFO L85 PathProgramCache]: Analyzing trace with hash 662663448, now seen corresponding path program 1 times [2024-11-18 14:33:45,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:45,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990570083] [2024-11-18 14:33:45,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:45,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:45,392 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 14:33:45,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:45,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990570083] [2024-11-18 14:33:45,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990570083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:45,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:45,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:33:45,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137431097] [2024-11-18 14:33:45,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:45,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:33:45,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:45,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:33:45,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:45,398 INFO L87 Difference]: Start difference. First operand 193 states and 262 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 14:33:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:45,841 INFO L93 Difference]: Finished difference Result 510 states and 692 transitions. [2024-11-18 14:33:45,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 14:33:45,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2024-11-18 14:33:45,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:45,850 INFO L225 Difference]: With dead ends: 510 [2024-11-18 14:33:45,850 INFO L226 Difference]: Without dead ends: 333 [2024-11-18 14:33:45,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 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 14:33:45,855 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 240 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:45,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 598 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 14:33:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-18 14:33:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 289. [2024-11-18 14:33:45,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 233 states have internal predecessors, (312), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2024-11-18 14:33:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 395 transitions. [2024-11-18 14:33:45,925 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 395 transitions. Word has length 64 [2024-11-18 14:33:45,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:45,925 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 395 transitions. [2024-11-18 14:33:45,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 14:33:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 395 transitions. [2024-11-18 14:33:45,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 14:33:45,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:45,928 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:45,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 14:33:45,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:45,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:45,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1365922662, now seen corresponding path program 1 times [2024-11-18 14:33:45,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:45,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298591324] [2024-11-18 14:33:45,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:45,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:46,037 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 14:33:46,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:46,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298591324] [2024-11-18 14:33:46,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298591324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:46,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:46,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:33:46,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999769914] [2024-11-18 14:33:46,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:46,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:33:46,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:46,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:33:46,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:46,039 INFO L87 Difference]: Start difference. First operand 289 states and 395 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 14:33:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:46,106 INFO L93 Difference]: Finished difference Result 561 states and 768 transitions. [2024-11-18 14:33:46,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:33:46,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2024-11-18 14:33:46,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:46,111 INFO L225 Difference]: With dead ends: 561 [2024-11-18 14:33:46,111 INFO L226 Difference]: Without dead ends: 294 [2024-11-18 14:33:46,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 14:33:46,117 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:46,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:46,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-18 14:33:46,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-18 14:33:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 237 states have internal predecessors, (314), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2024-11-18 14:33:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 398 transitions. [2024-11-18 14:33:46,157 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 398 transitions. Word has length 64 [2024-11-18 14:33:46,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:46,157 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 398 transitions. [2024-11-18 14:33:46,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 14:33:46,158 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 398 transitions. [2024-11-18 14:33:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 14:33:46,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:46,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, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:46,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 14:33:46,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:46,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:46,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1899685336, now seen corresponding path program 1 times [2024-11-18 14:33:46,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:46,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058210512] [2024-11-18 14:33:46,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:46,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:46,248 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 14:33:46,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:46,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058210512] [2024-11-18 14:33:46,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058210512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:46,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:46,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:33:46,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499448053] [2024-11-18 14:33:46,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:46,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:33:46,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:46,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:33:46,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:46,250 INFO L87 Difference]: Start difference. First operand 294 states and 398 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-18 14:33:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:46,856 INFO L93 Difference]: Finished difference Result 2313 states and 3175 transitions. [2024-11-18 14:33:46,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 14:33:46,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2024-11-18 14:33:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:46,872 INFO L225 Difference]: With dead ends: 2313 [2024-11-18 14:33:46,872 INFO L226 Difference]: Without dead ends: 2041 [2024-11-18 14:33:46,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-18 14:33:46,875 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 905 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:46,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1073 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 14:33:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2024-11-18 14:33:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 1884. [2024-11-18 14:33:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1482 states have (on average 1.3218623481781377) internal successors, (1959), 1516 states have internal predecessors, (1959), 201 states have call successors, (201), 166 states have call predecessors, (201), 200 states have return successors, (317), 204 states have call predecessors, (317), 199 states have call successors, (317) [2024-11-18 14:33:47,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2477 transitions. [2024-11-18 14:33:47,048 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2477 transitions. Word has length 64 [2024-11-18 14:33:47,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:47,048 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 2477 transitions. [2024-11-18 14:33:47,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-18 14:33:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2477 transitions. [2024-11-18 14:33:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 14:33:47,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:47,050 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:47,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 14:33:47,052 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:47,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:47,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1343832871, now seen corresponding path program 1 times [2024-11-18 14:33:47,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:47,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277163887] [2024-11-18 14:33:47,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:47,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:47,164 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 14:33:47,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:47,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277163887] [2024-11-18 14:33:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277163887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:47,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:47,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:33:47,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160142779] [2024-11-18 14:33:47,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:47,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:33:47,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:47,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:33:47,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:47,167 INFO L87 Difference]: Start difference. First operand 1884 states and 2477 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 14:33:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:47,305 INFO L93 Difference]: Finished difference Result 3791 states and 5034 transitions. [2024-11-18 14:33:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:33:47,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2024-11-18 14:33:47,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:47,318 INFO L225 Difference]: With dead ends: 3791 [2024-11-18 14:33:47,318 INFO L226 Difference]: Without dead ends: 1929 [2024-11-18 14:33:47,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 14:33:47,326 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:47,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2024-11-18 14:33:47,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929. [2024-11-18 14:33:47,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1518 states have (on average 1.3043478260869565) internal successors, (1980), 1552 states have internal predecessors, (1980), 201 states have call successors, (201), 166 states have call predecessors, (201), 209 states have return successors, (335), 213 states have call predecessors, (335), 199 states have call successors, (335) [2024-11-18 14:33:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2516 transitions. [2024-11-18 14:33:47,526 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2516 transitions. Word has length 64 [2024-11-18 14:33:47,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:47,527 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 2516 transitions. [2024-11-18 14:33:47,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 14:33:47,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2516 transitions. [2024-11-18 14:33:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 14:33:47,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:47,529 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:47,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 14:33:47,529 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:47,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:47,530 INFO L85 PathProgramCache]: Analyzing trace with hash 42370523, now seen corresponding path program 1 times [2024-11-18 14:33:47,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:47,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985690711] [2024-11-18 14:33:47,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:47,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:47,669 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 14:33:47,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:47,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985690711] [2024-11-18 14:33:47,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985690711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:47,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:47,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:33:47,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965636820] [2024-11-18 14:33:47,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:47,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:33:47,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:47,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:33:47,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:47,672 INFO L87 Difference]: Start difference. First operand 1929 states and 2516 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 14:33:48,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:48,140 INFO L93 Difference]: Finished difference Result 3679 states and 4759 transitions. [2024-11-18 14:33:48,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 14:33:48,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2024-11-18 14:33:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:48,154 INFO L225 Difference]: With dead ends: 3679 [2024-11-18 14:33:48,155 INFO L226 Difference]: Without dead ends: 2131 [2024-11-18 14:33:48,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-18 14:33:48,162 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 230 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:48,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 389 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 14:33:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2024-11-18 14:33:48,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 1939. [2024-11-18 14:33:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1530 states have (on average 1.2973856209150327) internal successors, (1985), 1559 states have internal predecessors, (1985), 202 states have call successors, (202), 167 states have call predecessors, (202), 206 states have return successors, (319), 215 states have call predecessors, (319), 200 states have call successors, (319) [2024-11-18 14:33:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2506 transitions. [2024-11-18 14:33:48,305 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2506 transitions. Word has length 64 [2024-11-18 14:33:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:48,305 INFO L471 AbstractCegarLoop]: Abstraction has 1939 states and 2506 transitions. [2024-11-18 14:33:48,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 14:33:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2506 transitions. [2024-11-18 14:33:48,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 14:33:48,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:48,307 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:48,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 14:33:48,308 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:48,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:48,309 INFO L85 PathProgramCache]: Analyzing trace with hash -91642983, now seen corresponding path program 1 times [2024-11-18 14:33:48,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:48,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972668694] [2024-11-18 14:33:48,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:48,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:48,374 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 14:33:48,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:48,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972668694] [2024-11-18 14:33:48,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972668694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:48,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:48,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 14:33:48,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563299137] [2024-11-18 14:33:48,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:48,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 14:33:48,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:48,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 14:33:48,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 14:33:48,377 INFO L87 Difference]: Start difference. First operand 1939 states and 2506 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 14:33:48,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:48,748 INFO L93 Difference]: Finished difference Result 5691 states and 7400 transitions. [2024-11-18 14:33:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:33:48,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2024-11-18 14:33:48,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:48,769 INFO L225 Difference]: With dead ends: 5691 [2024-11-18 14:33:48,770 INFO L226 Difference]: Without dead ends: 3777 [2024-11-18 14:33:48,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 14:33:48,777 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 183 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:48,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 195 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 14:33:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2024-11-18 14:33:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3773. [2024-11-18 14:33:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3773 states, 2951 states have (on average 1.2656726533378515) internal successors, (3735), 3010 states have internal predecessors, (3735), 404 states have call successors, (404), 333 states have call predecessors, (404), 417 states have return successors, (697), 435 states have call predecessors, (697), 402 states have call successors, (697) [2024-11-18 14:33:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3773 states to 3773 states and 4836 transitions. [2024-11-18 14:33:49,079 INFO L78 Accepts]: Start accepts. Automaton has 3773 states and 4836 transitions. Word has length 64 [2024-11-18 14:33:49,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:49,080 INFO L471 AbstractCegarLoop]: Abstraction has 3773 states and 4836 transitions. [2024-11-18 14:33:49,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-18 14:33:49,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3773 states and 4836 transitions. [2024-11-18 14:33:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-18 14:33:49,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:49,083 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:49,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 14:33:49,084 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:49,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2137648849, now seen corresponding path program 1 times [2024-11-18 14:33:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:49,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160787860] [2024-11-18 14:33:49,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:49,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:49,119 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 14:33:49,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:49,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160787860] [2024-11-18 14:33:49,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160787860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:49,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:49,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:49,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47840755] [2024-11-18 14:33:49,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:49,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:49,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:49,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:49,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:49,122 INFO L87 Difference]: Start difference. First operand 3773 states and 4836 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 14:33:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:49,475 INFO L93 Difference]: Finished difference Result 9959 states and 12907 transitions. [2024-11-18 14:33:49,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:49,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-18 14:33:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:49,506 INFO L225 Difference]: With dead ends: 9959 [2024-11-18 14:33:49,507 INFO L226 Difference]: Without dead ends: 6190 [2024-11-18 14:33:49,516 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 14:33:49,517 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 102 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:49,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 237 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6190 states. [2024-11-18 14:33:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6190 to 6056. [2024-11-18 14:33:49,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6056 states, 4696 states have (on average 1.2595826235093697) internal successors, (5915), 4772 states have internal predecessors, (5915), 665 states have call successors, (665), 565 states have call predecessors, (665), 694 states have return successors, (1151), 724 states have call predecessors, (1151), 663 states have call successors, (1151) [2024-11-18 14:33:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 7731 transitions. [2024-11-18 14:33:49,941 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 7731 transitions. Word has length 65 [2024-11-18 14:33:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:49,942 INFO L471 AbstractCegarLoop]: Abstraction has 6056 states and 7731 transitions. [2024-11-18 14:33:49,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 14:33:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 7731 transitions. [2024-11-18 14:33:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-18 14:33:49,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:49,945 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:49,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 14:33:49,945 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:49,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:49,946 INFO L85 PathProgramCache]: Analyzing trace with hash -78334537, now seen corresponding path program 1 times [2024-11-18 14:33:49,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:49,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490844058] [2024-11-18 14:33:49,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:49,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:50,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:50,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490844058] [2024-11-18 14:33:50,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490844058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:50,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:50,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 14:33:50,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795808225] [2024-11-18 14:33:50,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:50,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 14:33:50,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:50,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 14:33:50,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 14:33:50,015 INFO L87 Difference]: Start difference. First operand 6056 states and 7731 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-18 14:33:50,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:50,601 INFO L93 Difference]: Finished difference Result 7215 states and 9151 transitions. [2024-11-18 14:33:50,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 14:33:50,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 72 [2024-11-18 14:33:50,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:50,640 INFO L225 Difference]: With dead ends: 7215 [2024-11-18 14:33:50,640 INFO L226 Difference]: Without dead ends: 7212 [2024-11-18 14:33:50,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 14:33:50,645 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 273 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:50,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 231 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:33:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7212 states. [2024-11-18 14:33:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7212 to 7110. [2024-11-18 14:33:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7110 states, 5499 states have (on average 1.2520458265139116) internal successors, (6885), 5584 states have internal predecessors, (6885), 791 states have call successors, (791), 679 states have call predecessors, (791), 819 states have return successors, (1344), 852 states have call predecessors, (1344), 790 states have call successors, (1344) [2024-11-18 14:33:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7110 states to 7110 states and 9020 transitions. [2024-11-18 14:33:51,210 INFO L78 Accepts]: Start accepts. Automaton has 7110 states and 9020 transitions. Word has length 72 [2024-11-18 14:33:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:51,210 INFO L471 AbstractCegarLoop]: Abstraction has 7110 states and 9020 transitions. [2024-11-18 14:33:51,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-18 14:33:51,211 INFO L276 IsEmpty]: Start isEmpty. Operand 7110 states and 9020 transitions. [2024-11-18 14:33:51,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-18 14:33:51,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:51,214 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:51,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 14:33:51,215 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:51,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1866244794, now seen corresponding path program 1 times [2024-11-18 14:33:51,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:51,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230369828] [2024-11-18 14:33:51,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:51,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:51,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:51,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230369828] [2024-11-18 14:33:51,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230369828] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:51,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960731347] [2024-11-18 14:33:51,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:51,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:51,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:51,343 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 14:33:51,345 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 14:33:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:51,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-18 14:33:51,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:33:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:51,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:33:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:51,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960731347] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:33:51,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:33:51,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2024-11-18 14:33:51,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296370886] [2024-11-18 14:33:51,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:33:51,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 14:33:51,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:51,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 14:33:51,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:33:51,979 INFO L87 Difference]: Start difference. First operand 7110 states and 9020 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-18 14:33:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:53,574 INFO L93 Difference]: Finished difference Result 15268 states and 19275 transitions. [2024-11-18 14:33:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 14:33:53,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 73 [2024-11-18 14:33:53,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:53,660 INFO L225 Difference]: With dead ends: 15268 [2024-11-18 14:33:53,660 INFO L226 Difference]: Without dead ends: 15265 [2024-11-18 14:33:53,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:33:53,668 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 544 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:53,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1048 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 14:33:53,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15265 states. [2024-11-18 14:33:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15265 to 13899. [2024-11-18 14:33:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13899 states, 10764 states have (on average 1.2515793385358602) internal successors, (13472), 10929 states have internal predecessors, (13472), 1523 states have call successors, (1523), 1313 states have call predecessors, (1523), 1611 states have return successors, (2611), 1662 states have call predecessors, (2611), 1522 states have call successors, (2611) [2024-11-18 14:33:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13899 states to 13899 states and 17606 transitions. [2024-11-18 14:33:54,735 INFO L78 Accepts]: Start accepts. Automaton has 13899 states and 17606 transitions. Word has length 73 [2024-11-18 14:33:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:54,736 INFO L471 AbstractCegarLoop]: Abstraction has 13899 states and 17606 transitions. [2024-11-18 14:33:54,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-18 14:33:54,737 INFO L276 IsEmpty]: Start isEmpty. Operand 13899 states and 17606 transitions. [2024-11-18 14:33:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-18 14:33:54,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:54,740 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:54,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 14:33:54,940 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,SelfDestructingSolverStorable10 [2024-11-18 14:33:54,941 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:54,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:54,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1600677641, now seen corresponding path program 2 times [2024-11-18 14:33:54,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:54,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822796934] [2024-11-18 14:33:54,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 14:33:54,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:54,956 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 14:33:54,956 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 14:33:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:54,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:54,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822796934] [2024-11-18 14:33:54,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822796934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:54,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:54,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781521296] [2024-11-18 14:33:54,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:54,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:54,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:54,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:54,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:54,979 INFO L87 Difference]: Start difference. First operand 13899 states and 17606 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-18 14:33:55,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:55,523 INFO L93 Difference]: Finished difference Result 20871 states and 26541 transitions. [2024-11-18 14:33:55,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:55,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 76 [2024-11-18 14:33:55,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:55,575 INFO L225 Difference]: With dead ends: 20871 [2024-11-18 14:33:55,575 INFO L226 Difference]: Without dead ends: 7861 [2024-11-18 14:33:55,611 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 14:33:55,612 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 100 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:55,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 324 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:55,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7861 states. [2024-11-18 14:33:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7861 to 7763. [2024-11-18 14:33:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7763 states, 6029 states have (on average 1.222922541051584) internal successors, (7373), 6108 states have internal predecessors, (7373), 857 states have call successors, (857), 735 states have call predecessors, (857), 876 states have return successors, (1357), 925 states have call predecessors, (1357), 856 states have call successors, (1357) [2024-11-18 14:33:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7763 states to 7763 states and 9587 transitions. [2024-11-18 14:33:56,370 INFO L78 Accepts]: Start accepts. Automaton has 7763 states and 9587 transitions. Word has length 76 [2024-11-18 14:33:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:56,370 INFO L471 AbstractCegarLoop]: Abstraction has 7763 states and 9587 transitions. [2024-11-18 14:33:56,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-18 14:33:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand 7763 states and 9587 transitions. [2024-11-18 14:33:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-18 14:33:56,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:56,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:56,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 14:33:56,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:56,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:56,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1691663828, now seen corresponding path program 1 times [2024-11-18 14:33:56,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:56,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601648509] [2024-11-18 14:33:56,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:56,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:56,493 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 14:33:56,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:56,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601648509] [2024-11-18 14:33:56,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601648509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:56,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:56,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:33:56,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125774386] [2024-11-18 14:33:56,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:56,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:33:56,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:56,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:33:56,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:56,496 INFO L87 Difference]: Start difference. First operand 7763 states and 9587 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-18 14:33:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:58,145 INFO L93 Difference]: Finished difference Result 23261 states and 28870 transitions. [2024-11-18 14:33:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 14:33:58,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2024-11-18 14:33:58,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:58,223 INFO L225 Difference]: With dead ends: 23261 [2024-11-18 14:33:58,224 INFO L226 Difference]: Without dead ends: 15526 [2024-11-18 14:33:58,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-18 14:33:58,255 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 492 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:58,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 528 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 14:33:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15526 states. [2024-11-18 14:33:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15526 to 14883. [2024-11-18 14:33:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14883 states, 11470 states have (on average 1.1987794245858763) internal successors, (13750), 11653 states have internal predecessors, (13750), 1664 states have call successors, (1664), 1435 states have call predecessors, (1664), 1748 states have return successors, (2856), 1800 states have call predecessors, (2856), 1663 states have call successors, (2856) [2024-11-18 14:33:59,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14883 states to 14883 states and 18270 transitions. [2024-11-18 14:33:59,482 INFO L78 Accepts]: Start accepts. Automaton has 14883 states and 18270 transitions. Word has length 83 [2024-11-18 14:33:59,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:59,482 INFO L471 AbstractCegarLoop]: Abstraction has 14883 states and 18270 transitions. [2024-11-18 14:33:59,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-18 14:33:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 14883 states and 18270 transitions. [2024-11-18 14:33:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-18 14:33:59,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:59,489 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-18 14:33:59,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 14:33:59,490 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:59,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:59,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1092647019, now seen corresponding path program 1 times [2024-11-18 14:33:59,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:59,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374170336] [2024-11-18 14:33:59,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 14:33:59,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:59,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374170336] [2024-11-18 14:33:59,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374170336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:59,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:59,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 14:33:59,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324322844] [2024-11-18 14:33:59,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:59,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 14:33:59,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:59,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 14:33:59,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:33:59,612 INFO L87 Difference]: Start difference. First operand 14883 states and 18270 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-18 14:34:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:34:01,079 INFO L93 Difference]: Finished difference Result 26841 states and 32979 transitions. [2024-11-18 14:34:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-18 14:34:01,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2024-11-18 14:34:01,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:34:01,145 INFO L225 Difference]: With dead ends: 26841 [2024-11-18 14:34:01,146 INFO L226 Difference]: Without dead ends: 12608 [2024-11-18 14:34:01,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-18 14:34:01,186 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 828 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 14:34:01,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 637 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 14:34:01,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12608 states. [2024-11-18 14:34:01,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12608 to 11880. [2024-11-18 14:34:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11880 states, 9199 states have (on average 1.1895858245461464) internal successors, (10943), 9338 states have internal predecessors, (10943), 1299 states have call successors, (1299), 1116 states have call predecessors, (1299), 1381 states have return successors, (2055), 1431 states have call predecessors, (2055), 1298 states have call successors, (2055) [2024-11-18 14:34:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11880 states to 11880 states and 14297 transitions. [2024-11-18 14:34:01,956 INFO L78 Accepts]: Start accepts. Automaton has 11880 states and 14297 transitions. Word has length 92 [2024-11-18 14:34:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:34:01,957 INFO L471 AbstractCegarLoop]: Abstraction has 11880 states and 14297 transitions. [2024-11-18 14:34:01,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-18 14:34:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 11880 states and 14297 transitions. [2024-11-18 14:34:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-18 14:34:01,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:34:01,969 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:34:01,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 14:34:01,969 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:34:01,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:34:01,969 INFO L85 PathProgramCache]: Analyzing trace with hash 578230399, now seen corresponding path program 1 times [2024-11-18 14:34:01,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:34:01,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525036445] [2024-11-18 14:34:01,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:34:01,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:34:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:34:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-18 14:34:02,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:34:02,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525036445] [2024-11-18 14:34:02,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525036445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:34:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819686341] [2024-11-18 14:34:02,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:34:02,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:34:02,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:34:02,092 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 14:34:02,099 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 14:34:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:34:02,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 14:34:02,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:34:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 14:34:02,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 14:34:02,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819686341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:34:02,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 14:34:02,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-18 14:34:02,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032421484] [2024-11-18 14:34:02,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:34:02,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:34:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:34:02,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:34:02,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-18 14:34:02,254 INFO L87 Difference]: Start difference. First operand 11880 states and 14297 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 14:34:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:34:02,865 INFO L93 Difference]: Finished difference Result 17172 states and 20642 transitions. [2024-11-18 14:34:02,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:34:02,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2024-11-18 14:34:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:34:02,901 INFO L225 Difference]: With dead ends: 17172 [2024-11-18 14:34:02,901 INFO L226 Difference]: Without dead ends: 5320 [2024-11-18 14:34:02,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-18 14:34:02,929 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 621 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 14:34:02,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 621 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:34:02,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2024-11-18 14:34:03,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 5116. [2024-11-18 14:34:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5116 states, 4062 states have (on average 1.173313638601674) internal successors, (4766), 4104 states have internal predecessors, (4766), 505 states have call successors, (505), 417 states have call predecessors, (505), 548 states have return successors, (800), 594 states have call predecessors, (800), 504 states have call successors, (800) [2024-11-18 14:34:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5116 states to 5116 states and 6071 transitions. [2024-11-18 14:34:03,520 INFO L78 Accepts]: Start accepts. Automaton has 5116 states and 6071 transitions. Word has length 144 [2024-11-18 14:34:03,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:34:03,520 INFO L471 AbstractCegarLoop]: Abstraction has 5116 states and 6071 transitions. [2024-11-18 14:34:03,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 14:34:03,521 INFO L276 IsEmpty]: Start isEmpty. Operand 5116 states and 6071 transitions. [2024-11-18 14:34:03,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-18 14:34:03,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:34:03,531 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:34:03,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 14:34:03,731 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,SelfDestructingSolverStorable14 [2024-11-18 14:34:03,733 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:34:03,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:34:03,734 INFO L85 PathProgramCache]: Analyzing trace with hash -371595989, now seen corresponding path program 1 times [2024-11-18 14:34:03,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:34:03,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800788177] [2024-11-18 14:34:03,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:34:03,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:34:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:34:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-18 14:34:03,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:34:03,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800788177] [2024-11-18 14:34:03,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800788177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:34:03,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:34:03,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:34:03,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307616163] [2024-11-18 14:34:03,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:34:03,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:34:03,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:34:03,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:34:03,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:34:03,781 INFO L87 Difference]: Start difference. First operand 5116 states and 6071 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-18 14:34:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:34:04,232 INFO L93 Difference]: Finished difference Result 5444 states and 6452 transitions. [2024-11-18 14:34:04,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:34:04,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 146 [2024-11-18 14:34:04,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:34:04,264 INFO L225 Difference]: With dead ends: 5444 [2024-11-18 14:34:04,265 INFO L226 Difference]: Without dead ends: 4687 [2024-11-18 14:34:04,269 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 14:34:04,270 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 127 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 14:34:04,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 127 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:34:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2024-11-18 14:34:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4687. [2024-11-18 14:34:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4687 states, 3729 states have (on average 1.1751139715741485) internal successors, (4382), 3768 states have internal predecessors, (4382), 459 states have call successors, (459), 377 states have call predecessors, (459), 498 states have return successors, (737), 541 states have call predecessors, (737), 458 states have call successors, (737) [2024-11-18 14:34:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 5578 transitions. [2024-11-18 14:34:04,800 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 5578 transitions. Word has length 146 [2024-11-18 14:34:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:34:04,801 INFO L471 AbstractCegarLoop]: Abstraction has 4687 states and 5578 transitions. [2024-11-18 14:34:04,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-18 14:34:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 5578 transitions. [2024-11-18 14:34:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-18 14:34:04,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:34:04,811 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:34:04,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-18 14:34:04,812 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:34:04,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:34:04,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1916584467, now seen corresponding path program 1 times [2024-11-18 14:34:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:34:04,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964019431] [2024-11-18 14:34:04,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:34:04,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:34:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:34:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-18 14:34:04,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:34:04,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964019431] [2024-11-18 14:34:04,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964019431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:34:04,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:34:04,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:34:04,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031361821] [2024-11-18 14:34:04,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:34:04,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:34:04,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:34:04,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:34:04,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:34:04,874 INFO L87 Difference]: Start difference. First operand 4687 states and 5578 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-18 14:34:05,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:34:05,323 INFO L93 Difference]: Finished difference Result 6604 states and 7822 transitions. [2024-11-18 14:34:05,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:34:05,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 158 [2024-11-18 14:34:05,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:34:05,338 INFO L225 Difference]: With dead ends: 6604 [2024-11-18 14:34:05,338 INFO L226 Difference]: Without dead ends: 2119 [2024-11-18 14:34:05,343 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 14:34:05,344 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 88 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 230 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 14:34:05,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 230 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:34:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2024-11-18 14:34:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2119. [2024-11-18 14:34:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 1696 states have (on average 1.1568396226415094) internal successors, (1962), 1713 states have internal predecessors, (1962), 202 states have call successors, (202), 168 states have call predecessors, (202), 220 states have return successors, (300), 237 states have call predecessors, (300), 201 states have call successors, (300) [2024-11-18 14:34:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 2464 transitions. [2024-11-18 14:34:05,509 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 2464 transitions. Word has length 158 [2024-11-18 14:34:05,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:34:05,510 INFO L471 AbstractCegarLoop]: Abstraction has 2119 states and 2464 transitions. [2024-11-18 14:34:05,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-18 14:34:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 2464 transitions. [2024-11-18 14:34:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-18 14:34:05,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:34:05,516 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:34:05,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-18 14:34:05,516 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:34:05,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:34:05,517 INFO L85 PathProgramCache]: Analyzing trace with hash 702759848, now seen corresponding path program 1 times [2024-11-18 14:34:05,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:34:05,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648426001] [2024-11-18 14:34:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:34:05,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:34:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:34:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-18 14:34:05,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:34:05,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648426001] [2024-11-18 14:34:05,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648426001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:34:05,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:34:05,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:34:05,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880201601] [2024-11-18 14:34:05,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:34:05,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:34:05,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:34:05,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:34:05,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:34:05,606 INFO L87 Difference]: Start difference. First operand 2119 states and 2464 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-18 14:34:05,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:34:05,916 INFO L93 Difference]: Finished difference Result 3914 states and 4596 transitions. [2024-11-18 14:34:05,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:34:05,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 158 [2024-11-18 14:34:05,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:34:05,936 INFO L225 Difference]: With dead ends: 3914 [2024-11-18 14:34:05,937 INFO L226 Difference]: Without dead ends: 2145 [2024-11-18 14:34:05,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:34:05,941 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 89 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 14:34:05,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 310 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 14:34:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2024-11-18 14:34:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 1735. [2024-11-18 14:34:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1396 states have (on average 1.1611747851002865) internal successors, (1621), 1414 states have internal predecessors, (1621), 162 states have call successors, (162), 136 states have call predecessors, (162), 176 states have return successors, (239), 184 states have call predecessors, (239), 161 states have call successors, (239) [2024-11-18 14:34:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2022 transitions. [2024-11-18 14:34:06,088 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2022 transitions. Word has length 158 [2024-11-18 14:34:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:34:06,089 INFO L471 AbstractCegarLoop]: Abstraction has 1735 states and 2022 transitions. [2024-11-18 14:34:06,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-18 14:34:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2022 transitions. [2024-11-18 14:34:06,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-18 14:34:06,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:34:06,093 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:34:06,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-18 14:34:06,094 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:34:06,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:34:06,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1973905068, now seen corresponding path program 1 times [2024-11-18 14:34:06,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:34:06,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473443928] [2024-11-18 14:34:06,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:34:06,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:34:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:34:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-18 14:34:06,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:34:06,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473443928] [2024-11-18 14:34:06,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473443928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:34:06,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268561793] [2024-11-18 14:34:06,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:34:06,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:34:06,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:34:06,316 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 14:34:06,317 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 14:34:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:34:06,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-18 14:34:06,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:34:06,600 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-18 14:34:06,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:34:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-18 14:34:06,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268561793] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:34:06,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:34:06,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2024-11-18 14:34:06,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427795492] [2024-11-18 14:34:06,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:34:06,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 14:34:06,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:34:06,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 14:34:06,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-18 14:34:06,867 INFO L87 Difference]: Start difference. First operand 1735 states and 2022 transitions. Second operand has 13 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-11-18 14:34:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:34:07,755 INFO L93 Difference]: Finished difference Result 3897 states and 4645 transitions. [2024-11-18 14:34:07,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-18 14:34:07,756 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 161 [2024-11-18 14:34:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:34:07,772 INFO L225 Difference]: With dead ends: 3897 [2024-11-18 14:34:07,772 INFO L226 Difference]: Without dead ends: 2080 [2024-11-18 14:34:07,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 330 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2024-11-18 14:34:07,776 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 460 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 14:34:07,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 568 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 14:34:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2024-11-18 14:34:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1792. [2024-11-18 14:34:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1415 states have (on average 1.1356890459363957) internal successors, (1607), 1437 states have internal predecessors, (1607), 182 states have call successors, (182), 158 states have call predecessors, (182), 194 states have return successors, (288), 196 states have call predecessors, (288), 181 states have call successors, (288) [2024-11-18 14:34:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2077 transitions. [2024-11-18 14:34:07,956 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2077 transitions. Word has length 161 [2024-11-18 14:34:07,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:34:07,957 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2077 transitions. [2024-11-18 14:34:07,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.692307692307693) internal successors, (243), 13 states have internal predecessors, (243), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-11-18 14:34:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2077 transitions. [2024-11-18 14:34:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-18 14:34:07,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:34:07,961 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:34:07,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 14:34:08,165 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 14:34:08,166 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:34:08,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:34:08,167 INFO L85 PathProgramCache]: Analyzing trace with hash 11419214, now seen corresponding path program 1 times [2024-11-18 14:34:08,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:34:08,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493447670] [2024-11-18 14:34:08,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:34:08,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:34:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:34:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-18 14:34:08,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:34:08,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493447670] [2024-11-18 14:34:08,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493447670] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:34:08,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904866905] [2024-11-18 14:34:08,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:34:08,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:34:08,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:34:08,272 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 14:34:08,274 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 14:34:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:34:08,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 14:34:08,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:34:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-18 14:34:08,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 14:34:08,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904866905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:34:08,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 14:34:08,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-18 14:34:08,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327792607] [2024-11-18 14:34:08,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:34:08,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:34:08,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:34:08,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:34:08,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-18 14:34:08,437 INFO L87 Difference]: Start difference. First operand 1792 states and 2077 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-18 14:34:08,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:34:08,735 INFO L93 Difference]: Finished difference Result 3475 states and 4038 transitions. [2024-11-18 14:34:08,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 14:34:08,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 178 [2024-11-18 14:34:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:34:08,751 INFO L225 Difference]: With dead ends: 3475 [2024-11-18 14:34:08,751 INFO L226 Difference]: Without dead ends: 1514 [2024-11-18 14:34:08,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-18 14:34:08,755 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 150 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:34:08,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 220 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:34:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-18 14:34:08,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1437. [2024-11-18 14:34:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1140 states have (on average 1.1271929824561404) internal successors, (1285), 1152 states have internal predecessors, (1285), 145 states have call successors, (145), 124 states have call predecessors, (145), 151 states have return successors, (214), 160 states have call predecessors, (214), 144 states have call successors, (214) [2024-11-18 14:34:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1644 transitions. [2024-11-18 14:34:08,904 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1644 transitions. Word has length 178 [2024-11-18 14:34:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:34:08,905 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 1644 transitions. [2024-11-18 14:34:08,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-18 14:34:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1644 transitions. [2024-11-18 14:34:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-18 14:34:08,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:34:08,911 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:34:08,930 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 14:34:09,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:34:09,112 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:34:09,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:34:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1242735248, now seen corresponding path program 1 times [2024-11-18 14:34:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:34:09,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857558935] [2024-11-18 14:34:09,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:34:09,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:34:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:34:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 66 proven. 7 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-11-18 14:34:09,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:34:09,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857558935] [2024-11-18 14:34:09,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857558935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:34:09,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955680873] [2024-11-18 14:34:09,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:34:09,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:34:09,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:34:09,249 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 14:34:09,251 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 14:34:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:34:09,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 14:34:09,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:34:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-18 14:34:09,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:34:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-18 14:34:09,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955680873] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:34:09,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:34:09,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-18 14:34:09,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480625677] [2024-11-18 14:34:09,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:34:09,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 14:34:09,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:34:09,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 14:34:09,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-18 14:34:09,805 INFO L87 Difference]: Start difference. First operand 1437 states and 1644 transitions. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 8 states have internal predecessors, (213), 4 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (37), 4 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-18 14:34:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:34:10,260 INFO L93 Difference]: Finished difference Result 1738 states and 1977 transitions. [2024-11-18 14:34:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 14:34:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 8 states have internal predecessors, (213), 4 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (37), 4 states have call predecessors, (37), 4 states have call successors, (37) Word has length 252 [2024-11-18 14:34:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:34:10,277 INFO L225 Difference]: With dead ends: 1738 [2024-11-18 14:34:10,278 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 14:34:10,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 500 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-18 14:34:10,281 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 175 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 14:34:10,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 456 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 14:34:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 14:34:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 14:34:10,283 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 14:34:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 14:34:10,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2024-11-18 14:34:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:34:10,295 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 14:34:10,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 8 states have internal predecessors, (213), 4 states have call successors, (38), 6 states have call predecessors, (38), 8 states have return successors, (37), 4 states have call predecessors, (37), 4 states have call successors, (37) [2024-11-18 14:34:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 14:34:10,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 14:34:10,300 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 14:34:10,318 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 14:34:10,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:34:10,510 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:34:10,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 14:34:38,931 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 14:34:39,007 WARN L156 FloydHoareUtils]: Requires clause for activate_threads contained old-variable. Original clause: (let ((.cse19 (= |old(~p_dw_st~0)| 0))) (let ((.cse10 (not .cse19))) (and (let ((.cse12 (= ~p_dw_pc~0 1))) (let ((.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse17 (not .cse12)) (.cse14 (= ~p_num_write~0 0)) (.cse15 (= ~c_num_read~0 0)) (.cse3 (= ~q_free~0 1)) (.cse16 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~c_dr_pc~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (not (= |old(~c_dr_st~0)| 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) (not (= ~q_write_ev~0 0)) .cse5 .cse11 .cse6 .cse7 .cse12 .cse13 .cse8 .cse10) (and .cse14 .cse15 .cse0 .cse2 .cse3 .cse5 .cse16 .cse17 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse5 .cse11 .cse18 .cse8 .cse10) (and .cse14 .cse15 .cse2 .cse19 (= ~q_write_ev~0 ~q_read_ev~0) .cse3 .cse5 .cse16 .cse7 .cse13 .cse18 .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12 .cse13 .cse8 .cse10)))) (or (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (not (= ~c_dr_st~0 0))) .cse19) (or (= ~p_dw_st~0 0) .cse10)))) Eliminated clause: (exists ((|old(~c_dr_st~0)| Int) (|old(~p_dw_st~0)| Int)) (let ((.cse16 (= |old(~p_dw_st~0)| 0))) (let ((.cse10 (not .cse16))) (and (let ((.cse12 (= ~p_dw_pc~0 1))) (let ((.cse14 (= ~p_num_write~0 0)) (.cse15 (= ~c_num_read~0 0)) (.cse1 (= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ~q_free~0 1)) (.cse18 (not .cse12)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse0 (not (= |old(~c_dr_st~0)| 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) (not (= ~q_write_ev~0 0)) .cse5 .cse11 .cse6 .cse7 .cse12 .cse13 .cse8 .cse10) (and (= ~p_dw_pc~0 0) .cse14 .cse15 .cse2 .cse16 .cse3 .cse5 .cse7 (= ~q_write_ev~0 2) .cse13 .cse17 .cse8 .cse9) (and .cse14 .cse15 .cse0 .cse2 .cse3 .cse5 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse18 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse5 .cse11 .cse17 .cse8 .cse10) (and .cse0 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12 .cse13 .cse8 .cse10)))) (or (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (not (= ~c_dr_st~0 0))) .cse16) (or (= ~p_dw_st~0 0) .cse10))))) [2024-11-18 14:34:39,055 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 14:34:39,298 WARN L156 FloydHoareUtils]: Requires clause for fire_delta_events contained old-variable. Original clause: (and (let ((.cse15 (= ~p_dw_st~0 0)) (.cse19 (= ~p_dw_pc~0 1))) (let ((.cse8 (not .cse19)) (.cse0 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse17 (= |old(~q_read_ev~0)| 2)) (.cse10 (= ~c_num_read~0 ~p_num_write~0)) (.cse4 (= ~q_free~0 1)) (.cse11 (= ~c_dr_pc~0 1)) (.cse14 (<= ~q_req_up~0 0)) (.cse12 (<= 2 |old(~q_write_ev~0)|)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse1 (not .cse15)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse18 (= ~q_free~0 0)) (.cse16 (= ~c_dr_pc~0 0)) (.cse13 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse3 .cse4 .cse5 .cse6 .cse11 .cse8 .cse12 .cse13 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse14 .cse15 (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|) .cse16 .cse17 .cse13 .cse9) (and .cse1 .cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 .cse6 .cse18 .cse11 .cse14 .cse19 .cse17 .cse13) (and .cse1 .cse3 .cse5 .cse6 .cse18 .cse11 .cse14 .cse19 .cse12 .cse17 .cse13) (and .cse1 .cse10 .cse3 .cse4 .cse5 .cse6 .cse11 .cse14 .cse12 .cse13 .cse9) (and .cse1 .cse3 .cse5 .cse6 .cse18 .cse16 .cse13)))) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)) Eliminated clause: (let ((.cse7 (= ~p_dw_pc~0 1)) (.cse18 (= ~p_dw_st~0 0))) (let ((.cse4 (= ~q_free~0 0)) (.cse10 (= ~p_num_write~0 0)) (.cse11 (= ~c_num_read~0 0)) (.cse6 (<= ~q_req_up~0 0)) (.cse8 (= ~q_read_ev~0 2)) (.cse17 (= ~c_dr_pc~0 0)) (.cse0 (not .cse18)) (.cse15 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= ~q_free~0 1)) (.cse16 (<= 2 ~q_write_ev~0)) (.cse2 (not (= ~c_dr_st~0 0))) (.cse3 (= 1 ~c_dr_i~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse13 (not .cse7)) (.cse9 (= ~p_dw_i~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse11 .cse1 .cse12 .cse2 .cse3 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse12 .cse16 .cse2 .cse3 .cse5 .cse6 .cse9 .cse14) (and .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse17 .cse9) (and (= ~p_dw_pc~0 0) .cse10 .cse11 .cse1 .cse12 .cse3 .cse6 (= ~q_write_ev~0 2) .cse18 .cse8 .cse17 .cse9 .cse14) (and .cse0 .cse15 .cse1 .cse12 .cse16 .cse2 .cse3 .cse5 .cse13 .cse9 .cse14)))) [2024-11-18 14:34:39,390 WARN L156 FloydHoareUtils]: Requires clause for update_channels contained old-variable. Original clause: (let ((.cse20 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_pc~0 1))) (let ((.cse1 (not .cse8)) (.cse2 (= ~q_free~0 0)) (.cse4 (not .cse20)) (.cse0 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse3 (= ~q_read_ev~0 2))) (and (or .cse0 .cse1) (or (not .cse2) .cse3 .cse1) (let ((.cse9 (= ~p_dw_pc~0 1))) (let ((.cse17 (not .cse9)) (.cse13 (= ~p_num_write~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse16 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse21 (= ~c_dr_pc~0 0)) (.cse12 (<= |old(~q_req_up~0)| 0)) (.cse22 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (= |old(~q_req_up~0)| 1)) (.cse15 (= ~q_free~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse10 (<= 2 |old(~q_write_ev~0)|)) (.cse11 (= ~p_dw_i~0 1)) (.cse18 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse7 .cse16 .cse17 .cse18) (and .cse4 .cse19 .cse5 .cse15 .cse6 .cse7 .cse8 .cse17 .cse10 .cse11 .cse18) (and .cse13 .cse14 .cse5 .cse15 .cse7 .cse16 .cse20 .cse21 .cse11 .cse18 .cse12) (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse21 .cse11) (and .cse4 .cse5 .cse22 .cse6 .cse7 .cse2 .cse8 (not (= |old(~q_write_ev~0)| 0)) .cse9 .cse11 .cse12) (and .cse4 .cse19 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12) (and .cse4 .cse5 .cse22 .cse23 .cse6 .cse7 .cse2 .cse8 .cse9 .cse10 .cse11) (and .cse4 .cse19 .cse5 .cse23 (<= 1 |old(~q_read_ev~0)|) .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18)))) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (or .cse4 (and (= ~q_write_ev~0 2) .cse0 .cse3))))) Eliminated clause: (let ((.cse9 (= ~c_dr_pc~0 1))) (let ((.cse19 (= ~q_free~0 0)) (.cse22 (= ~q_read_ev~0 2)) (.cse1 (not .cse9))) (and (exists ((|old(~q_req_up~0)| Int)) (let ((.cse21 (= ~p_dw_st~0 0))) (let ((.cse2 (not .cse21)) (.cse0 (= ~q_req_up~0 |old(~q_req_up~0)|))) (and (or .cse0 .cse1) (let ((.cse10 (= ~p_dw_pc~0 1))) (let ((.cse18 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse17 (= |old(~q_req_up~0)| 1)) (.cse14 (= ~p_num_write~0 0)) (.cse15 (= ~c_num_read~0 0)) (.cse20 (= ~c_dr_pc~0 0)) (.cse13 (<= |old(~q_req_up~0)| 0)) (.cse3 (= ~c_num_read~0 ~p_num_write~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse8 (= 1 ~c_dr_i~0)) (.cse16 (not .cse10)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse2 .cse15 .cse4 .cse5 .cse7 .cse8 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse16 .cse12) (and .cse2 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 ~q_read_ev~0) .cse11 .cse12) (and .cse2 .cse4 .cse18 (not (= ~q_write_ev~0 0)) .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse13) (and .cse2 .cse4 .cse18 .cse17 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11) (and .cse2 .cse4 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse13) (and .cse2 .cse4 .cse7 .cse8 .cse19 .cse20 .cse11) (and (= ~p_dw_pc~0 0) .cse14 .cse15 .cse4 .cse5 .cse8 .cse21 .cse20 .cse11 .cse12 .cse13) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse11 .cse12)))) (or .cse2 (and (= ~q_write_ev~0 2) .cse0 .cse22)))))) (or (not .cse19) .cse22 .cse1)))) [2024-11-18 14:34:39,438 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 14:34:39,487 WARN L156 FloydHoareUtils]: Requires clause for reset_delta_events contained old-variable. Original clause: (let ((.cse21 (= ~p_dw_st~0 0))) (let ((.cse6 (not .cse21)) (.cse12 (= |old(~q_read_ev~0)| 2)) (.cse15 (= ~q_free~0 1))) (and (let ((.cse11 (= ~p_dw_pc~0 1))) (let ((.cse17 (not .cse11)) (.cse8 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse7 (<= 1 |old(~q_write_ev~0)|)) (.cse3 (= ~q_free~0 0)) (.cse19 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (not (= ~c_dr_st~0 0))) (.cse9 (= ~c_dr_pc~0 1)) (.cse20 (<= 2 |old(~q_write_ev~0)|)) (.cse13 (= ~p_num_write~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse16 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= ~q_req_up~0 0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse5 (= ~p_dw_i~0 1)) (.cse18 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse8 .cse2 .cse3 .cse9 .cse10 .cse11 .cse12 .cse5) (and .cse13 .cse6 .cse14 .cse0 .cse15 .cse1 .cse2 .cse16 .cse17 .cse18) (and .cse6 .cse19 .cse0 .cse15 .cse1 .cse2 .cse9 .cse17 .cse20 .cse5 .cse18) (and .cse6 .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 .cse10 (not (= |old(~q_write_ev~0)| 0)) .cse11 .cse12 .cse5) (and .cse19 .cse0 (= |old(~q_read_ev~0)| 1) .cse15 .cse1 .cse2 .cse9 .cse10 .cse11 .cse20 .cse5 .cse18) (and .cse6 .cse7 .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse11 .cse12 .cse5) (and .cse6 .cse19 .cse0 .cse15 .cse1 .cse2 .cse9 .cse10 .cse20 .cse5 .cse18) (and .cse13 .cse14 .cse0 .cse15 .cse2 .cse16 .cse10 .cse21 .cse4 .cse12 .cse5 .cse18)))) (or .cse6 (= ~q_write_ev~0 2) (not .cse12) (not .cse15)) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0)))) Eliminated clause: (let ((.cse20 (= ~p_dw_st~0 0))) (let ((.cse0 (not .cse20)) (.cse13 (= ~q_free~0 1)) (.cse9 (= ~q_read_ev~0 2))) (and (let ((.cse7 (= ~p_dw_pc~0 1))) (let ((.cse8 (<= 1 ~q_write_ev~0)) (.cse19 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse4 (= ~q_free~0 0)) (.cse12 (= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= 2 ~q_write_ev~0)) (.cse2 (not (= ~c_dr_st~0 0))) (.cse5 (= ~c_dr_pc~0 1)) (.cse18 (not .cse7)) (.cse16 (= ~p_num_write~0 0)) (.cse17 (= ~c_num_read~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse6 (<= ~q_req_up~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse10 (= ~p_dw_i~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse10) (and .cse12 .cse1 .cse13 (= ~q_read_ev~0 1) .cse14 .cse2 .cse3 .cse5 .cse6 .cse7 .cse10 .cse15) (and .cse16 .cse0 .cse17 .cse1 .cse13 .cse2 .cse3 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse18 .cse15) (and .cse0 .cse12 .cse1 .cse13 .cse14 .cse2 .cse3 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse19 (not (= ~q_write_ev~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse12 .cse1 .cse13 .cse14 .cse2 .cse3 .cse5 .cse18 .cse10 .cse15) (and (= ~p_dw_pc~0 0) .cse16 .cse17 .cse1 .cse13 .cse3 .cse6 .cse20 .cse9 .cse11 .cse10 .cse15)))) (or .cse0 (= ~q_write_ev~0 2) (not .cse13) (not .cse9))))) [2024-11-18 14:34:39,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:34:39 BoogieIcfgContainer [2024-11-18 14:34:39,586 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 14:34:39,587 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 14:34:39,587 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 14:34:39,587 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 14:34:39,588 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:33:43" (3/4) ... [2024-11-18 14:34:39,590 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 14:34:39,595 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2024-11-18 14:34:39,595 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2024-11-18 14:34:39,595 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2024-11-18 14:34:39,595 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2024-11-18 14:34:39,595 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2024-11-18 14:34:39,596 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2024-11-18 14:34:39,596 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2024-11-18 14:34:39,596 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-11-18 14:34:39,606 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-18 14:34:39,607 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 14:34:39,607 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 14:34:39,607 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 14:34:39,745 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 14:34:39,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 14:34:39,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 14:34:39,747 INFO L158 Benchmark]: Toolchain (without parser) took 56878.09ms. Allocated memory was 157.3MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 125.9MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-11-18 14:34:39,747 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 157.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 14:34:39,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.25ms. Allocated memory is still 157.3MB. Free memory was 125.2MB in the beginning and 110.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 14:34:39,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.18ms. Allocated memory is still 157.3MB. Free memory was 110.5MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:34:39,748 INFO L158 Benchmark]: Boogie Preprocessor took 55.05ms. Allocated memory is still 157.3MB. Free memory was 108.4MB in the beginning and 106.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:34:39,748 INFO L158 Benchmark]: RCFGBuilder took 576.66ms. Allocated memory is still 157.3MB. Free memory was 106.3MB in the beginning and 116.1MB in the end (delta: -9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 14:34:39,748 INFO L158 Benchmark]: TraceAbstraction took 55699.37ms. Allocated memory was 157.3MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 115.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2024-11-18 14:34:39,749 INFO L158 Benchmark]: Witness Printer took 159.22ms. Allocated memory is still 4.0GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 14:34:39,750 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.24ms. Allocated memory is still 157.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.25ms. Allocated memory is still 157.3MB. Free memory was 125.2MB in the beginning and 110.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.18ms. Allocated memory is still 157.3MB. Free memory was 110.5MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.05ms. Allocated memory is still 157.3MB. Free memory was 108.4MB in the beginning and 106.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 576.66ms. Allocated memory is still 157.3MB. Free memory was 106.3MB in the beginning and 116.1MB in the end (delta: -9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 55699.37ms. Allocated memory was 157.3MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 115.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 159.22ms. Allocated memory is still 4.0GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 20]: 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 9 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.5s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5390 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5316 mSDsluCounter, 9521 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6554 mSDsCounter, 1004 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3905 IncrementalHoareTripleChecker+Invalid, 4909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1004 mSolverCounterUnsat, 2967 mSDtfsCounter, 3905 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1522 GetRequests, 1372 SyntacticMatches, 5 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14883occurred in iteration=13, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 4454 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2978 NumberOfCodeBlocks, 2978 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3435 ConstructedInterpolants, 0 QuantifiedInterpolants, 5729 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2478 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 29 InterpolantComputations, 18 PerfectInterpolantSequences, 1828/1892 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 180]: Location Invariant Derived location invariant: ((((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1)) || (((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) || ((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) && (1 <= q_read_ev))) || ((((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (p_dw_pc != 1)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - InvariantResult [Line: 139]: Location Invariant Derived location invariant: (((((((((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) || (((((((((((q_req_up == 1) && (p_dw_st != 0)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((p_dw_pc == 0) && (q_req_up == 1)) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1))) || (((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (c_dr_pc == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: ((((((((((((((p_last_write == q_buf_0) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1)) || ((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write))) || ((((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_last_write == q_buf_0) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1)) || ((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write))) || ((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_pc != 0)) && (c_dr_pc == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) - ProcedureContractResult [Line: 307]: Procedure Contract for activate_threads Derived contract for procedure activate_threads. Ensures: (((((((((((((((((((((((((\old(c_dr_st) != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) || (((((((((((\old(c_dr_st) != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (\old(p_dw_st) != 0))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (\old(p_dw_st) == 0)) && (q_free == 1)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (q_write_ev == 2)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((\old(c_dr_st) != 0) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((p_num_write == 0) && (c_num_read == 0)) && (\old(c_dr_st) != 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write)) && (\old(p_dw_st) != 0))) || (((((((((((\old(c_dr_st) != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (\old(p_dw_st) != 0))) || (((((((\old(c_dr_st) != 0) && (p_last_write == q_buf_0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (\old(p_dw_st) != 0))) && (((((\old(p_dw_st) == p_dw_st) && (c_dr_st != 0)) || (((q_read_ev == 1) && (c_dr_st != 0)) && (p_dw_st == 0))) || (c_dr_pc != 1)) || (q_free != 1))) && ((((\old(p_dw_st) == p_dw_st) && (c_dr_st != 0)) || (\old(p_dw_st) == 0)) || (p_dw_pc == 1))) && (((((\old(p_dw_st) == p_dw_st) && (c_dr_st != 0)) || ((\old(p_dw_st) == p_dw_st) && (1 <= q_write_ev))) || (c_dr_pc != 1)) || (((long long) c_num_read + 1) != p_num_write))) && (((((\old(p_dw_st) == p_dw_st) && (c_dr_st != 0)) || (q_free != 0)) || (c_dr_pc != 1)) || (q_write_ev < 2))) && (((p_dw_st != 0) || (q_free != 0)) || (q_read_ev != 2))) && (((((\old(p_dw_st) == p_dw_st) && (c_dr_st != 0)) || (c_dr_pc != 0)) || (((c_dr_st != 0) && (q_read_ev != 0)) && (p_dw_st == 0))) || (q_free != 0))) && ((p_dw_st == 0) || (\old(p_dw_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))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_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)))) - ProcedureContractResult [Line: 251]: Procedure Contract for exists_runnable_thread Derived contract for procedure exists_runnable_thread. Requires: (((((((((((((((((((p_last_write == q_buf_0) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1)) || ((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write))) || ((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_pc != 0)) && (c_dr_pc == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) Ensures: ((((((0 < \result) || (p_dw_st != 0)) && ((((0 < \result) || ((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (c_dr_pc != 1)) || (((long long) c_num_read + 1) != p_num_write))) && ((((((((0 < \result) || (p_num_write != 1)) || (q_req_up != 1)) || (c_dr_pc == p_dw_pc)) || (c_num_read != 0)) || (q_read_ev < 1)) || (q_write_ev < 2)) || ((c_dr_st != 0) && (q_read_ev == 2)))) && (((((((((((((((((((p_last_write == q_buf_0) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1)) || ((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write))) || ((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((p_num_write == 0) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((q_req_up == 1) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (1 == c_dr_i)) && (q_free == 0)) && (p_dw_pc != 0)) && (c_dr_pc == 0)) && (1 <= q_read_ev)) && (p_dw_i == 1)) && (p_num_write == 1))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)))) && (((((((((((((((((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))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_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)))) - ProcedureContractResult [Line: 80]: Procedure Contract for is_do_read_c_triggered Derived contract for procedure is_do_read_c_triggered. Requires: ((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (q_read_ev == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) || ((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write))) || ((((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1))) || ((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((p_last_write == q_buf_0) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 0)) && (p_dw_i == 1))) Ensures: (((((((\result == 0) || (0 < q_write_ev)) && ((\result == 0) || (q_write_ev < 2))) && ((\result == 0) || (q_free != 1))) && ((((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (c_dr_st != 0)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1)) || ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (q_read_ev == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write))) || ((((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((p_last_write == q_buf_0) && (c_dr_st != 0)) && (q_free == 0)) && (q_read_ev != 0)) && (c_dr_pc == 0)) && (p_dw_i == 1))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (q_req_up <= 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)))) && ((c_dr_pc != 0) || ((\result == 0) && (1 == c_dr_i)))) && (((((((((((((((((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))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_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)))) - ProcedureContractResult [Line: 271]: Procedure Contract for fire_delta_events Derived contract for procedure fire_delta_events. Requires: (((((((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1)) || ((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) Ensures: (((((((((((c_dr_pc != 1) || (\old(q_write_ev) == 0)) || (((long long) c_num_read + 1) != p_num_write)) || (((q_write_ev != 0) && (q_write_ev == \old(q_write_ev))) && (q_read_ev == 2))) && ((((0 < q_req_up) || (q_read_ev == 1)) || (\old(q_read_ev) == q_read_ev)) || (c_dr_pc != 1))) && (((\old(q_write_ev) < 2) || (q_write_ev == \old(q_write_ev))) || (c_dr_pc != 1))) && (((q_write_ev == 2) || (\old(q_read_ev) != 2)) || (2 != \old(q_write_ev)))) && ((((0 < q_write_ev) || (c_dr_pc != 1)) || (((long long) c_num_read + 1) != p_num_write)) || (((q_write_ev != 0) && (q_write_ev == \old(q_write_ev))) && (q_read_ev == 2)))) && (((1 == c_dr_i) && (\old(q_read_ev) == q_read_ev)) || ((1 == c_dr_i) && (\old(q_read_ev) == 0)))) && ((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (c_dr_st != 0)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1)) || ((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (c_dr_st != 0)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1))) || (((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write))) || ((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (2 <= \old(q_write_ev))) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (c_dr_st != 0)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (2 <= \old(q_write_ev))) && (\old(q_read_ev) == 2)) && (p_dw_i == 1))) || ((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (2 <= \old(q_write_ev))) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 == \old(q_write_ev))) && (q_req_up <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)))) && (((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_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)))) - ProcedureContractResult [Line: 218]: Procedure Contract for update_channels Derived contract for procedure update_channels. Requires: (((q_free != 0) || (q_read_ev == 2)) || (c_dr_pc != 1)) Ensures: (((((((((((0 < \old(q_req_up)) || (((q_write_ev == \old(q_write_ev)) && (q_req_up == \old(q_req_up))) && (q_read_ev == 2))) || (q_free != 0)) || (c_dr_pc != 1)) && ((((0 < \old(q_req_up)) || ((\old(q_read_ev) == q_read_ev) && (q_req_up == \old(q_req_up)))) || (p_dw_pc != 1)) || (q_free != 1))) && ((p_dw_st != 0) || (((q_write_ev == 2) && (q_req_up == \old(q_req_up))) && (q_read_ev == 2)))) && (((q_write_ev == \old(q_write_ev)) || (c_dr_pc != 1)) || (q_free != 1))) && ((q_free != 0) || (\old(q_read_ev) == q_read_ev))) && ((((((((((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (\old(q_req_up) == 1)) && (1 <= \old(q_read_ev))) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (2 <= \old(q_write_ev))) && (p_dw_i == 1)) && (c_last_read == p_last_write)) || ((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (2 <= \old(q_write_ev))) && (p_dw_i == 1)) && (\old(q_req_up) <= 0))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (1 == c_dr_i)) && (2 == \old(q_write_ev))) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (\old(q_req_up) <= 0))) || ((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (2 <= \old(q_write_ev))) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_last_write == q_buf_0) && (((long long) c_num_read + 1) == p_num_write)) && (\old(q_req_up) == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (2 <= \old(q_write_ev))) && (\old(q_read_ev) == 2)) && (p_dw_i == 1))) || (((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (\old(q_write_ev) != 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (\old(q_req_up) <= 0))) || ((((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc == 1)) && (2 <= \old(q_write_ev))) && (p_dw_i == 1)) && (c_last_read == p_last_write)) && (\old(q_req_up) <= 0)))) && ((((\old(q_read_ev) < 1) || (\old(q_req_up) != 1)) || (c_dr_pc != 1)) || (q_req_up < 1))) && (((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (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)))) - ProcedureContractResult [Line: 289]: Procedure Contract for reset_delta_events Derived contract for procedure reset_delta_events. Requires: ((((((((((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (1 <= q_write_ev)) && (q_read_ev == 2)) && (p_dw_i == 1)) || ((((((p_last_write == q_buf_0) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1))) || ((((((((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (q_read_ev == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (1 <= q_write_ev)) && (q_read_ev == 2)) && (p_dw_i == 1))) || ((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) && ((((p_dw_st != 0) || (q_write_ev == 2)) || (q_free != 1)) || (q_read_ev != 2))) Ensures: ((((((((((((((\old(q_write_ev) < 1) || (1 < q_write_ev)) || (c_dr_pc != 1)) && (((p_dw_pc == 1) || (q_write_ev == \old(q_write_ev))) || (c_dr_pc != 1))) && (((p_dw_pc != 1) || (q_write_ev == \old(q_write_ev))) || (q_free != 1))) && ((((q_write_ev == 2) || (\old(q_read_ev) != 2)) || (q_free != 1)) || (2 != \old(q_write_ev)))) && ((((p_dw_pc != 1) || (\old(q_read_ev) != 1)) || ((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_read_ev == 2)) && (c_last_read == p_last_write))) || (q_free != 1))) && ((((q_write_ev == 2) || (p_dw_st == 0)) || (\old(q_read_ev) != 2)) || (2 != \old(q_write_ev)))) && (((((c_dr_st == 0) || (\old(q_write_ev) < 2)) || (q_free != 0)) || (c_dr_pc != 1)) || ((p_dw_pc == 1) && (q_write_ev == \old(q_write_ev))))) && (((((q_write_ev == \old(q_write_ev)) && (\old(q_read_ev) != 1)) || (\old(q_read_ev) != \old(q_write_ev))) && (\old(q_read_ev) == q_read_ev)) || ((\old(q_read_ev) != 0) && (q_read_ev == 2)))) && ((((((((((((((p_last_write == q_buf_0) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1)) || ((((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (2 <= \old(q_write_ev))) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((\old(q_read_ev) == 1) && (q_free == 1)) && (c_dr_st != 0)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (2 <= \old(q_write_ev))) && (p_dw_i == 1))) || ((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (2 <= \old(q_write_ev))) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (c_dr_st != 0)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (\old(q_write_ev) != 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1))) || ((((((((((p_dw_st != 0) && (1 <= \old(q_write_ev))) && (p_last_write == q_buf_0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1))) || (((((((((p_dw_st != 0) && (1 <= \old(q_write_ev))) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (1 == c_dr_i)) && (2 == \old(q_write_ev))) && (q_req_up <= 0)) && (p_dw_st == 0)) && (c_dr_pc == 0)) && (\old(q_read_ev) == 2)) && (p_dw_i == 1)) && (c_last_read == p_last_write)))) && (((((1 == c_dr_i) && (\old(q_write_ev) <= q_write_ev)) && (p_dw_pc == 1)) || (c_dr_pc != 1)) || (((long long) c_num_read + 1) != p_num_write))) && (((1 < q_write_ev) || (q_write_ev == \old(q_write_ev))) || (c_dr_pc != 1))) && (((((((((((((((q_buf_0 == \old(q_buf_0)) && (q_free == \old(q_free))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_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)))) - ProcedureContractResult [Line: 61]: Procedure Contract for is_do_write_p_triggered Derived contract for procedure is_do_write_p_triggered. Requires: ((((((((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write)) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1))) || ((((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_pc == 1)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) Ensures: ((((((((\result == 0) || (q_read_ev != 2)) && ((q_read_ev != 0) || (\result == 0))) && ((((0 < q_req_up) || ((p_dw_pc == 1) && (\result == 0))) || ((q_read_ev == 1) && (p_dw_pc == 1))) || (c_dr_pc != 1))) && ((p_dw_pc == 1) || (\result == 0))) && ((((((((((((((((p_num_write == 0) && (p_dw_st != 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == p_dw_pc)) && (p_dw_pc != 1)) && (c_last_read == p_last_write)) || (((((((((((p_dw_st != 0) && (c_num_read == p_num_write)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write))) || ((((((p_dw_st != 0) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (c_dr_pc == 1)) && (p_dw_pc != 1)) && (p_dw_i == 1))) || ((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (2 <= q_write_ev)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (((long long) c_num_read + 1) == p_num_write)) && (q_write_ev != 0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 1)) && (q_req_up <= 0)) && (q_read_ev == 2)) && (p_dw_i == 1))) || (((((((p_dw_st != 0) && (p_last_write == q_buf_0)) && (c_dr_st != 0)) && (1 == c_dr_i)) && (q_free == 0)) && (c_dr_pc == 0)) && (p_dw_i == 1))) || (((((((((((((p_dw_pc == 0) && (p_num_write == 0)) && (c_num_read == 0)) && (p_last_write == q_buf_0)) && (q_free == 1)) && (1 == c_dr_i)) && (q_req_up <= 0)) && (q_write_ev == 2)) && (p_dw_st == 0)) && (q_read_ev == 2)) && (c_dr_pc == 0)) && (p_dw_i == 1)) && (c_last_read == p_last_write)))) && (((((((c_num_read == p_num_write) && (p_last_write == q_buf_0)) && (q_free == 1)) && (1 == c_dr_i)) && (c_last_read == p_last_write)) || (p_dw_pc == 1)) || (c_dr_pc != 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))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_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)))) - ProcedureContractResult [Line: 16]: Procedure Contract for error Derived contract for procedure error. 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))) && (q_req_up == \old(q_req_up))) && (q_ev == \old(q_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)))) RESULT: Ultimate proved your program to be correct! [2024-11-18 14:34:39,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE