/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/mix022_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 17:51:05,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:51:05,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:51:05,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:51:05,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:51:05,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:51:05,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:51:05,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:51:05,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:51:05,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:51:05,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:51:05,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:51:05,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:51:05,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:51:05,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:51:05,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:51:05,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:51:05,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:51:05,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:51:05,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:51:05,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:51:05,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:51:05,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:51:05,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:51:05,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:51:05,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:51:05,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:51:05,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:51:05,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:51:05,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:51:05,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:51:05,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:51:05,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:51:05,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:51:05,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:51:05,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:51:05,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:51:05,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:51:05,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:51:05,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:51:05,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:51:05,955 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:05,982 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:51:05,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:51:05,983 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:51:05,983 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:51:05,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:51:05,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:51:05,983 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:51:05,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:51:05,984 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:51:05,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:51:05,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:51:05,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:51:05,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:51:05,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:51:05,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:51:05,985 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:51:05,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:51:05,985 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:51:05,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:51:05,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:51:05,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:51:05,985 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:51:05,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:51:05,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:51:05,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:51:05,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:51:05,986 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:51:05,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:51:05,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:51:05,986 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:51:05,986 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:51:05,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:51:05,987 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:06,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:51:06,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:51:06,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:51:06,169 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:51:06,170 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:51:06,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.i [2022-03-15 17:51:06,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795ca32dc/e36bd60a35e343f18462ae7fcd6a70db/FLAG7b52ef99d [2022-03-15 17:51:06,558 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:51:06,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.i [2022-03-15 17:51:06,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795ca32dc/e36bd60a35e343f18462ae7fcd6a70db/FLAG7b52ef99d [2022-03-15 17:51:06,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795ca32dc/e36bd60a35e343f18462ae7fcd6a70db [2022-03-15 17:51:06,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:51:06,958 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:51:06,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:51:06,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:51:06,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:51:06,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:51:06" (1/1) ... [2022-03-15 17:51:06,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3575bf96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:06, skipping insertion in model container [2022-03-15 17:51:06,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:51:06" (1/1) ... [2022-03-15 17:51:06,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:51:07,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:51:07,190 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/mix022_tso.i[944,957] [2022-03-15 17:51:07,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:51:07,397 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:51:07,405 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/mix022_tso.i[944,957] [2022-03-15 17:51:07,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:51:07,488 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:51:07,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:07 WrapperNode [2022-03-15 17:51:07,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:51:07,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:51:07,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:51:07,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:51:07,494 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:07" (1/1) ... [2022-03-15 17:51:07,520 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:07" (1/1) ... [2022-03-15 17:51:07,559 INFO L137 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 362 [2022-03-15 17:51:07,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:51:07,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:51:07,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:51:07,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:51:07,566 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:07" (1/1) ... [2022-03-15 17:51:07,566 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:07" (1/1) ... [2022-03-15 17:51:07,579 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:07" (1/1) ... [2022-03-15 17:51:07,580 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:07" (1/1) ... [2022-03-15 17:51:07,585 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:07" (1/1) ... [2022-03-15 17:51:07,588 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:07" (1/1) ... [2022-03-15 17:51:07,590 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:07" (1/1) ... [2022-03-15 17:51:07,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:51:07,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:51:07,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:51:07,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:51:07,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:07" (1/1) ... [2022-03-15 17:51:07,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:51:07,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:51:07,661 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:07,698 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:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:51:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 17:51:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:51:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:51:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:51:07,714 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-15 17:51:07,715 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-15 17:51:07,715 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-15 17:51:07,715 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-15 17:51:07,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:51:07,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 17:51:07,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:51:07,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:51:07,717 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:07,821 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:51:07,822 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:51:08,175 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:51:08,439 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:51:08,440 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 17:51:08,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:51:08 BoogieIcfgContainer [2022-03-15 17:51:08,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:51:08,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:51:08,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:51:08,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:51:08,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:51:06" (1/3) ... [2022-03-15 17:51:08,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0b11e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:51:08, skipping insertion in model container [2022-03-15 17:51:08,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:51:07" (2/3) ... [2022-03-15 17:51:08,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0b11e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:51:08, skipping insertion in model container [2022-03-15 17:51:08,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:51:08" (3/3) ... [2022-03-15 17:51:08,448 INFO L111 eAbstractionObserver]: Analyzing ICFG mix022_tso.i [2022-03-15 17:51:08,451 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:51:08,451 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:51:08,451 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:51:08,452 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:51:08,487 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,487 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,487 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,488 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,488 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,488 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,488 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,488 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,488 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,488 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,488 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,488 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,489 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,489 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,489 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,490 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,490 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,490 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,490 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,490 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,491 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,491 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,492 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,493 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,493 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,493 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,493 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,494 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,495 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,496 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,497 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,498 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,498 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,498 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,498 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,498 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,498 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,498 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,498 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,498 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,498 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,499 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,499 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,499 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,499 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,500 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,501 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,501 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,501 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,501 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,501 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,501 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,502 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,502 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,502 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,503 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,503 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,505 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,509 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,510 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,510 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,510 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,510 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,511 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,511 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,511 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,511 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,511 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,511 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,511 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,511 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,511 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,511 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,511 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,511 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,512 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,512 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,512 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,512 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,512 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,512 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,512 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,512 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,514 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,514 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,514 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,514 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,514 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,515 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,515 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,515 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,515 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,515 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,515 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,515 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,515 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,515 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,516 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,516 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,516 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,516 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,519 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,520 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,521 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,522 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,522 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,522 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,522 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,522 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,522 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,522 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,523 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,523 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,523 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,523 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,523 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,523 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,523 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,524 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,524 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,524 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:51:08,524 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 17:51:08,564 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:51:08,570 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:08,570 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-03-15 17:51:08,579 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:51:08,587 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 96 transitions, 202 flow [2022-03-15 17:51:08,589 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 96 transitions, 202 flow [2022-03-15 17:51:08,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 96 transitions, 202 flow [2022-03-15 17:51:08,623 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2022-03-15 17:51:08,624 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 17:51:08,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-03-15 17:51:08,632 INFO L116 LiptonReduction]: Number of co-enabled transitions 1216 [2022-03-15 17:51:20,080 INFO L131 LiptonReduction]: Checked pairs total: 3303 [2022-03-15 17:51:20,080 INFO L133 LiptonReduction]: Total number of compositions: 89 [2022-03-15 17:51:20,111 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 21 transitions, 52 flow [2022-03-15 17:51:20,147 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 162 states, 159 states have (on average 2.610062893081761) internal successors, (415), 161 states have internal predecessors, (415), 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:20,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 159 states have (on average 2.610062893081761) internal successors, (415), 161 states have internal predecessors, (415), 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:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-03-15 17:51:20,152 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:20,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-03-15 17:51:20,153 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-15 17:51:20,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:20,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1240791688, now seen corresponding path program 1 times [2022-03-15 17:51:20,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:20,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942381121] [2022-03-15 17:51:20,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:20,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:20,362 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:20,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:20,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942381121] [2022-03-15 17:51:20,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942381121] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:20,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:20,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:51:20,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [533876464] [2022-03-15 17:51:20,365 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:20,367 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:20,374 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2022-03-15 17:51:20,376 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:20,379 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:51:20,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:51:20,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:20,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:51:20,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:51:20,398 INFO L87 Difference]: Start difference. First operand has 162 states, 159 states have (on average 2.610062893081761) internal successors, (415), 161 states have internal predecessors, (415), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:20,453 INFO L93 Difference]: Finished difference Result 137 states and 315 transitions. [2022-03-15 17:51:20,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:51:20,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-03-15 17:51:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:20,462 INFO L225 Difference]: With dead ends: 137 [2022-03-15 17:51:20,462 INFO L226 Difference]: Without dead ends: 132 [2022-03-15 17:51:20,463 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:20,466 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:20,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 4 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:51:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-03-15 17:51:20,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-03-15 17:51:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.33587786259542) internal successors, (306), 131 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:51:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 306 transitions. [2022-03-15 17:51:20,510 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 306 transitions. Word has length 5 [2022-03-15 17:51:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:20,511 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 306 transitions. [2022-03-15 17:51:20,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 306 transitions. [2022-03-15 17:51:20,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-15 17:51:20,511 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:20,512 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:20,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:51:20,512 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-15 17:51:20,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:20,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1600021676, now seen corresponding path program 1 times [2022-03-15 17:51:20,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:20,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030558701] [2022-03-15 17:51:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:20,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:20,660 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:20,661 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:20,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030558701] [2022-03-15 17:51:20,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030558701] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:20,661 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:20,661 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:51:20,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1340944498] [2022-03-15 17:51:20,661 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:20,662 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:20,663 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2022-03-15 17:51:20,663 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:20,663 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:51:20,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:51:20,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:20,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:51:20,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:51:20,665 INFO L87 Difference]: Start difference. First operand 132 states and 306 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:20,696 INFO L93 Difference]: Finished difference Result 127 states and 292 transitions. [2022-03-15 17:51:20,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:51:20,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:20,697 INFO L225 Difference]: With dead ends: 127 [2022-03-15 17:51:20,697 INFO L226 Difference]: Without dead ends: 127 [2022-03-15 17:51:20,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:51:20,698 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:20,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 3 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:51:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-03-15 17:51:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-03-15 17:51:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.3174603174603177) internal successors, (292), 126 states have internal predecessors, (292), 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:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 292 transitions. [2022-03-15 17:51:20,703 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 292 transitions. Word has length 7 [2022-03-15 17:51:20,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:20,703 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 292 transitions. [2022-03-15 17:51:20,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 292 transitions. [2022-03-15 17:51:20,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-03-15 17:51:20,704 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:20,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:20,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:51:20,704 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-15 17:51:20,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:20,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1937843944, now seen corresponding path program 1 times [2022-03-15 17:51:20,705 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:20,705 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328915810] [2022-03-15 17:51:20,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:20,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:20,753 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:20,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:20,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328915810] [2022-03-15 17:51:20,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328915810] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:20,753 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:20,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:51:20,753 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [476416121] [2022-03-15 17:51:20,753 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:20,754 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:20,755 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 10 transitions. [2022-03-15 17:51:20,755 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:20,790 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:51:20,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:51:20,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:20,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:51:20,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:51:20,791 INFO L87 Difference]: Start difference. First operand 127 states and 292 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:20,822 INFO L93 Difference]: Finished difference Result 122 states and 278 transitions. [2022-03-15 17:51:20,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:51:20,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-03-15 17:51:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:20,824 INFO L225 Difference]: With dead ends: 122 [2022-03-15 17:51:20,824 INFO L226 Difference]: Without dead ends: 122 [2022-03-15 17:51:20,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:51:20,825 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:20,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 4 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:51:20,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-03-15 17:51:20,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-03-15 17:51:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.2975206611570247) internal successors, (278), 121 states have internal predecessors, (278), 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:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 278 transitions. [2022-03-15 17:51:20,829 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 278 transitions. Word has length 8 [2022-03-15 17:51:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:20,829 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 278 transitions. [2022-03-15 17:51:20,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 278 transitions. [2022-03-15 17:51:20,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 17:51:20,830 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:20,830 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:20,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 17:51:20,830 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-15 17:51:20,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash -58752545, now seen corresponding path program 1 times [2022-03-15 17:51:20,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:20,834 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586610450] [2022-03-15 17:51:20,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:20,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:20,914 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:20,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:20,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586610450] [2022-03-15 17:51:20,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586610450] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:20,915 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:20,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:51:20,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [529128218] [2022-03-15 17:51:20,915 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:20,916 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:20,918 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 13 transitions. [2022-03-15 17:51:20,918 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:21,572 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:51:21,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:51:21,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:21,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:51:21,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:51:21,573 INFO L87 Difference]: Start difference. First operand 122 states and 278 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:21,631 INFO L93 Difference]: Finished difference Result 100 states and 191 transitions. [2022-03-15 17:51:21,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:51:21,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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 9 [2022-03-15 17:51:21,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:21,632 INFO L225 Difference]: With dead ends: 100 [2022-03-15 17:51:21,632 INFO L226 Difference]: Without dead ends: 70 [2022-03-15 17:51:21,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:51:21,633 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:21,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 10 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:51:21,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-03-15 17:51:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-03-15 17:51:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 69 states have internal predecessors, (122), 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:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 122 transitions. [2022-03-15 17:51:21,636 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 122 transitions. Word has length 9 [2022-03-15 17:51:21,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:21,636 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 122 transitions. [2022-03-15 17:51:21,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 122 transitions. [2022-03-15 17:51:21,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 17:51:21,636 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:21,636 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:21,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:51:21,637 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-15 17:51:21,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:21,637 INFO L85 PathProgramCache]: Analyzing trace with hash -274442347, now seen corresponding path program 1 times [2022-03-15 17:51:21,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:21,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241829179] [2022-03-15 17:51:21,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:21,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:21,708 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:21,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:21,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241829179] [2022-03-15 17:51:21,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241829179] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:21,708 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:21,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:51:21,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1483029993] [2022-03-15 17:51:21,709 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:21,710 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:21,712 INFO L252 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2022-03-15 17:51:21,712 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:21,713 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:51:21,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:51:21,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:21,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:51:21,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:51:21,713 INFO L87 Difference]: Start difference. First operand 70 states and 122 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:21,768 INFO L93 Difference]: Finished difference Result 55 states and 90 transitions. [2022-03-15 17:51:21,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 17:51:21,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:21,769 INFO L225 Difference]: With dead ends: 55 [2022-03-15 17:51:21,769 INFO L226 Difference]: Without dead ends: 45 [2022-03-15 17:51:21,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:51:21,770 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:21,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 10 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:51:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-15 17:51:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-03-15 17:51:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 44 states have internal predecessors, (72), 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:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-03-15 17:51:21,772 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 12 [2022-03-15 17:51:21,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:21,772 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-03-15 17:51:21,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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:21,772 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-03-15 17:51:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 17:51:21,773 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:21,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:21,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 17:51:21,773 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-15 17:51:21,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:21,773 INFO L85 PathProgramCache]: Analyzing trace with hash -416287607, now seen corresponding path program 1 times [2022-03-15 17:51:21,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:21,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370618142] [2022-03-15 17:51:21,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:21,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:21,936 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:21,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:21,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370618142] [2022-03-15 17:51:21,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370618142] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:21,936 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:21,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-15 17:51:21,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [792800459] [2022-03-15 17:51:21,936 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:21,940 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:21,945 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 28 transitions. [2022-03-15 17:51:21,945 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:22,278 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1991#(= 1 ~x$r_buff0_thd2~0), 1992#(and (<= (div ~x$w_buff0_used~0 256) 0) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0))] [2022-03-15 17:51:22,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 17:51:22,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:22,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 17:51:22,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:51:22,279 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:22,350 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2022-03-15 17:51:22,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 17:51:22,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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 16 [2022-03-15 17:51:22,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:22,351 INFO L225 Difference]: With dead ends: 61 [2022-03-15 17:51:22,351 INFO L226 Difference]: Without dead ends: 25 [2022-03-15 17:51:22,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-03-15 17:51:22,351 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:22,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 10 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:51:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-03-15 17:51:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-03-15 17:51:22,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 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:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-03-15 17:51:22,353 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2022-03-15 17:51:22,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:22,353 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-03-15 17:51:22,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-03-15 17:51:22,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 17:51:22,354 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:22,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:22,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 17:51:22,354 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-15 17:51:22,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:22,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1267982761, now seen corresponding path program 2 times [2022-03-15 17:51:22,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:22,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371257442] [2022-03-15 17:51:22,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:22,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:51:22,560 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:22,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:51:22,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371257442] [2022-03-15 17:51:22,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371257442] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:51:22,561 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:51:22,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-15 17:51:22,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [306868302] [2022-03-15 17:51:22,561 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:51:22,563 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:51:22,595 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 24 transitions. [2022-03-15 17:51:22,595 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:51:22,691 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:51:22,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 17:51:22,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:51:22,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 17:51:22,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:51:22,692 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:51:22,786 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-03-15 17:51:22,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 17:51:22,786 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 16 [2022-03-15 17:51:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:51:22,786 INFO L225 Difference]: With dead ends: 33 [2022-03-15 17:51:22,787 INFO L226 Difference]: Without dead ends: 21 [2022-03-15 17:51:22,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-03-15 17:51:22,787 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:51:22,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 14 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:51:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-03-15 17:51:22,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-03-15 17:51:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-03-15 17:51:22,789 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2022-03-15 17:51:22,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:51:22,789 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-03-15 17:51:22,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-03-15 17:51:22,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 17:51:22,789 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:51:22,789 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:51:22,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 17:51:22,790 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-03-15 17:51:22,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:51:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2094295877, now seen corresponding path program 3 times [2022-03-15 17:51:22,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:51:22,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329851591] [2022-03-15 17:51:22,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:51:22,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:51:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:51:22,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 17:51:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:51:22,899 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 17:51:22,899 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 17:51:22,899 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-03-15 17:51:22,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-03-15 17:51:22,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-03-15 17:51:22,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-03-15 17:51:22,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-03-15 17:51:22,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 17:51:22,902 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-03-15 17:51:22,905 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:51:22,905 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:51:22,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:51:22 BasicIcfg [2022-03-15 17:51:22,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:51:22,940 INFO L158 Benchmark]: Toolchain (without parser) took 15982.14ms. Allocated memory was 188.7MB in the beginning and 456.1MB in the end (delta: 267.4MB). Free memory was 131.9MB in the beginning and 319.6MB in the end (delta: -187.7MB). Peak memory consumption was 79.3MB. Max. memory is 8.0GB. [2022-03-15 17:51:22,940 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:51:22,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.76ms. Allocated memory was 188.7MB in the beginning and 288.4MB in the end (delta: 99.6MB). Free memory was 131.8MB in the beginning and 245.0MB in the end (delta: -113.2MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2022-03-15 17:51:22,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.68ms. Allocated memory is still 288.4MB. Free memory was 245.0MB in the beginning and 241.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 17:51:22,941 INFO L158 Benchmark]: Boogie Preprocessor took 49.14ms. Allocated memory is still 288.4MB. Free memory was 241.8MB in the beginning and 239.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 17:51:22,941 INFO L158 Benchmark]: RCFGBuilder took 832.26ms. Allocated memory is still 288.4MB. Free memory was 239.4MB in the beginning and 185.9MB in the end (delta: 53.5MB). Peak memory consumption was 54.1MB. Max. memory is 8.0GB. [2022-03-15 17:51:22,941 INFO L158 Benchmark]: TraceAbstraction took 14496.96ms. Allocated memory was 288.4MB in the beginning and 456.1MB in the end (delta: 167.8MB). Free memory was 185.4MB in the beginning and 319.6MB in the end (delta: -134.2MB). Peak memory consumption was 34.1MB. Max. memory is 8.0GB. [2022-03-15 17:51:22,942 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 188.7MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 529.76ms. Allocated memory was 188.7MB in the beginning and 288.4MB in the end (delta: 99.6MB). Free memory was 131.8MB in the beginning and 245.0MB in the end (delta: -113.2MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.68ms. Allocated memory is still 288.4MB. Free memory was 245.0MB in the beginning and 241.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.14ms. Allocated memory is still 288.4MB. Free memory was 241.8MB in the beginning and 239.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 832.26ms. Allocated memory is still 288.4MB. Free memory was 239.4MB in the beginning and 185.9MB in the end (delta: 53.5MB). Peak memory consumption was 54.1MB. Max. memory is 8.0GB. * TraceAbstraction took 14496.96ms. Allocated memory was 288.4MB in the beginning and 456.1MB in the end (delta: 167.8MB). Free memory was 185.4MB in the beginning and 319.6MB in the end (delta: -134.2MB). Peak memory consumption was 34.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.5s, 101 PlacesBefore, 27 PlacesAfterwards, 96 TransitionsBefore, 21 TransitionsAfterwards, 1216 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 89 TotalNumberOfCompositions, 3303 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1206, positive: 1070, positive conditional: 0, positive unconditional: 1070, negative: 136, negative conditional: 0, negative unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 676, positive: 650, positive conditional: 0, positive unconditional: 650, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1206, positive: 420, positive conditional: 0, positive unconditional: 420, negative: 110, negative conditional: 0, negative unconditional: 110, unknown: 676, unknown conditional: 0, unknown unconditional: 676] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 29, Positive conditional cache size: 0, Positive unconditional cache size: 29, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t597; [L811] FCALL, FORK 0 pthread_create(&t597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t597, ((void *)0), P0, ((void *)0))=-1, t597={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 0 pthread_t t598; [L813] FCALL, FORK 0 pthread_create(&t598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t598, ((void *)0), P1, ((void *)0))=0, t597={5:0}, t598={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 x$flush_delayed = weak$$choice2 [L772] 2 x$mem_tmp = x [L773] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 [L773] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L773] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L774] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L774] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L775] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L775] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L776] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L776] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L778] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L779] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = x [L781] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L781] 2 x = x$flush_delayed ? x$mem_tmp : x [L782] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L819] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L819] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L819] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L821] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L823] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L826] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 x$flush_delayed = weak$$choice2 [L829] 0 x$mem_tmp = x [L830] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L830] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L831] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L831] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L831] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L832] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L833] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L833] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L833] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L833] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L834] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L834] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L835] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L835] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L835] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L836] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L838] 0 x = x$flush_delayed ? x$mem_tmp : x [L839] 0 x$flush_delayed = (_Bool)0 [L841] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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: 813]: 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: 811]: 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 5 procedures, 115 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.6s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 21 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 462 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:22,967 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...