/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 17:51:35,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:51:35,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:51:35,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:51:35,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:51:35,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:51:35,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:51:35,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:51:35,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:51:35,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:51:35,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:51:35,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:51:35,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:51:35,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:51:35,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:51:35,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:51:35,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:51:35,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:51:35,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:51:35,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:51:35,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:51:35,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:51:35,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:51:35,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:51:35,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:51:35,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:51:35,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:51:35,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:51:35,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:51:35,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:51:35,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:51:35,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:51:35,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:51:35,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:51:35,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:51:35,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:51:35,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:51:35,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:51:35,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:51:35,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:51:35,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:51:35,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 17:51:35,222 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:51:35,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:51:35,223 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:51:35,223 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:51:35,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:51:35,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:51:35,224 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:51:35,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:51:35,224 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:51:35,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:51:35,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:51:35,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:51:35,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:51:35,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:51:35,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:51:35,225 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:51:35,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:51:35,225 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:51:35,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:51:35,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:51:35,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:51:35,226 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:51:35,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:51:35,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:51:35,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:51:35,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:51:35,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:51:35,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:51:35,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:51:35,228 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:51:35,228 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:51:35,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:51:35,228 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 [2022-03-15 17:51:35,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:51:35,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:51:35,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:51:35,453 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:51:35,453 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:51:35,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.i [2022-03-15 17:51:35,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea32ad8ec/5762a1d616424371bbfacac265f504b9/FLAG48f47e2e2 [2022-03-15 17:51:35,909 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:51:35,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.i [2022-03-15 17:51:35,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea32ad8ec/5762a1d616424371bbfacac265f504b9/FLAG48f47e2e2 [2022-03-15 17:51:35,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea32ad8ec/5762a1d616424371bbfacac265f504b9 [2022-03-15 17:51:35,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:51:35,943 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:51:35,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:51:35,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:51:35,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:51:35,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:51:35" (1/1) ... [2022-03-15 17:51:35,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a8ff0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:35, skipping insertion in model container [2022-03-15 17:51:35,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:51:35" (1/1) ... [2022-03-15 17:51:35,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:51:35,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:51:36,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.i[944,957] [2022-03-15 17:51:36,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:51:36,324 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:51:36,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.i[944,957] [2022-03-15 17:51:36,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:51:36,404 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:51:36,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:36 WrapperNode [2022-03-15 17:51:36,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:51:36,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:51:36,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:51:36,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:51:36,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:36" (1/1) ... [2022-03-15 17:51:36,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:36" (1/1) ... [2022-03-15 17:51:36,466 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 377 [2022-03-15 17:51:36,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:51:36,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:51:36,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:51:36,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:51:36,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:36" (1/1) ... [2022-03-15 17:51:36,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:36" (1/1) ... [2022-03-15 17:51:36,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:36" (1/1) ... [2022-03-15 17:51:36,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:36" (1/1) ... [2022-03-15 17:51:36,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:36" (1/1) ... [2022-03-15 17:51:36,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:36" (1/1) ... [2022-03-15 17:51:36,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:36" (1/1) ... [2022-03-15 17:51:36,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:51:36,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:51:36,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:51:36,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:51:36,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:36" (1/1) ... [2022-03-15 17:51:36,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:51:36,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:51:36,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 17:51:36,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 17:51:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:51:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 17:51:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:51:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:51:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:51:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-15 17:51:36,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-15 17:51:36,598 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-15 17:51:36,598 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-15 17:51:36,599 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-15 17:51:36,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-15 17:51:36,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:51:36,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 17:51:36,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:51:36,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:51:36,601 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 17:51:36,684 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:51:36,685 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:51:37,059 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:51:37,364 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:51:37,364 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 17:51:37,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:51:37 BoogieIcfgContainer [2022-03-15 17:51:37,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:51:37,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:51:37,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:51:37,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:51:37,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:51:35" (1/3) ... [2022-03-15 17:51:37,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43385207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:51:37, skipping insertion in model container [2022-03-15 17:51:37,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:36" (2/3) ... [2022-03-15 17:51:37,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43385207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:51:37, skipping insertion in model container [2022-03-15 17:51:37,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:51:37" (3/3) ... [2022-03-15 17:51:37,373 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2022-03-15 17:51:37,377 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:51:37,378 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:51:37,378 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:51:37,378 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:51:37,417 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,417 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,417 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,417 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,417 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,417 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,417 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,418 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,418 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,418 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,418 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,419 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,419 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,419 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,419 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,419 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,419 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,419 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,420 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,420 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,420 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,420 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,420 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,420 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,421 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,421 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,421 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,421 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,422 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,422 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,422 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,422 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,422 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,422 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,422 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,423 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,423 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,423 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,423 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,423 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,423 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,423 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,423 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,423 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,423 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,423 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,424 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,424 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,424 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,424 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,424 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,424 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,425 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,425 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,425 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,425 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,425 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,425 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,425 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,425 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,426 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,426 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,426 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,426 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,426 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,426 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,426 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,426 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,426 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,426 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,426 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,427 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,427 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,427 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,427 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,427 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,427 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,427 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,427 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,427 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,427 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,427 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,427 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,428 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,428 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,429 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,429 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,429 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,429 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,430 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,432 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,436 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,438 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,438 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,438 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,438 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,438 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,438 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,438 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,438 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,438 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,439 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,439 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,439 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,439 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,439 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,439 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,439 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,439 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,439 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,439 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,439 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,439 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,439 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,440 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,442 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,442 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,442 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,442 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,442 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,443 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,443 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,443 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,443 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,443 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,443 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,443 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,443 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,444 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,444 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,444 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,444 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,444 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,450 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,450 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,450 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,450 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,450 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,450 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,450 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,451 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,452 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,453 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,454 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,454 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,454 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,455 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,455 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,455 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,455 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,455 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,455 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,455 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,455 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,455 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,455 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,456 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:37,456 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 17:51:37,496 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:51:37,501 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 17:51:37,501 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-15 17:51:37,511 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:51:37,516 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 245 flow [2022-03-15 17:51:37,518 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 245 flow [2022-03-15 17:51:37,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-03-15 17:51:37,560 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2022-03-15 17:51:37,560 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 17:51:37,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-03-15 17:51:37,566 INFO L116 LiptonReduction]: Number of co-enabled transitions 2036 [2022-03-15 17:51:47,734 INFO L131 LiptonReduction]: Checked pairs total: 5352 [2022-03-15 17:51:47,734 INFO L133 LiptonReduction]: Total number of compositions: 101 [2022-03-15 17:51:47,739 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2022-03-15 17:51:47,777 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 650 states, 647 states have (on average 3.1035548686244203) internal successors, (2008), 649 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 650 states, 647 states have (on average 3.1035548686244203) internal successors, (2008), 649 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-15 17:51:47,784 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:47,785 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:47,785 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:51:47,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:47,788 INFO L85 PathProgramCache]: Analyzing trace with hash -352452377, now seen corresponding path program 1 times [2022-03-15 17:51:47,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:47,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317700232] [2022-03-15 17:51:47,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:51:48,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:48,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317700232] [2022-03-15 17:51:48,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317700232] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:48,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:48,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:51:48,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [976116265] [2022-03-15 17:51:48,014 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:48,016 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:48,024 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2022-03-15 17:51:48,024 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:48,026 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:51:48,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:51:48,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:48,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:51:48,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:51:48,045 INFO L87 Difference]: Start difference. First operand has 650 states, 647 states have (on average 3.1035548686244203) internal successors, (2008), 649 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:48,115 INFO L93 Difference]: Finished difference Result 550 states and 1673 transitions. [2022-03-15 17:51:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:51:48,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-03-15 17:51:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:48,131 INFO L225 Difference]: With dead ends: 550 [2022-03-15 17:51:48,132 INFO L226 Difference]: Without dead ends: 530 [2022-03-15 17:51:48,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:51:48,135 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:48,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 6 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:51:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-03-15 17:51:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2022-03-15 17:51:48,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 3.0661625708884688) internal successors, (1622), 529 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:48,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2022-03-15 17:51:48,200 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2022-03-15 17:51:48,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:48,200 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2022-03-15 17:51:48,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:48,201 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2022-03-15 17:51:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 17:51:48,201 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:48,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:48,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:51:48,202 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:51:48,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:48,202 INFO L85 PathProgramCache]: Analyzing trace with hash 595765125, now seen corresponding path program 1 times [2022-03-15 17:51:48,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:48,207 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706353600] [2022-03-15 17:51:48,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:48,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:51:48,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:48,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706353600] [2022-03-15 17:51:48,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706353600] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:48,317 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:48,317 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:51:48,317 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1048754399] [2022-03-15 17:51:48,317 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:48,318 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:48,320 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2022-03-15 17:51:48,320 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:48,320 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:51:48,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:51:48,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:48,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:51:48,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:51:48,321 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:48,360 INFO L93 Difference]: Finished difference Result 490 states and 1480 transitions. [2022-03-15 17:51:48,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:51:48,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-03-15 17:51:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:48,365 INFO L225 Difference]: With dead ends: 490 [2022-03-15 17:51:48,366 INFO L226 Difference]: Without dead ends: 490 [2022-03-15 17:51:48,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:51:48,367 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:48,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:51:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-03-15 17:51:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2022-03-15 17:51:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.0265848670756648) internal successors, (1480), 489 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1480 transitions. [2022-03-15 17:51:48,379 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1480 transitions. Word has length 9 [2022-03-15 17:51:48,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:48,379 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 1480 transitions. [2022-03-15 17:51:48,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1480 transitions. [2022-03-15 17:51:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 17:51:48,381 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:48,381 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:48,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:51:48,381 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:51:48,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:48,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1258375575, now seen corresponding path program 1 times [2022-03-15 17:51:48,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:48,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436171607] [2022-03-15 17:51:48,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:48,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:51:48,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:48,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436171607] [2022-03-15 17:51:48,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436171607] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:48,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:48,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:51:48,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [112339422] [2022-03-15 17:51:48,436 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:48,460 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:48,463 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 15 transitions. [2022-03-15 17:51:48,463 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:49,032 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:51:49,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:51:49,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:49,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:51:49,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:51:49,034 INFO L87 Difference]: Start difference. First operand 490 states and 1480 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:49,069 INFO L93 Difference]: Finished difference Result 482 states and 1450 transitions. [2022-03-15 17:51:49,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:51:49,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 17:51:49,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:49,072 INFO L225 Difference]: With dead ends: 482 [2022-03-15 17:51:49,072 INFO L226 Difference]: Without dead ends: 482 [2022-03-15 17:51:49,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:51:49,073 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:49,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 5 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:51:49,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-03-15 17:51:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2022-03-15 17:51:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 3.0145530145530146) internal successors, (1450), 481 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1450 transitions. [2022-03-15 17:51:49,083 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1450 transitions. Word has length 11 [2022-03-15 17:51:49,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:49,083 INFO L470 AbstractCegarLoop]: Abstraction has 482 states and 1450 transitions. [2022-03-15 17:51:49,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:49,083 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1450 transitions. [2022-03-15 17:51:49,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 17:51:49,084 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:49,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:49,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 17:51:49,085 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:51:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:49,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1347383153, now seen corresponding path program 1 times [2022-03-15 17:51:49,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:49,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903890590] [2022-03-15 17:51:49,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:49,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:51:49,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:49,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903890590] [2022-03-15 17:51:49,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903890590] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:49,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:49,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:51:49,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1724207374] [2022-03-15 17:51:49,190 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:49,191 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:49,195 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 34 transitions. [2022-03-15 17:51:49,195 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:50,024 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:51:50,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:51:50,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:50,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:51:50,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:51:50,025 INFO L87 Difference]: Start difference. First operand 482 states and 1450 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:50,124 INFO L93 Difference]: Finished difference Result 452 states and 1196 transitions. [2022-03-15 17:51:50,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:51:50,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 17:51:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:50,126 INFO L225 Difference]: With dead ends: 452 [2022-03-15 17:51:50,126 INFO L226 Difference]: Without dead ends: 332 [2022-03-15 17:51:50,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:51:50,131 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:50,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 15 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:51:50,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-03-15 17:51:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2022-03-15 17:51:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 2.56797583081571) internal successors, (850), 331 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 850 transitions. [2022-03-15 17:51:50,140 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 850 transitions. Word has length 12 [2022-03-15 17:51:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:50,140 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 850 transitions. [2022-03-15 17:51:50,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 850 transitions. [2022-03-15 17:51:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 17:51:50,142 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:50,142 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:50,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:51:50,142 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:51:50,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:50,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1993348426, now seen corresponding path program 1 times [2022-03-15 17:51:50,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:50,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894814873] [2022-03-15 17:51:50,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:51:50,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:50,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894814873] [2022-03-15 17:51:50,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894814873] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:50,224 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:50,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:51:50,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1306695036] [2022-03-15 17:51:50,224 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:50,226 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:50,238 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 54 transitions. [2022-03-15 17:51:50,238 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:50,991 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:51:50,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:51:50,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:50,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:51:50,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:51:50,992 INFO L87 Difference]: Start difference. First operand 332 states and 850 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:51,053 INFO L93 Difference]: Finished difference Result 471 states and 1167 transitions. [2022-03-15 17:51:51,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:51:51,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 17:51:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:51,055 INFO L225 Difference]: With dead ends: 471 [2022-03-15 17:51:51,055 INFO L226 Difference]: Without dead ends: 341 [2022-03-15 17:51:51,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:51:51,056 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:51,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 7 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:51:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-03-15 17:51:51,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 327. [2022-03-15 17:51:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.411042944785276) internal successors, (786), 326 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 786 transitions. [2022-03-15 17:51:51,062 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 786 transitions. Word has length 14 [2022-03-15 17:51:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:51,062 INFO L470 AbstractCegarLoop]: Abstraction has 327 states and 786 transitions. [2022-03-15 17:51:51,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 786 transitions. [2022-03-15 17:51:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 17:51:51,063 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:51,063 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:51,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 17:51:51,063 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:51:51,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:51,063 INFO L85 PathProgramCache]: Analyzing trace with hash -671813070, now seen corresponding path program 1 times [2022-03-15 17:51:51,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:51,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98085690] [2022-03-15 17:51:51,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:51,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:51:51,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:51,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98085690] [2022-03-15 17:51:51,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98085690] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:51,118 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:51,118 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:51:51,118 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [789162837] [2022-03-15 17:51:51,118 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:51,120 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:51,132 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 110 transitions. [2022-03-15 17:51:51,132 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:52,531 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8216#(<= ~__unbuffered_cnt~0 0)] [2022-03-15 17:51:52,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:51:52,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:52,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:51:52,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:51:52,532 INFO L87 Difference]: Start difference. First operand 327 states and 786 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:52,619 INFO L93 Difference]: Finished difference Result 266 states and 583 transitions. [2022-03-15 17:51:52,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 17:51:52,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 17:51:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:52,620 INFO L225 Difference]: With dead ends: 266 [2022-03-15 17:51:52,620 INFO L226 Difference]: Without dead ends: 206 [2022-03-15 17:51:52,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:51:52,621 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:52,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 20 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:51:52,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-03-15 17:51:52,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-03-15 17:51:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 2.1414634146341465) internal successors, (439), 205 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 439 transitions. [2022-03-15 17:51:52,625 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 439 transitions. Word has length 15 [2022-03-15 17:51:52,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:52,625 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 439 transitions. [2022-03-15 17:51:52,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 439 transitions. [2022-03-15 17:51:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 17:51:52,626 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:52,626 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:52,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 17:51:52,626 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:51:52,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2116500109, now seen corresponding path program 1 times [2022-03-15 17:51:52,627 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:52,627 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917733796] [2022-03-15 17:51:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:52,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:51:52,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:52,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917733796] [2022-03-15 17:51:52,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917733796] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:52,675 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:52,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:51:52,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1439547245] [2022-03-15 17:51:52,675 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:52,678 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:52,695 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 127 transitions. [2022-03-15 17:51:52,695 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:53,311 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:51:53,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:51:53,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:53,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:51:53,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:51:53,312 INFO L87 Difference]: Start difference. First operand 206 states and 439 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:53,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:53,387 INFO L93 Difference]: Finished difference Result 272 states and 557 transitions. [2022-03-15 17:51:53,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 17:51:53,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 17:51:53,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:53,388 INFO L225 Difference]: With dead ends: 272 [2022-03-15 17:51:53,388 INFO L226 Difference]: Without dead ends: 189 [2022-03-15 17:51:53,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:51:53,389 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:53,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 10 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:51:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-03-15 17:51:53,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2022-03-15 17:51:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.9783783783783784) internal successors, (366), 185 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 366 transitions. [2022-03-15 17:51:53,392 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 366 transitions. Word has length 18 [2022-03-15 17:51:53,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:53,392 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 366 transitions. [2022-03-15 17:51:53,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:53,393 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 366 transitions. [2022-03-15 17:51:53,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 17:51:53,393 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:53,393 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:53,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 17:51:53,393 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:51:53,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1912403766, now seen corresponding path program 1 times [2022-03-15 17:51:53,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:53,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921254057] [2022-03-15 17:51:53,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:53,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:53,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:51:53,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:53,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921254057] [2022-03-15 17:51:53,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921254057] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:53,517 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:53,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:51:53,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1714378130] [2022-03-15 17:51:53,518 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:53,520 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:53,534 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 109 transitions. [2022-03-15 17:51:53,534 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:55,445 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:51:55,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:51:55,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:55,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:51:55,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:51:55,446 INFO L87 Difference]: Start difference. First operand 186 states and 366 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:55,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:55,561 INFO L93 Difference]: Finished difference Result 244 states and 458 transitions. [2022-03-15 17:51:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:51:55,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 17:51:55,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:55,562 INFO L225 Difference]: With dead ends: 244 [2022-03-15 17:51:55,562 INFO L226 Difference]: Without dead ends: 189 [2022-03-15 17:51:55,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-03-15 17:51:55,563 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 62 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:55,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 12 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:51:55,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-03-15 17:51:55,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177. [2022-03-15 17:51:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.8863636363636365) internal successors, (332), 176 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 332 transitions. [2022-03-15 17:51:55,567 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 332 transitions. Word has length 18 [2022-03-15 17:51:55,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:55,567 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 332 transitions. [2022-03-15 17:51:55,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:55,567 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 332 transitions. [2022-03-15 17:51:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 17:51:55,567 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:55,567 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:55,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 17:51:55,568 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:51:55,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash -663625178, now seen corresponding path program 2 times [2022-03-15 17:51:55,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:55,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314807548] [2022-03-15 17:51:55,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:51:55,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:55,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314807548] [2022-03-15 17:51:55,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314807548] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:55,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:55,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:51:55,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1358866153] [2022-03-15 17:51:55,670 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:55,673 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:55,688 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 128 transitions. [2022-03-15 17:51:55,688 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:55,924 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10164#(<= ~__unbuffered_cnt~0 0)] [2022-03-15 17:51:55,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 17:51:55,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:55,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 17:51:55,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:51:55,925 INFO L87 Difference]: Start difference. First operand 177 states and 332 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:56,034 INFO L93 Difference]: Finished difference Result 157 states and 294 transitions. [2022-03-15 17:51:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:51:56,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 17:51:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:56,035 INFO L225 Difference]: With dead ends: 157 [2022-03-15 17:51:56,035 INFO L226 Difference]: Without dead ends: 36 [2022-03-15 17:51:56,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:51:56,035 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 63 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:56,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 12 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:51:56,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-15 17:51:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-03-15 17:51:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2022-03-15 17:51:56,038 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 18 [2022-03-15 17:51:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:56,038 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2022-03-15 17:51:56,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2022-03-15 17:51:56,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 17:51:56,038 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:56,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:56,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 17:51:56,039 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:51:56,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:56,039 INFO L85 PathProgramCache]: Analyzing trace with hash 948623089, now seen corresponding path program 1 times [2022-03-15 17:51:56,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:56,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736119732] [2022-03-15 17:51:56,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:56,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:51:56,086 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 17:51:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:51:56,182 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 17:51:56,182 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 17:51:56,182 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-03-15 17:51:56,184 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-03-15 17:51:56,184 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-03-15 17:51:56,184 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-03-15 17:51:56,184 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-03-15 17:51:56,184 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-15 17:51:56,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 17:51:56,185 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:56,189 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:51:56,189 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:51:56,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:51:56 BasicIcfg [2022-03-15 17:51:56,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:51:56,261 INFO L158 Benchmark]: Toolchain (without parser) took 20317.49ms. Allocated memory was 213.9MB in the beginning and 602.9MB in the end (delta: 389.0MB). Free memory was 189.4MB in the beginning and 246.7MB in the end (delta: -57.3MB). Peak memory consumption was 331.9MB. Max. memory is 8.0GB. [2022-03-15 17:51:56,261 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 213.9MB. Free memory is still 177.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:51:56,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.10ms. Allocated memory is still 213.9MB. Free memory was 189.2MB in the beginning and 171.6MB in the end (delta: 17.5MB). Peak memory consumption was 20.7MB. Max. memory is 8.0GB. [2022-03-15 17:51:56,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.50ms. Allocated memory is still 213.9MB. Free memory was 171.6MB in the beginning and 168.4MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 17:51:56,262 INFO L158 Benchmark]: Boogie Preprocessor took 51.70ms. Allocated memory is still 213.9MB. Free memory was 168.4MB in the beginning and 165.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 17:51:56,262 INFO L158 Benchmark]: RCFGBuilder took 847.51ms. Allocated memory was 213.9MB in the beginning and 268.4MB in the end (delta: 54.5MB). Free memory was 165.7MB in the beginning and 179.7MB in the end (delta: -14.0MB). Peak memory consumption was 51.6MB. Max. memory is 8.0GB. [2022-03-15 17:51:56,262 INFO L158 Benchmark]: TraceAbstraction took 18892.68ms. Allocated memory was 268.4MB in the beginning and 602.9MB in the end (delta: 334.5MB). Free memory was 179.2MB in the beginning and 246.7MB in the end (delta: -67.5MB). Peak memory consumption was 266.9MB. Max. memory is 8.0GB. [2022-03-15 17:51:56,263 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 213.9MB. Free memory is still 177.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 461.10ms. Allocated memory is still 213.9MB. Free memory was 189.2MB in the beginning and 171.6MB in the end (delta: 17.5MB). Peak memory consumption was 20.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.50ms. Allocated memory is still 213.9MB. Free memory was 171.6MB in the beginning and 168.4MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.70ms. Allocated memory is still 213.9MB. Free memory was 168.4MB in the beginning and 165.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 847.51ms. Allocated memory was 213.9MB in the beginning and 268.4MB in the end (delta: 54.5MB). Free memory was 165.7MB in the beginning and 179.7MB in the end (delta: -14.0MB). Peak memory consumption was 51.6MB. Max. memory is 8.0GB. * TraceAbstraction took 18892.68ms. Allocated memory was 268.4MB in the beginning and 602.9MB in the end (delta: 334.5MB). Free memory was 179.2MB in the beginning and 246.7MB in the end (delta: -67.5MB). Peak memory consumption was 266.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.2s, 123 PlacesBefore, 36 PlacesAfterwards, 115 TransitionsBefore, 26 TransitionsAfterwards, 2036 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 5352 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2346, positive: 2163, positive conditional: 0, positive unconditional: 2163, negative: 183, negative conditional: 0, negative unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1093, positive: 1055, positive conditional: 0, positive unconditional: 1055, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2346, positive: 1108, positive conditional: 0, positive unconditional: 1108, negative: 145, negative conditional: 0, negative unconditional: 145, unknown: 1093, unknown conditional: 0, unknown unconditional: 1093] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t763; [L832] FCALL, FORK 0 pthread_create(&t763, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t763, ((void *)0), P0, ((void *)0))=-2, t763={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] 0 pthread_t t764; [L834] FCALL, FORK 0 pthread_create(&t764, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t764, ((void *)0), P1, ((void *)0))=-1, t763={5:0}, t764={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] 0 pthread_t t765; [L836] FCALL, FORK 0 pthread_create(&t765, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t765, ((void *)0), P2, ((void *)0))=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L849] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L850] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L851] 0 y$flush_delayed = weak$$choice2 [L852] 0 y$mem_tmp = y [L853] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L853] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L854] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L854] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L854] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L854] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L855] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L855] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L855] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L855] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L856] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L856] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L856] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L856] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L857] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L857] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L858] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L858] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L858] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L859] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L859] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L861] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L861] 0 y = y$flush_delayed ? y$mem_tmp : y [L862] 0 y$flush_delayed = (_Bool)0 [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 225 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 294 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 563 IncrementalHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 39 mSDtfsCounter, 563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 29 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! [2022-03-15 17:51:56,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...