/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 01:38:44,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 01:38:44,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 01:38:44,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 01:38:44,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 01:38:44,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 01:38:44,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 01:38:44,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 01:38:44,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 01:38:44,551 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 01:38:44,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 01:38:44,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 01:38:44,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 01:38:44,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 01:38:44,553 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 01:38:44,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 01:38:44,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 01:38:44,554 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 01:38:44,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 01:38:44,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 01:38:44,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 01:38:44,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 01:38:44,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 01:38:44,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 01:38:44,555 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 01:38:44,556 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 01:38:44,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 01:38:44,556 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 01:38:44,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 01:38:44,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 01:38:44,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 01:38:44,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 01:38:44,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:38:44,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 01:38:44,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 01:38:44,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 01:38:44,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 01:38:44,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 01:38:44,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 01:38:44,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 01:38:44,559 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 01:38:44,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 01:38:44,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 01:38:44,560 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: Use bitabs translation -> true [2023-12-19 01:38:44,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 01:38:44,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 01:38:44,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 01:38:44,721 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 01:38:44,721 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 01:38:44,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2023-12-19 01:38:45,949 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 01:38:46,132 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 01:38:46,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2023-12-19 01:38:46,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b001336/2f1010fa12c94108bc69e109fd52c2d1/FLAGc5828a432 [2023-12-19 01:38:46,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99b001336/2f1010fa12c94108bc69e109fd52c2d1 [2023-12-19 01:38:46,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 01:38:46,154 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 01:38:46,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 01:38:46,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 01:38:46,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 01:38:46,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b3a8ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46, skipping insertion in model container [2023-12-19 01:38:46,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,197 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 01:38:46,334 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[914,927] [2023-12-19 01:38:46,377 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[7125,7138] [2023-12-19 01:38:46,399 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:38:46,422 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 01:38:46,430 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[914,927] [2023-12-19 01:38:46,443 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[7125,7138] [2023-12-19 01:38:46,461 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 01:38:46,487 INFO L206 MainTranslator]: Completed translation [2023-12-19 01:38:46,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46 WrapperNode [2023-12-19 01:38:46,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 01:38:46,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 01:38:46,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 01:38:46,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 01:38:46,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,508 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,546 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 469 [2023-12-19 01:38:46,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 01:38:46,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 01:38:46,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 01:38:46,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 01:38:46,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,584 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]. [2023-12-19 01:38:46,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 01:38:46,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 01:38:46,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 01:38:46,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 01:38:46,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (1/1) ... [2023-12-19 01:38:46,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 01:38:46,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 01:38:46,640 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) [2023-12-19 01:38:46,649 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 [2023-12-19 01:38:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 01:38:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-19 01:38:46,667 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-19 01:38:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-19 01:38:46,669 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-19 01:38:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2023-12-19 01:38:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2023-12-19 01:38:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2023-12-19 01:38:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2023-12-19 01:38:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2023-12-19 01:38:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2023-12-19 01:38:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2023-12-19 01:38:46,670 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2023-12-19 01:38:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2023-12-19 01:38:46,671 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2023-12-19 01:38:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2023-12-19 01:38:46,671 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2023-12-19 01:38:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-19 01:38:46,671 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-19 01:38:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2023-12-19 01:38:46,679 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2023-12-19 01:38:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2023-12-19 01:38:46,680 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2023-12-19 01:38:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 01:38:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2023-12-19 01:38:46,681 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2023-12-19 01:38:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2023-12-19 01:38:46,682 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2023-12-19 01:38:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 01:38:46,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 01:38:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2023-12-19 01:38:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2023-12-19 01:38:46,782 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 01:38:46,784 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 01:38:47,224 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 01:38:47,276 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 01:38:47,276 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-19 01:38:47,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:38:47 BoogieIcfgContainer [2023-12-19 01:38:47,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 01:38:47,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 01:38:47,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 01:38:47,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 01:38:47,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:38:46" (1/3) ... [2023-12-19 01:38:47,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4703bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:38:47, skipping insertion in model container [2023-12-19 01:38:47,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:38:46" (2/3) ... [2023-12-19 01:38:47,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4703bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:38:47, skipping insertion in model container [2023-12-19 01:38:47,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:38:47" (3/3) ... [2023-12-19 01:38:47,283 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2023-12-19 01:38:47,304 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 01:38:47,305 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-19 01:38:47,383 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 01:38:47,399 INFO L357 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, mHoare=true, 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;@691b0d1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 01:38:47,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-19 01:38:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 162 states have (on average 1.6358024691358024) internal successors, (265), 169 states have internal predecessors, (265), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-12-19 01:38:47,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-19 01:38:47,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:38:47,432 INFO L195 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] [2023-12-19 01:38:47,432 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:38:47,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:38:47,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1791735372, now seen corresponding path program 1 times [2023-12-19 01:38:47,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:38:47,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051329574] [2023-12-19 01:38:47,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:38:47,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:38:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:38:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:38:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:38:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:38:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:38:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:38:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:38:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:47,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:38:47,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:38:47,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051329574] [2023-12-19 01:38:47,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051329574] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:38:47,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:38:47,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 01:38:47,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728740248] [2023-12-19 01:38:47,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:38:47,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 01:38:47,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:38:47,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 01:38:47,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 01:38:47,954 INFO L87 Difference]: Start difference. First operand has 210 states, 162 states have (on average 1.6358024691358024) internal successors, (265), 169 states have internal predecessors, (265), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:38:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:38:48,713 INFO L93 Difference]: Finished difference Result 424 states and 658 transitions. [2023-12-19 01:38:48,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 01:38:48,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (8), 5 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 53 [2023-12-19 01:38:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:38:48,730 INFO L225 Difference]: With dead ends: 424 [2023-12-19 01:38:48,731 INFO L226 Difference]: Without dead ends: 222 [2023-12-19 01:38:48,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-19 01:38:48,743 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 440 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:38:48,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 479 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:38:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-12-19 01:38:48,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2023-12-19 01:38:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 164 states have internal predecessors, (239), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-19 01:38:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 298 transitions. [2023-12-19 01:38:48,818 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 298 transitions. Word has length 53 [2023-12-19 01:38:48,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:38:48,819 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 298 transitions. [2023-12-19 01:38:48,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:38:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 298 transitions. [2023-12-19 01:38:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-19 01:38:48,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:38:48,825 INFO L195 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] [2023-12-19 01:38:48,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 01:38:48,825 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:38:48,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:38:48,829 INFO L85 PathProgramCache]: Analyzing trace with hash 574959222, now seen corresponding path program 1 times [2023-12-19 01:38:48,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:38:48,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238089869] [2023-12-19 01:38:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:38:48,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:38:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:48,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:38:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:38:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:38:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:38:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:38:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:38:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:38:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:38:49,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:38:49,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238089869] [2023-12-19 01:38:49,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238089869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:38:49,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:38:49,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 01:38:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199771894] [2023-12-19 01:38:49,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:38:49,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 01:38:49,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:38:49,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 01:38:49,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 01:38:49,100 INFO L87 Difference]: Start difference. First operand 205 states and 298 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:38:49,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:38:49,702 INFO L93 Difference]: Finished difference Result 413 states and 597 transitions. [2023-12-19 01:38:49,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 01:38:49,702 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 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 53 [2023-12-19 01:38:49,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:38:49,705 INFO L225 Difference]: With dead ends: 413 [2023-12-19 01:38:49,705 INFO L226 Difference]: Without dead ends: 331 [2023-12-19 01:38:49,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:38:49,706 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 587 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:38:49,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 759 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:38:49,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-12-19 01:38:49,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 293. [2023-12-19 01:38:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 227 states have (on average 1.475770925110132) internal successors, (335), 234 states have internal predecessors, (335), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2023-12-19 01:38:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 421 transitions. [2023-12-19 01:38:49,730 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 421 transitions. Word has length 53 [2023-12-19 01:38:49,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:38:49,730 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 421 transitions. [2023-12-19 01:38:49,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-19 01:38:49,730 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 421 transitions. [2023-12-19 01:38:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-19 01:38:49,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:38:49,731 INFO L195 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] [2023-12-19 01:38:49,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 01:38:49,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:38:49,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:38:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1901074837, now seen corresponding path program 1 times [2023-12-19 01:38:49,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:38:49,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801486299] [2023-12-19 01:38:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:38:49,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:38:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:38:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:38:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:38:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:38:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:38:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:38:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:38:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:38:49,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:38:49,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801486299] [2023-12-19 01:38:49,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801486299] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:38:49,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:38:49,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:38:49,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937221203] [2023-12-19 01:38:49,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:38:49,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:38:49,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:38:49,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:38:49,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:38:49,858 INFO L87 Difference]: Start difference. First operand 293 states and 421 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:38:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:38:50,467 INFO L93 Difference]: Finished difference Result 490 states and 698 transitions. [2023-12-19 01:38:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 01:38:50,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 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 53 [2023-12-19 01:38:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:38:50,470 INFO L225 Difference]: With dead ends: 490 [2023-12-19 01:38:50,470 INFO L226 Difference]: Without dead ends: 327 [2023-12-19 01:38:50,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-19 01:38:50,472 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 350 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:38:50,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 957 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:38:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-12-19 01:38:50,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 297. [2023-12-19 01:38:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 230 states have (on average 1.4652173913043478) internal successors, (337), 237 states have internal predecessors, (337), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2023-12-19 01:38:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 424 transitions. [2023-12-19 01:38:50,508 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 424 transitions. Word has length 53 [2023-12-19 01:38:50,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:38:50,508 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 424 transitions. [2023-12-19 01:38:50,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:38:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 424 transitions. [2023-12-19 01:38:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-19 01:38:50,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:38:50,511 INFO L195 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] [2023-12-19 01:38:50,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 01:38:50,511 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:38:50,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:38:50,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1007689065, now seen corresponding path program 1 times [2023-12-19 01:38:50,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:38:50,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125235882] [2023-12-19 01:38:50,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:38:50,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:38:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:38:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:38:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:38:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:38:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:38:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:38:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:38:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:38:50,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:38:50,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125235882] [2023-12-19 01:38:50,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125235882] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:38:50,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:38:50,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 01:38:50,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674631585] [2023-12-19 01:38:50,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:38:50,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 01:38:50,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:38:50,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 01:38:50,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-19 01:38:50,643 INFO L87 Difference]: Start difference. First operand 297 states and 424 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-19 01:38:52,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:38:52,000 INFO L93 Difference]: Finished difference Result 1144 states and 1585 transitions. [2023-12-19 01:38:52,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-19 01:38:52,000 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 53 [2023-12-19 01:38:52,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:38:52,005 INFO L225 Difference]: With dead ends: 1144 [2023-12-19 01:38:52,005 INFO L226 Difference]: Without dead ends: 965 [2023-12-19 01:38:52,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2023-12-19 01:38:52,007 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 1783 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-19 01:38:52,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 1284 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-19 01:38:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2023-12-19 01:38:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 835. [2023-12-19 01:38:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 649 states have (on average 1.4006163328197228) internal successors, (909), 664 states have internal predecessors, (909), 99 states have call successors, (99), 74 states have call predecessors, (99), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2023-12-19 01:38:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1122 transitions. [2023-12-19 01:38:52,080 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1122 transitions. Word has length 53 [2023-12-19 01:38:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:38:52,080 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 1122 transitions. [2023-12-19 01:38:52,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-19 01:38:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1122 transitions. [2023-12-19 01:38:52,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-19 01:38:52,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:38:52,081 INFO L195 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] [2023-12-19 01:38:52,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 01:38:52,081 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:38:52,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:38:52,082 INFO L85 PathProgramCache]: Analyzing trace with hash -368904586, now seen corresponding path program 1 times [2023-12-19 01:38:52,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:38:52,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556819650] [2023-12-19 01:38:52,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:38:52,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:38:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 01:38:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 01:38:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-19 01:38:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 01:38:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 01:38:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 01:38:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 01:38:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 01:38:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 01:38:52,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 01:38:52,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556819650] [2023-12-19 01:38:52,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556819650] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 01:38:52,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 01:38:52,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 01:38:52,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999817196] [2023-12-19 01:38:52,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 01:38:52,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 01:38:52,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 01:38:52,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 01:38:52,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 01:38:52,171 INFO L87 Difference]: Start difference. First operand 835 states and 1122 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:38:52,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 01:38:52,788 INFO L93 Difference]: Finished difference Result 1650 states and 2199 transitions. [2023-12-19 01:38:52,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 01:38:52,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 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 53 [2023-12-19 01:38:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 01:38:52,792 INFO L225 Difference]: With dead ends: 1650 [2023-12-19 01:38:52,792 INFO L226 Difference]: Without dead ends: 939 [2023-12-19 01:38:52,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-12-19 01:38:52,794 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 240 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 01:38:52,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1065 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 01:38:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2023-12-19 01:38:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 851. [2023-12-19 01:38:52,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 661 states have (on average 1.3857791225416036) internal successors, (916), 676 states have internal predecessors, (916), 99 states have call successors, (99), 74 states have call predecessors, (99), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2023-12-19 01:38:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1133 transitions. [2023-12-19 01:38:52,866 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1133 transitions. Word has length 53 [2023-12-19 01:38:52,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 01:38:52,867 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 1133 transitions. [2023-12-19 01:38:52,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-19 01:38:52,867 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1133 transitions. [2023-12-19 01:38:52,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-19 01:38:52,867 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 01:38:52,868 INFO L195 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] [2023-12-19 01:38:52,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 01:38:52,868 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 01:38:52,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 01:38:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash 53797240, now seen corresponding path program 1 times [2023-12-19 01:38:52,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 01:38:52,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79833731] [2023-12-19 01:38:52,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 01:38:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 01:38:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 01:38:52,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 01:38:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 01:38:52,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 01:38:52,903 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 01:38:52,904 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-19 01:38:52,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-19 01:38:52,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 01:38:52,907 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-19 01:38:52,910 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 01:38:52,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:38:52 BoogieIcfgContainer [2023-12-19 01:38:52,966 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 01:38:52,966 INFO L158 Benchmark]: Toolchain (without parser) took 6812.77ms. Allocated memory was 203.4MB in the beginning and 314.6MB in the end (delta: 111.1MB). Free memory was 158.9MB in the beginning and 261.0MB in the end (delta: -102.2MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2023-12-19 01:38:52,967 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 203.4MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 01:38:52,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.33ms. Allocated memory is still 203.4MB. Free memory was 158.9MB in the beginning and 140.5MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-19 01:38:52,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.08ms. Allocated memory is still 203.4MB. Free memory was 140.5MB in the beginning and 137.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 01:38:52,967 INFO L158 Benchmark]: Boogie Preprocessor took 53.82ms. Allocated memory is still 203.4MB. Free memory was 137.8MB in the beginning and 134.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 01:38:52,967 INFO L158 Benchmark]: RCFGBuilder took 675.32ms. Allocated memory is still 203.4MB. Free memory was 134.2MB in the beginning and 99.1MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-19 01:38:52,968 INFO L158 Benchmark]: TraceAbstraction took 5687.35ms. Allocated memory was 203.4MB in the beginning and 314.6MB in the end (delta: 111.1MB). Free memory was 98.6MB in the beginning and 261.0MB in the end (delta: -162.5MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 01:38:52,969 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.15ms. Allocated memory is still 203.4MB. Free memory is still 160.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 333.33ms. Allocated memory is still 203.4MB. Free memory was 158.9MB in the beginning and 140.5MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.08ms. Allocated memory is still 203.4MB. Free memory was 140.5MB in the beginning and 137.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.82ms. Allocated memory is still 203.4MB. Free memory was 137.8MB in the beginning and 134.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 675.32ms. Allocated memory is still 203.4MB. Free memory was 134.2MB in the beginning and 99.1MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5687.35ms. Allocated memory was 203.4MB in the beginning and 314.6MB in the end (delta: 111.1MB). Free memory was 98.6MB in the beginning and 261.0MB in the end (delta: -162.5MB). There was no memory consumed. Max. memory is 8.0GB. * 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 - CounterExampleResult [Line: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] int local ; [L1087] COND TRUE __VERIFIER_nondet_int() [L1088] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L420] CALL update_channels1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L420] RET update_channels1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L422] RET fire_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L423] CALL activate_threads1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L70] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L83] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L85] return (__retres1); [L321] RET, EXPR is_do_write_p_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L89] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L102] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L104] return (__retres1); [L329] RET, EXPR is_do_read_c_triggered() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L424] CALL reset_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, \old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L424] RET reset_delta_events1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L427] COND TRUE 1 [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L347] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L260] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L276] return (__retres1); [L350] RET, EXPR exists_runnable_thread1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] [L28] reach_error() VAL [E_1=2, E_2=2, E_M=2, M_E=2, T1_E=2, T2_E=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, t1_i=0, t1_pc=0, t1_st=0, t2_i=0, t2_pc=0, t2_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 210 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3436 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3400 mSDsluCounter, 4544 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3627 mSDsCounter, 903 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4402 IncrementalHoareTripleChecker+Invalid, 5305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 903 mSolverCounterUnsat, 917 mSDtfsCounter, 4402 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=851occurred in iteration=5, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 303 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be incorrect! [2023-12-19 01:38:52,993 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...