/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-820ea7a [2022-02-18 13:34:50,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-18 13:34:50,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-18 13:34:50,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-18 13:34:50,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-18 13:34:50,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-18 13:34:50,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-18 13:34:50,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-18 13:34:50,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-18 13:34:50,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-18 13:34:50,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-18 13:34:50,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-18 13:34:50,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-18 13:34:50,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-18 13:34:50,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-18 13:34:50,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-18 13:34:50,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-18 13:34:50,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-18 13:34:50,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-18 13:34:50,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-18 13:34:50,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-18 13:34:50,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-18 13:34:50,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-18 13:34:50,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-18 13:34:50,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-18 13:34:50,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-18 13:34:50,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-18 13:34:50,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-18 13:34:50,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-18 13:34:50,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-18 13:34:50,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-18 13:34:50,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-18 13:34:50,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-18 13:34:50,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-18 13:34:50,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-18 13:34:50,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-18 13:34:50,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-18 13:34:50,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-18 13:34:50,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-18 13:34:50,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-18 13:34:50,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-18 13:34:50,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-02-18 13:34:50,664 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-18 13:34:50,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-18 13:34:50,665 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-18 13:34:50,665 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-18 13:34:50,666 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-18 13:34:50,666 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-18 13:34:50,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-18 13:34:50,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-18 13:34:50,666 INFO L138 SettingsManager]: * Use SBE=true [2022-02-18 13:34:50,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-18 13:34:50,667 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-18 13:34:50,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-18 13:34:50,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-18 13:34:50,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-18 13:34:50,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-18 13:34:50,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-18 13:34:50,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-18 13:34:50,668 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-18 13:34:50,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-18 13:34:50,668 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-18 13:34:50,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-18 13:34:50,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-18 13:34:50,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-18 13:34:50,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-18 13:34:50,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-18 13:34:50,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-18 13:34:50,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-18 13:34:50,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-18 13:34:50,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-18 13:34:50,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-18 13:34:50,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-18 13:34:50,669 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-18 13:34:50,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-18 13:34:50,669 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-02-18 13:34:50,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-18 13:34:50,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-18 13:34:50,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-18 13:34:50,894 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-18 13:34:50,896 INFO L275 PluginConnector]: CDTParser initialized [2022-02-18 13:34:50,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-02-18 13:34:50,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8da9ef2/6b8ac4e53b814199adb74a11901507f6/FLAG15c3f2ba3 [2022-02-18 13:34:51,365 INFO L306 CDTParser]: Found 1 translation units. [2022-02-18 13:34:51,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-02-18 13:34:51,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8da9ef2/6b8ac4e53b814199adb74a11901507f6/FLAG15c3f2ba3 [2022-02-18 13:34:51,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8da9ef2/6b8ac4e53b814199adb74a11901507f6 [2022-02-18 13:34:51,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-18 13:34:51,395 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-18 13:34:51,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-18 13:34:51,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-18 13:34:51,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-18 13:34:51,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:34:51" (1/1) ... [2022-02-18 13:34:51,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee13203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:51, skipping insertion in model container [2022-02-18 13:34:51,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 01:34:51" (1/1) ... [2022-02-18 13:34:51,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-18 13:34:51,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-18 13:34:51,611 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-02-18 13:34:51,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-18 13:34:51,715 INFO L203 MainTranslator]: Completed pre-run [2022-02-18 13:34:51,723 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/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-02-18 13:34:51,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-18 13:34:51,800 INFO L208 MainTranslator]: Completed translation [2022-02-18 13:34:51,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:51 WrapperNode [2022-02-18 13:34:51,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-18 13:34:51,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-18 13:34:51,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-18 13:34:51,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-18 13:34:51,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:51" (1/1) ... [2022-02-18 13:34:51,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:51" (1/1) ... [2022-02-18 13:34:51,864 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 282 [2022-02-18 13:34:51,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-18 13:34:51,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-18 13:34:51,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-18 13:34:51,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-18 13:34:51,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:51" (1/1) ... [2022-02-18 13:34:51,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:51" (1/1) ... [2022-02-18 13:34:51,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:51" (1/1) ... [2022-02-18 13:34:51,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:51" (1/1) ... [2022-02-18 13:34:51,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:51" (1/1) ... [2022-02-18 13:34:51,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:51" (1/1) ... [2022-02-18 13:34:51,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:51" (1/1) ... [2022-02-18 13:34:51,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-18 13:34:51,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-18 13:34:51,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-18 13:34:51,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-18 13:34:51,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:51" (1/1) ... [2022-02-18 13:34:51,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-18 13:34:51,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-18 13:34:51,927 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-02-18 13:34:51,940 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-02-18 13:34:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-18 13:34:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-18 13:34:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-18 13:34:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-18 13:34:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-18 13:34:51,968 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-02-18 13:34:51,968 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-02-18 13:34:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-02-18 13:34:51,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-02-18 13:34:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-02-18 13:34:51,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-02-18 13:34:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-18 13:34:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-18 13:34:51,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-18 13:34:51,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-18 13:34:51,972 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-18 13:34:52,112 INFO L234 CfgBuilder]: Building ICFG [2022-02-18 13:34:52,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-18 13:34:52,501 INFO L275 CfgBuilder]: Performing block encoding [2022-02-18 13:34:52,701 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-18 13:34:52,701 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-18 13:34:52,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:34:52 BoogieIcfgContainer [2022-02-18 13:34:52,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-18 13:34:52,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-18 13:34:52,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-18 13:34:52,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-18 13:34:52,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 01:34:51" (1/3) ... [2022-02-18 13:34:52,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ae859a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:34:52, skipping insertion in model container [2022-02-18 13:34:52,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 01:34:51" (2/3) ... [2022-02-18 13:34:52,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ae859a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 01:34:52, skipping insertion in model container [2022-02-18 13:34:52,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 01:34:52" (3/3) ... [2022-02-18 13:34:52,709 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-02-18 13:34:52,713 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-18 13:34:52,713 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-18 13:34:52,713 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-18 13:34:52,713 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-18 13:34:52,756 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,756 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,757 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,757 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,757 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,757 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,757 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,757 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,758 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,758 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,758 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,758 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,759 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,759 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,759 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,759 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,759 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,760 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,760 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,760 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,760 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,760 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,761 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,761 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,761 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,761 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,762 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,762 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,763 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,763 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,763 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,763 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,763 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,763 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,765 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,765 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,766 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,766 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,766 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,766 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,766 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,766 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,766 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,767 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,767 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,767 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,767 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,767 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,768 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,768 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,768 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,768 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,768 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,768 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,769 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,769 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,769 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,769 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,769 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,769 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,769 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,770 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,770 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,770 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,770 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,770 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,770 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,770 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,771 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,771 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,771 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,772 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,776 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,776 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,776 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,776 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,776 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,777 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,777 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,777 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,777 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,777 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,779 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,779 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,779 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,779 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,779 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,780 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,780 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,782 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,785 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,786 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,786 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,786 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,786 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-18 13:34:52,786 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-18 13:34:52,830 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-18 13:34:52,838 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-02-18 13:34:52,838 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-18 13:34:52,849 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 125 places, 117 transitions, 249 flow [2022-02-18 13:34:53,379 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14373 states, 14370 states have (on average 3.5778705636743213) internal successors, (51414), 14372 states have internal predecessors, (51414), 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-02-18 13:34:53,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 14373 states, 14370 states have (on average 3.5778705636743213) internal successors, (51414), 14372 states have internal predecessors, (51414), 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-02-18 13:34:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-18 13:34:53,431 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:34:53,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:34:53,432 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:34:53,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:34:53,438 INFO L85 PathProgramCache]: Analyzing trace with hash -746549581, now seen corresponding path program 1 times [2022-02-18 13:34:53,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:34:53,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752317928] [2022-02-18 13:34:53,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:34:53,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:34:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 13:34:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 13:34:53,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 13:34:53,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752317928] [2022-02-18 13:34:53,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752317928] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 13:34:53,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 13:34:53,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-18 13:34:53,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647289459] [2022-02-18 13:34:53,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 13:34:53,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-18 13:34:53,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 13:34:53,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-18 13:34:53,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-18 13:34:53,792 INFO L87 Difference]: Start difference. First operand has 14373 states, 14370 states have (on average 3.5778705636743213) internal successors, (51414), 14372 states have internal predecessors, (51414), 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 30.0) internal successors, (60), 3 states have internal predecessors, (60), 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-02-18 13:34:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 13:34:54,001 INFO L93 Difference]: Finished difference Result 12469 states and 43636 transitions. [2022-02-18 13:34:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-18 13:34:54,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2022-02-18 13:34:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 13:34:54,080 INFO L225 Difference]: With dead ends: 12469 [2022-02-18 13:34:54,081 INFO L226 Difference]: Without dead ends: 10565 [2022-02-18 13:34:54,082 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-02-18 13:34:54,084 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 40 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-18 13:34:54,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 165 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-18 13:34:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10565 states. [2022-02-18 13:34:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10565 to 10565. [2022-02-18 13:34:54,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10565 states, 10564 states have (on average 3.5268837561529724) internal successors, (37258), 10564 states have internal predecessors, (37258), 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-02-18 13:34:54,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10565 states to 10565 states and 37258 transitions. [2022-02-18 13:34:54,668 INFO L78 Accepts]: Start accepts. Automaton has 10565 states and 37258 transitions. Word has length 60 [2022-02-18 13:34:54,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 13:34:54,670 INFO L470 AbstractCegarLoop]: Abstraction has 10565 states and 37258 transitions. [2022-02-18 13:34:54,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 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-02-18 13:34:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 10565 states and 37258 transitions. [2022-02-18 13:34:54,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-18 13:34:54,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:34:54,689 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:34:54,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-18 13:34:54,690 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:34:54,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:34:54,693 INFO L85 PathProgramCache]: Analyzing trace with hash -849196144, now seen corresponding path program 1 times [2022-02-18 13:34:54,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:34:54,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820987648] [2022-02-18 13:34:54,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:34:54,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:34:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 13:34:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 13:34:54,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 13:34:54,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820987648] [2022-02-18 13:34:54,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820987648] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 13:34:54,970 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 13:34:54,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-18 13:34:54,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555786727] [2022-02-18 13:34:54,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 13:34:54,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-18 13:34:54,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 13:34:54,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-18 13:34:54,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-18 13:34:54,977 INFO L87 Difference]: Start difference. First operand 10565 states and 37258 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-02-18 13:34:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 13:34:55,349 INFO L93 Difference]: Finished difference Result 11797 states and 41240 transitions. [2022-02-18 13:34:55,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-18 13:34:55,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 75 [2022-02-18 13:34:55,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 13:34:55,461 INFO L225 Difference]: With dead ends: 11797 [2022-02-18 13:34:55,461 INFO L226 Difference]: Without dead ends: 8997 [2022-02-18 13:34:55,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-18 13:34:55,463 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 134 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 13:34:55,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 550 Invalid, 76 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 13:34:55,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8997 states. [2022-02-18 13:34:55,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8997 to 8997. [2022-02-18 13:34:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8997 states, 8996 states have (on average 3.4911071587372167) internal successors, (31406), 8996 states have internal predecessors, (31406), 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-02-18 13:34:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8997 states to 8997 states and 31406 transitions. [2022-02-18 13:34:55,754 INFO L78 Accepts]: Start accepts. Automaton has 8997 states and 31406 transitions. Word has length 75 [2022-02-18 13:34:55,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 13:34:55,757 INFO L470 AbstractCegarLoop]: Abstraction has 8997 states and 31406 transitions. [2022-02-18 13:34:55,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-02-18 13:34:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 8997 states and 31406 transitions. [2022-02-18 13:34:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-18 13:34:55,773 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:34:55,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:34:55,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-18 13:34:55,773 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:34:55,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:34:55,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1898082547, now seen corresponding path program 1 times [2022-02-18 13:34:55,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:34:55,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612545386] [2022-02-18 13:34:55,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:34:55,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:34:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 13:34:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 13:34:56,068 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 13:34:56,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612545386] [2022-02-18 13:34:56,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612545386] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 13:34:56,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 13:34:56,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-18 13:34:56,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448280702] [2022-02-18 13:34:56,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 13:34:56,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 13:34:56,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 13:34:56,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 13:34:56,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-18 13:34:56,070 INFO L87 Difference]: Start difference. First operand 8997 states and 31406 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 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-02-18 13:34:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 13:34:56,476 INFO L93 Difference]: Finished difference Result 10383 states and 35968 transitions. [2022-02-18 13:34:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-18 13:34:56,477 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 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 79 [2022-02-18 13:34:56,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 13:34:56,552 INFO L225 Difference]: With dead ends: 10383 [2022-02-18 13:34:56,552 INFO L226 Difference]: Without dead ends: 8703 [2022-02-18 13:34:56,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-02-18 13:34:56,558 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 309 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 13:34:56,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 819 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 13:34:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8703 states. [2022-02-18 13:34:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8703 to 8703. [2022-02-18 13:34:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8703 states, 8702 states have (on average 3.478740519420823) internal successors, (30272), 8702 states have internal predecessors, (30272), 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-02-18 13:34:57,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8703 states to 8703 states and 30272 transitions. [2022-02-18 13:34:57,173 INFO L78 Accepts]: Start accepts. Automaton has 8703 states and 30272 transitions. Word has length 79 [2022-02-18 13:34:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 13:34:57,188 INFO L470 AbstractCegarLoop]: Abstraction has 8703 states and 30272 transitions. [2022-02-18 13:34:57,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 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-02-18 13:34:57,188 INFO L276 IsEmpty]: Start isEmpty. Operand 8703 states and 30272 transitions. [2022-02-18 13:34:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-18 13:34:57,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:34:57,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:34:57,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-18 13:34:57,221 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:34:57,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:34:57,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1179246028, now seen corresponding path program 1 times [2022-02-18 13:34:57,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:34:57,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396686274] [2022-02-18 13:34:57,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:34:57,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:34:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 13:34:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 13:34:57,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 13:34:57,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396686274] [2022-02-18 13:34:57,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396686274] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 13:34:57,433 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 13:34:57,433 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-18 13:34:57,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679552860] [2022-02-18 13:34:57,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 13:34:57,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-18 13:34:57,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 13:34:57,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-18 13:34:57,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-18 13:34:57,436 INFO L87 Difference]: Start difference. First operand 8703 states and 30272 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-02-18 13:34:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 13:34:57,596 INFO L93 Difference]: Finished difference Result 9655 states and 33342 transitions. [2022-02-18 13:34:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-18 13:34:57,597 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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 81 [2022-02-18 13:34:57,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 13:34:57,624 INFO L225 Difference]: With dead ends: 9655 [2022-02-18 13:34:57,625 INFO L226 Difference]: Without dead ends: 8535 [2022-02-18 13:34:57,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-18 13:34:57,628 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 91 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 13:34:57,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 535 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 13:34:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8535 states. [2022-02-18 13:34:57,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8535 to 8535. [2022-02-18 13:34:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8535 states, 8534 states have (on average 3.47340051558472) internal successors, (29642), 8534 states have internal predecessors, (29642), 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-02-18 13:34:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8535 states to 8535 states and 29642 transitions. [2022-02-18 13:34:57,944 INFO L78 Accepts]: Start accepts. Automaton has 8535 states and 29642 transitions. Word has length 81 [2022-02-18 13:34:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 13:34:57,945 INFO L470 AbstractCegarLoop]: Abstraction has 8535 states and 29642 transitions. [2022-02-18 13:34:57,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-02-18 13:34:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 8535 states and 29642 transitions. [2022-02-18 13:34:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-18 13:34:57,968 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:34:57,968 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:34:57,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-18 13:34:57,968 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:34:57,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:34:57,969 INFO L85 PathProgramCache]: Analyzing trace with hash 962685753, now seen corresponding path program 1 times [2022-02-18 13:34:57,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:34:57,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501560299] [2022-02-18 13:34:57,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:34:57,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:34:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 13:34:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 13:34:58,142 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 13:34:58,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501560299] [2022-02-18 13:34:58,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501560299] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 13:34:58,142 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 13:34:58,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-18 13:34:58,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804761686] [2022-02-18 13:34:58,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 13:34:58,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-18 13:34:58,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 13:34:58,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-18 13:34:58,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-18 13:34:58,144 INFO L87 Difference]: Start difference. First operand 8535 states and 29642 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-02-18 13:34:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 13:34:58,522 INFO L93 Difference]: Finished difference Result 9907 states and 34311 transitions. [2022-02-18 13:34:58,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-18 13:34:58,523 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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 82 [2022-02-18 13:34:58,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 13:34:58,553 INFO L225 Difference]: With dead ends: 9907 [2022-02-18 13:34:58,554 INFO L226 Difference]: Without dead ends: 8857 [2022-02-18 13:34:58,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2022-02-18 13:34:58,554 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 210 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-18 13:34:58,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 912 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-18 13:34:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8857 states. [2022-02-18 13:34:58,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8857 to 8857. [2022-02-18 13:34:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8857 states, 8856 states have (on average 3.4826106594399278) internal successors, (30842), 8856 states have internal predecessors, (30842), 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-02-18 13:34:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8857 states to 8857 states and 30842 transitions. [2022-02-18 13:34:58,903 INFO L78 Accepts]: Start accepts. Automaton has 8857 states and 30842 transitions. Word has length 82 [2022-02-18 13:34:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 13:34:58,903 INFO L470 AbstractCegarLoop]: Abstraction has 8857 states and 30842 transitions. [2022-02-18 13:34:58,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-02-18 13:34:58,904 INFO L276 IsEmpty]: Start isEmpty. Operand 8857 states and 30842 transitions. [2022-02-18 13:34:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-18 13:34:58,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:34:58,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:34:58,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-18 13:34:58,920 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:34:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:34:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1784260779, now seen corresponding path program 2 times [2022-02-18 13:34:58,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:34:58,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868493126] [2022-02-18 13:34:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:34:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:34:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 13:34:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 13:34:59,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 13:34:59,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868493126] [2022-02-18 13:34:59,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868493126] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 13:34:59,089 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 13:34:59,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-18 13:34:59,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78871681] [2022-02-18 13:34:59,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 13:34:59,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-18 13:34:59,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 13:34:59,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-18 13:34:59,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-18 13:34:59,090 INFO L87 Difference]: Start difference. First operand 8857 states and 30842 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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-02-18 13:34:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 13:34:59,315 INFO L93 Difference]: Finished difference Result 9963 states and 34471 transitions. [2022-02-18 13:34:59,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-18 13:34:59,316 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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 82 [2022-02-18 13:34:59,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 13:34:59,348 INFO L225 Difference]: With dead ends: 9963 [2022-02-18 13:34:59,349 INFO L226 Difference]: Without dead ends: 8913 [2022-02-18 13:34:59,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-02-18 13:34:59,349 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 228 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 13:34:59,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 1186 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 13:34:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8913 states. [2022-02-18 13:34:59,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8913 to 8843. [2022-02-18 13:34:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8843 states, 8842 states have (on average 3.4836009952499434) internal successors, (30802), 8842 states have internal predecessors, (30802), 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-02-18 13:34:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8843 states to 8843 states and 30802 transitions. [2022-02-18 13:34:59,683 INFO L78 Accepts]: Start accepts. Automaton has 8843 states and 30802 transitions. Word has length 82 [2022-02-18 13:34:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 13:34:59,684 INFO L470 AbstractCegarLoop]: Abstraction has 8843 states and 30802 transitions. [2022-02-18 13:34:59,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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-02-18 13:34:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8843 states and 30802 transitions. [2022-02-18 13:34:59,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-18 13:34:59,701 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:34:59,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:34:59,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-18 13:34:59,702 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:34:59,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:34:59,702 INFO L85 PathProgramCache]: Analyzing trace with hash 251053947, now seen corresponding path program 3 times [2022-02-18 13:34:59,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:34:59,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341276118] [2022-02-18 13:34:59,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:34:59,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:34:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 13:35:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 13:35:00,002 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 13:35:00,002 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341276118] [2022-02-18 13:35:00,002 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341276118] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 13:35:00,002 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 13:35:00,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-18 13:35:00,003 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507267239] [2022-02-18 13:35:00,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 13:35:00,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-18 13:35:00,003 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 13:35:00,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-18 13:35:00,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-02-18 13:35:00,079 INFO L87 Difference]: Start difference. First operand 8843 states and 30802 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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-02-18 13:35:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 13:35:00,371 INFO L93 Difference]: Finished difference Result 10439 states and 36160 transitions. [2022-02-18 13:35:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-18 13:35:00,372 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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 82 [2022-02-18 13:35:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 13:35:00,402 INFO L225 Difference]: With dead ends: 10439 [2022-02-18 13:35:00,403 INFO L226 Difference]: Without dead ends: 9249 [2022-02-18 13:35:00,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-02-18 13:35:00,404 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 273 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 13:35:00,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 941 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 13:35:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9249 states. [2022-02-18 13:35:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9249 to 8745. [2022-02-18 13:35:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8745 states, 8744 states have (on average 3.470608417200366) internal successors, (30347), 8744 states have internal predecessors, (30347), 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-02-18 13:35:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8745 states to 8745 states and 30347 transitions. [2022-02-18 13:35:00,627 INFO L78 Accepts]: Start accepts. Automaton has 8745 states and 30347 transitions. Word has length 82 [2022-02-18 13:35:00,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 13:35:00,627 INFO L470 AbstractCegarLoop]: Abstraction has 8745 states and 30347 transitions. [2022-02-18 13:35:00,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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-02-18 13:35:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 8745 states and 30347 transitions. [2022-02-18 13:35:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-18 13:35:00,729 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:35:00,729 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:35:00,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-18 13:35:00,729 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:35:00,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:35:00,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2106343729, now seen corresponding path program 1 times [2022-02-18 13:35:00,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:35:00,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41122112] [2022-02-18 13:35:00,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:35:00,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:35:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 13:35:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 13:35:00,962 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 13:35:00,962 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41122112] [2022-02-18 13:35:00,963 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41122112] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 13:35:00,963 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 13:35:00,963 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-18 13:35:00,963 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507729852] [2022-02-18 13:35:00,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 13:35:00,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-18 13:35:00,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 13:35:00,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-18 13:35:00,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-02-18 13:35:00,964 INFO L87 Difference]: Start difference. First operand 8745 states and 30347 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 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-02-18 13:35:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 13:35:01,282 INFO L93 Difference]: Finished difference Result 11139 states and 38657 transitions. [2022-02-18 13:35:01,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-18 13:35:01,283 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 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 83 [2022-02-18 13:35:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 13:35:01,317 INFO L225 Difference]: With dead ends: 11139 [2022-02-18 13:35:01,317 INFO L226 Difference]: Without dead ends: 10299 [2022-02-18 13:35:01,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-02-18 13:35:01,318 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 325 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 13:35:01,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 1006 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 13:35:01,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10299 states. [2022-02-18 13:35:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10299 to 10285. [2022-02-18 13:35:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10285 states, 10284 states have (on average 3.484928043562816) internal successors, (35839), 10284 states have internal predecessors, (35839), 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-02-18 13:35:01,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10285 states to 10285 states and 35839 transitions. [2022-02-18 13:35:01,716 INFO L78 Accepts]: Start accepts. Automaton has 10285 states and 35839 transitions. Word has length 83 [2022-02-18 13:35:01,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 13:35:01,717 INFO L470 AbstractCegarLoop]: Abstraction has 10285 states and 35839 transitions. [2022-02-18 13:35:01,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 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-02-18 13:35:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 10285 states and 35839 transitions. [2022-02-18 13:35:01,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-18 13:35:01,737 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:35:01,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:35:01,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-18 13:35:01,737 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:35:01,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:35:01,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2034504851, now seen corresponding path program 1 times [2022-02-18 13:35:01,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:35:01,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819509540] [2022-02-18 13:35:01,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:35:01,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:35:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 13:35:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 13:35:01,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 13:35:01,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819509540] [2022-02-18 13:35:01,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819509540] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 13:35:01,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 13:35:01,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-18 13:35:01,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906424310] [2022-02-18 13:35:01,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 13:35:01,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-18 13:35:01,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 13:35:01,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-18 13:35:01,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-18 13:35:01,825 INFO L87 Difference]: Start difference. First operand 10285 states and 35839 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-02-18 13:35:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 13:35:02,047 INFO L93 Difference]: Finished difference Result 12363 states and 42274 transitions. [2022-02-18 13:35:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-18 13:35:02,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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 83 [2022-02-18 13:35:02,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 13:35:02,075 INFO L225 Difference]: With dead ends: 12363 [2022-02-18 13:35:02,075 INFO L226 Difference]: Without dead ends: 8723 [2022-02-18 13:35:02,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-18 13:35:02,076 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 185 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 13:35:02,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 421 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 13:35:02,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8723 states. [2022-02-18 13:35:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8723 to 8723. [2022-02-18 13:35:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8723 states, 8722 states have (on average 3.392685163953222) internal successors, (29591), 8722 states have internal predecessors, (29591), 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-02-18 13:35:02,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8723 states to 8723 states and 29591 transitions. [2022-02-18 13:35:02,275 INFO L78 Accepts]: Start accepts. Automaton has 8723 states and 29591 transitions. Word has length 83 [2022-02-18 13:35:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 13:35:02,275 INFO L470 AbstractCegarLoop]: Abstraction has 8723 states and 29591 transitions. [2022-02-18 13:35:02,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-02-18 13:35:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 8723 states and 29591 transitions. [2022-02-18 13:35:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-18 13:35:02,293 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:35:02,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:35:02,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-18 13:35:02,293 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:35:02,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:35:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1014671792, now seen corresponding path program 1 times [2022-02-18 13:35:02,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:35:02,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576814509] [2022-02-18 13:35:02,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:35:02,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:35:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 13:35:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 13:35:02,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 13:35:02,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576814509] [2022-02-18 13:35:02,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576814509] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 13:35:02,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 13:35:02,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-18 13:35:02,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773629505] [2022-02-18 13:35:02,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 13:35:02,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-18 13:35:02,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 13:35:02,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-18 13:35:02,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-18 13:35:02,485 INFO L87 Difference]: Start difference. First operand 8723 states and 29591 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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-02-18 13:35:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 13:35:02,653 INFO L93 Difference]: Finished difference Result 8102 states and 26693 transitions. [2022-02-18 13:35:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-18 13:35:02,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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 84 [2022-02-18 13:35:02,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 13:35:02,665 INFO L225 Difference]: With dead ends: 8102 [2022-02-18 13:35:02,666 INFO L226 Difference]: Without dead ends: 5342 [2022-02-18 13:35:02,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-02-18 13:35:02,666 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 317 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 13:35:02,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 495 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 13:35:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5342 states. [2022-02-18 13:35:02,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5342 to 5342. [2022-02-18 13:35:02,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5342 states, 5341 states have (on average 3.219247331960307) internal successors, (17194), 5341 states have internal predecessors, (17194), 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-02-18 13:35:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5342 states to 5342 states and 17194 transitions. [2022-02-18 13:35:02,755 INFO L78 Accepts]: Start accepts. Automaton has 5342 states and 17194 transitions. Word has length 84 [2022-02-18 13:35:02,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 13:35:02,756 INFO L470 AbstractCegarLoop]: Abstraction has 5342 states and 17194 transitions. [2022-02-18 13:35:02,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 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-02-18 13:35:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 5342 states and 17194 transitions. [2022-02-18 13:35:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-18 13:35:02,764 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:35:02,764 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:35:02,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-18 13:35:02,764 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:35:02,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:35:02,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1817214867, now seen corresponding path program 1 times [2022-02-18 13:35:02,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:35:02,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116876593] [2022-02-18 13:35:02,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:35:02,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:35:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 13:35:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 13:35:02,827 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 13:35:02,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116876593] [2022-02-18 13:35:02,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116876593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 13:35:02,827 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 13:35:02,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-18 13:35:02,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214241589] [2022-02-18 13:35:02,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 13:35:02,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-18 13:35:02,827 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 13:35:02,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-18 13:35:02,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-18 13:35:02,828 INFO L87 Difference]: Start difference. First operand 5342 states and 17194 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-02-18 13:35:02,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 13:35:02,986 INFO L93 Difference]: Finished difference Result 8822 states and 28185 transitions. [2022-02-18 13:35:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-18 13:35:02,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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 86 [2022-02-18 13:35:02,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 13:35:03,000 INFO L225 Difference]: With dead ends: 8822 [2022-02-18 13:35:03,001 INFO L226 Difference]: Without dead ends: 5468 [2022-02-18 13:35:03,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-18 13:35:03,001 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 92 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 13:35:03,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 695 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 13:35:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2022-02-18 13:35:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5000. [2022-02-18 13:35:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5000 states, 4999 states have (on average 3.147229445889178) internal successors, (15733), 4999 states have internal predecessors, (15733), 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-02-18 13:35:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5000 states to 5000 states and 15733 transitions. [2022-02-18 13:35:03,103 INFO L78 Accepts]: Start accepts. Automaton has 5000 states and 15733 transitions. Word has length 86 [2022-02-18 13:35:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 13:35:03,103 INFO L470 AbstractCegarLoop]: Abstraction has 5000 states and 15733 transitions. [2022-02-18 13:35:03,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-02-18 13:35:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5000 states and 15733 transitions. [2022-02-18 13:35:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-18 13:35:03,111 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:35:03,111 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:35:03,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-18 13:35:03,112 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:35:03,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:35:03,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1604700152, now seen corresponding path program 1 times [2022-02-18 13:35:03,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:35:03,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521925101] [2022-02-18 13:35:03,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:35:03,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:35:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 13:35:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 13:35:03,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 13:35:03,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521925101] [2022-02-18 13:35:03,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521925101] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 13:35:03,296 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 13:35:03,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-18 13:35:03,296 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782304615] [2022-02-18 13:35:03,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 13:35:03,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-18 13:35:03,296 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 13:35:03,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-18 13:35:03,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-18 13:35:03,297 INFO L87 Difference]: Start difference. First operand 5000 states and 15733 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-02-18 13:35:03,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 13:35:03,445 INFO L93 Difference]: Finished difference Result 3938 states and 12148 transitions. [2022-02-18 13:35:03,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-18 13:35:03,446 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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 87 [2022-02-18 13:35:03,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 13:35:03,450 INFO L225 Difference]: With dead ends: 3938 [2022-02-18 13:35:03,450 INFO L226 Difference]: Without dead ends: 2192 [2022-02-18 13:35:03,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-02-18 13:35:03,451 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 319 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 13:35:03,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 464 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 13:35:03,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2022-02-18 13:35:03,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1904. [2022-02-18 13:35:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1904 states, 1903 states have (on average 2.973725696269049) internal successors, (5659), 1903 states have internal predecessors, (5659), 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-02-18 13:35:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 5659 transitions. [2022-02-18 13:35:03,477 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 5659 transitions. Word has length 87 [2022-02-18 13:35:03,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 13:35:03,477 INFO L470 AbstractCegarLoop]: Abstraction has 1904 states and 5659 transitions. [2022-02-18 13:35:03,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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-02-18 13:35:03,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 5659 transitions. [2022-02-18 13:35:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-18 13:35:03,481 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:35:03,481 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:35:03,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-18 13:35:03,481 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:35:03,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:35:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2139128182, now seen corresponding path program 1 times [2022-02-18 13:35:03,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:35:03,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364751985] [2022-02-18 13:35:03,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:35:03,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:35:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 13:35:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 13:35:03,643 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 13:35:03,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364751985] [2022-02-18 13:35:03,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364751985] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 13:35:03,644 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 13:35:03,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-18 13:35:03,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504689476] [2022-02-18 13:35:03,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 13:35:03,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-18 13:35:03,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 13:35:03,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-18 13:35:03,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-18 13:35:03,645 INFO L87 Difference]: Start difference. First operand 1904 states and 5659 transitions. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 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-02-18 13:35:03,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 13:35:03,845 INFO L93 Difference]: Finished difference Result 2765 states and 8285 transitions. [2022-02-18 13:35:03,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-18 13:35:03,845 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 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 91 [2022-02-18 13:35:03,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 13:35:03,848 INFO L225 Difference]: With dead ends: 2765 [2022-02-18 13:35:03,848 INFO L226 Difference]: Without dead ends: 1121 [2022-02-18 13:35:03,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-02-18 13:35:03,849 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 246 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 13:35:03,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 991 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 13:35:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2022-02-18 13:35:03,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2022-02-18 13:35:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 2.899107142857143) internal successors, (3247), 1120 states have internal predecessors, (3247), 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-02-18 13:35:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 3247 transitions. [2022-02-18 13:35:03,864 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 3247 transitions. Word has length 91 [2022-02-18 13:35:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 13:35:03,864 INFO L470 AbstractCegarLoop]: Abstraction has 1121 states and 3247 transitions. [2022-02-18 13:35:03,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 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-02-18 13:35:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 3247 transitions. [2022-02-18 13:35:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-18 13:35:03,866 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:35:03,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:35:03,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-18 13:35:03,866 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:35:03,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:35:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1021435322, now seen corresponding path program 2 times [2022-02-18 13:35:03,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:35:03,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449500690] [2022-02-18 13:35:03,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:35:03,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:35:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-18 13:35:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-18 13:35:04,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-18 13:35:04,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449500690] [2022-02-18 13:35:04,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449500690] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-18 13:35:04,120 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-18 13:35:04,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-18 13:35:04,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533282549] [2022-02-18 13:35:04,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-18 13:35:04,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-18 13:35:04,120 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-18 13:35:04,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-18 13:35:04,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-18 13:35:04,121 INFO L87 Difference]: Start difference. First operand 1121 states and 3247 transitions. Second operand has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 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-02-18 13:35:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-18 13:35:04,272 INFO L93 Difference]: Finished difference Result 1712 states and 5012 transitions. [2022-02-18 13:35:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-18 13:35:04,273 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 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 91 [2022-02-18 13:35:04,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-18 13:35:04,274 INFO L225 Difference]: With dead ends: 1712 [2022-02-18 13:35:04,274 INFO L226 Difference]: Without dead ends: 905 [2022-02-18 13:35:04,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-02-18 13:35:04,275 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 263 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-18 13:35:04,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 778 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-18 13:35:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2022-02-18 13:35:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 905. [2022-02-18 13:35:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 904 states have (on average 2.795353982300885) internal successors, (2527), 904 states have internal predecessors, (2527), 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-02-18 13:35:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 2527 transitions. [2022-02-18 13:35:04,287 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 2527 transitions. Word has length 91 [2022-02-18 13:35:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-18 13:35:04,287 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 2527 transitions. [2022-02-18 13:35:04,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 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-02-18 13:35:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 2527 transitions. [2022-02-18 13:35:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-18 13:35:04,288 INFO L506 BasicCegarLoop]: Found error trace [2022-02-18 13:35:04,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:35:04,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-18 13:35:04,288 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-18 13:35:04,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-18 13:35:04,289 INFO L85 PathProgramCache]: Analyzing trace with hash -418677318, now seen corresponding path program 3 times [2022-02-18 13:35:04,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-18 13:35:04,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852382494] [2022-02-18 13:35:04,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-18 13:35:04,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-18 13:35:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-18 13:35:04,321 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-18 13:35:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-18 13:35:04,426 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-18 13:35:04,426 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-18 13:35:04,427 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-02-18 13:35:04,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-02-18 13:35:04,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-02-18 13:35:04,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-02-18 13:35:04,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-02-18 13:35:04,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-02-18 13:35:04,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-18 13:35:04,431 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-18 13:35:04,435 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-18 13:35:04,435 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-18 13:35:04,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 01:35:04 BasicIcfg [2022-02-18 13:35:04,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-18 13:35:04,533 INFO L158 Benchmark]: Toolchain (without parser) took 13138.09ms. Allocated memory was 197.1MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 140.4MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 704.2MB. Max. memory is 8.0GB. [2022-02-18 13:35:04,533 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 158.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-18 13:35:04,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.03ms. Allocated memory is still 197.1MB. Free memory was 140.2MB in the beginning and 156.2MB in the end (delta: -16.0MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2022-02-18 13:35:04,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.92ms. Allocated memory is still 197.1MB. Free memory was 156.2MB in the beginning and 153.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-18 13:35:04,533 INFO L158 Benchmark]: Boogie Preprocessor took 21.81ms. Allocated memory is still 197.1MB. Free memory was 153.3MB in the beginning and 151.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-18 13:35:04,534 INFO L158 Benchmark]: RCFGBuilder took 815.59ms. Allocated memory was 197.1MB in the beginning and 256.9MB in the end (delta: 59.8MB). Free memory was 151.3MB in the beginning and 202.7MB in the end (delta: -51.4MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB. [2022-02-18 13:35:04,534 INFO L158 Benchmark]: TraceAbstraction took 11828.14ms. Allocated memory was 256.9MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 202.2MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 705.7MB. Max. memory is 8.0GB. [2022-02-18 13:35:04,535 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.11ms. Allocated memory is still 197.1MB. Free memory is still 158.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 404.03ms. Allocated memory is still 197.1MB. Free memory was 140.2MB in the beginning and 156.2MB in the end (delta: -16.0MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.92ms. Allocated memory is still 197.1MB. Free memory was 156.2MB in the beginning and 153.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.81ms. Allocated memory is still 197.1MB. Free memory was 153.3MB in the beginning and 151.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 815.59ms. Allocated memory was 197.1MB in the beginning and 256.9MB in the end (delta: 59.8MB). Free memory was 151.3MB in the beginning and 202.7MB in the end (delta: -51.4MB). Peak memory consumption was 55.3MB. Max. memory is 8.0GB. * TraceAbstraction took 11828.14ms. Allocated memory was 256.9MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 202.2MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 705.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L715] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L727] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L728] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L730] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t1196; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1196, ((void *)0), P0, ((void *)0))=-2, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1197; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1197, ((void *)0), P1, ((void *)0))=-1, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1198; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1198, ((void *)0), P2, ((void *)0))=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.3s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3032 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3032 mSDsluCounter, 9958 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8445 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1516 IncrementalHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 1944 mSDtfsCounter, 1516 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14373occurred in iteration=0, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 1344 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1237 NumberOfCodeBlocks, 1237 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1132 ConstructedInterpolants, 0 QuantifiedInterpolants, 6207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-02-18 13:35:04,564 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...