/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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 14:53:05,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 14:53:05,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 14:53:05,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 14:53:05,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 14:53:05,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 14:53:05,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 14:53:05,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 14:53:05,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 14:53:05,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 14:53:05,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 14:53:05,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 14:53:05,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 14:53:05,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 14:53:05,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 14:53:05,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 14:53:05,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 14:53:05,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 14:53:05,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 14:53:05,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 14:53:05,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 14:53:05,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 14:53:05,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 14:53:05,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 14:53:05,735 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 14:53:05,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 14:53:05,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 14:53:05,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 14:53:05,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 14:53:05,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 14:53:05,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 14:53:05,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 14:53:05,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 14:53:05,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 14:53:05,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 14:53:05,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 14:53:05,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 14:53:05,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 14:53:05,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 14:53:05,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 14:53:05,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 14:53:05,742 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-03-01 14:53:05,766 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 14:53:05,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 14:53:05,767 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 14:53:05,767 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 14:53:05,768 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 14:53:05,768 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 14:53:05,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 14:53:05,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 14:53:05,769 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 14:53:05,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 14:53:05,770 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 14:53:05,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 14:53:05,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 14:53:05,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 14:53:05,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 14:53:05,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 14:53:05,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 14:53:05,770 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 14:53:05,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 14:53:05,771 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 14:53:05,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 14:53:05,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 14:53:05,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 14:53:05,771 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 14:53:05,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 14:53:05,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 14:53:05,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 14:53:05,773 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 14:53:05,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 14:53:05,773 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 14:53:05,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 14:53:05,773 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 14:53:05,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 14:53:05,774 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-03-01 14:53:05,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 14:53:05,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 14:53:05,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 14:53:05,991 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 14:53:05,992 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 14:53:05,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-03-01 14:53:06,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d40c9b0/e2f27c714f27476a9fec91195b0244e3/FLAG269d903ae [2022-03-01 14:53:06,551 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 14:53:06,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-03-01 14:53:06,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d40c9b0/e2f27c714f27476a9fec91195b0244e3/FLAG269d903ae [2022-03-01 14:53:07,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d40c9b0/e2f27c714f27476a9fec91195b0244e3 [2022-03-01 14:53:07,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 14:53:07,058 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 14:53:07,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 14:53:07,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 14:53:07,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 14:53:07,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 02:53:07" (1/1) ... [2022-03-01 14:53:07,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a93362d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:53:07, skipping insertion in model container [2022-03-01 14:53:07,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 02:53:07" (1/1) ... [2022-03-01 14:53:07,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 14:53:07,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 14:53:07,384 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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-03-01 14:53:07,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 14:53:07,528 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 14:53:07,536 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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-03-01 14:53:07,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 14:53:07,597 INFO L208 MainTranslator]: Completed translation [2022-03-01 14:53:07,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:53:07 WrapperNode [2022-03-01 14:53:07,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 14:53:07,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 14:53:07,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 14:53:07,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 14:53:07,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:53:07" (1/1) ... [2022-03-01 14:53:07,619 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:53:07" (1/1) ... [2022-03-01 14:53:07,638 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-03-01 14:53:07,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 14:53:07,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 14:53:07,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 14:53:07,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 14:53:07,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:53:07" (1/1) ... [2022-03-01 14:53:07,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:53:07" (1/1) ... [2022-03-01 14:53:07,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:53:07" (1/1) ... [2022-03-01 14:53:07,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:53:07" (1/1) ... [2022-03-01 14:53:07,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:53:07" (1/1) ... [2022-03-01 14:53:07,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:53:07" (1/1) ... [2022-03-01 14:53:07,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:53:07" (1/1) ... [2022-03-01 14:53:07,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 14:53:07,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 14:53:07,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 14:53:07,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 14:53:07,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:53:07" (1/1) ... [2022-03-01 14:53:07,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 14:53:07,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 14:53:07,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-01 14:53:07,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-01 14:53:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 14:53:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-01 14:53:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 14:53:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 14:53:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 14:53:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-01 14:53:07,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-01 14:53:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-01 14:53:07,731 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-01 14:53:07,731 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-01 14:53:07,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-01 14:53:07,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 14:53:07,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-01 14:53:07,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 14:53:07,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 14:53:07,733 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 14:53:07,814 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 14:53:07,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 14:53:08,126 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 14:53:08,339 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 14:53:08,339 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-01 14:53:08,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 02:53:08 BoogieIcfgContainer [2022-03-01 14:53:08,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 14:53:08,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 14:53:08,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 14:53:08,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 14:53:08,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 02:53:07" (1/3) ... [2022-03-01 14:53:08,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690c1c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 02:53:08, skipping insertion in model container [2022-03-01 14:53:08,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:53:07" (2/3) ... [2022-03-01 14:53:08,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690c1c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 02:53:08, skipping insertion in model container [2022-03-01 14:53:08,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 02:53:08" (3/3) ... [2022-03-01 14:53:08,348 INFO L111 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-03-01 14:53:08,351 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 14:53:08,352 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 14:53:08,352 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-01 14:53:08,352 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 14:53:08,389 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,389 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,389 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,389 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,389 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,390 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,390 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,390 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,390 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,390 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,391 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,391 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,391 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,391 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,391 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,391 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,391 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,391 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,391 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,392 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,392 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,392 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,392 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,392 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,393 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,393 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,393 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,393 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,394 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,394 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,394 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,394 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,394 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,394 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,394 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,394 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,394 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,394 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,394 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,394 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,395 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,395 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,395 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,395 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,395 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,395 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,397 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,397 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,397 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,399 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,399 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,400 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,401 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,402 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,402 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,402 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,402 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,402 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,402 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,402 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,402 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,402 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,403 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,403 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,403 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,405 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,406 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,406 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,406 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,407 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,409 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,412 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,412 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,412 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,412 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,412 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,412 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,412 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,412 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,413 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,413 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,413 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,413 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,413 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,413 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,414 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,414 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,414 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,414 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,415 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,415 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,415 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,415 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,415 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,415 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,416 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,416 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,416 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,416 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,416 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,416 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,416 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,417 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,417 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,417 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,417 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,417 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,417 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,417 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,417 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,417 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,418 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,418 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,418 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,418 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,418 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,418 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,418 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,419 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,419 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,419 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,419 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,419 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,419 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,419 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,420 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,420 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,420 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,420 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,423 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,423 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,423 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,423 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,423 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,424 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,424 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,425 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,425 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,425 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,426 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,426 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,426 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,427 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,427 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,427 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,427 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,427 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,428 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,428 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,428 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,428 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,428 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,428 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,428 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,428 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,428 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,428 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,428 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,429 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,429 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,429 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,429 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,429 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,429 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,429 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,429 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,430 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,430 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,430 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,430 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,430 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,430 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,430 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,430 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,431 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,431 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,431 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,431 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:53:08,431 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 14:53:08,467 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 14:53:08,473 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-03-01 14:53:08,473 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-01 14:53:08,484 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 114 transitions, 243 flow [2022-03-01 14:53:08,896 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12293 states, 12290 states have (on average 3.548494711147274) internal successors, (43611), 12292 states have internal predecessors, (43611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 12293 states, 12290 states have (on average 3.548494711147274) internal successors, (43611), 12292 states have internal predecessors, (43611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-01 14:53:08,941 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:53:08,941 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] [2022-03-01 14:53:08,942 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 14:53:08,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:53:08,946 INFO L85 PathProgramCache]: Analyzing trace with hash 67631088, now seen corresponding path program 1 times [2022-03-01 14:53:08,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:53:08,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338260916] [2022-03-01 14:53:08,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:53:08,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:53:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:53:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:53:09,233 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:53:09,234 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338260916] [2022-03-01 14:53:09,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338260916] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:53:09,235 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:53:09,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 14:53:09,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860971426] [2022-03-01 14:53:09,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:53:09,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 14:53:09,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:53:09,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 14:53:09,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 14:53:09,287 INFO L87 Difference]: Start difference. First operand has 12293 states, 12290 states have (on average 3.548494711147274) internal successors, (43611), 12292 states have internal predecessors, (43611), 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 26.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:53:09,520 INFO L93 Difference]: Finished difference Result 10340 states and 35805 transitions. [2022-03-01 14:53:09,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 14:53:09,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2022-03-01 14:53:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:53:09,594 INFO L225 Difference]: With dead ends: 10340 [2022-03-01 14:53:09,594 INFO L226 Difference]: Without dead ends: 8548 [2022-03-01 14:53:09,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 14:53:09,599 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 47 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-01 14:53:09,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 164 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-01 14:53:09,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8548 states. [2022-03-01 14:53:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8548 to 8548. [2022-03-01 14:53:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8548 states, 8547 states have (on average 3.491868491868492) internal successors, (29845), 8547 states have internal predecessors, (29845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8548 states to 8548 states and 29845 transitions. [2022-03-01 14:53:10,057 INFO L78 Accepts]: Start accepts. Automaton has 8548 states and 29845 transitions. Word has length 52 [2022-03-01 14:53:10,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:53:10,058 INFO L470 AbstractCegarLoop]: Abstraction has 8548 states and 29845 transitions. [2022-03-01 14:53:10,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 8548 states and 29845 transitions. [2022-03-01 14:53:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-03-01 14:53:10,101 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:53:10,101 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] [2022-03-01 14:53:10,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 14:53:10,102 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 14:53:10,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:53:10,103 INFO L85 PathProgramCache]: Analyzing trace with hash -764172337, now seen corresponding path program 1 times [2022-03-01 14:53:10,103 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:53:10,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560733352] [2022-03-01 14:53:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:53:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:53:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:53:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:53:10,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:53:10,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560733352] [2022-03-01 14:53:10,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560733352] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:53:10,244 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:53:10,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 14:53:10,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922603825] [2022-03-01 14:53:10,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:53:10,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 14:53:10,245 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:53:10,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 14:53:10,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-01 14:53:10,245 INFO L87 Difference]: Start difference. First operand 8548 states and 29845 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:53:10,630 INFO L93 Difference]: Finished difference Result 15164 states and 52226 transitions. [2022-03-01 14:53:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 14:53:10,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 74 [2022-03-01 14:53:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:53:10,687 INFO L225 Difference]: With dead ends: 15164 [2022-03-01 14:53:10,687 INFO L226 Difference]: Without dead ends: 10164 [2022-03-01 14:53:10,688 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-03-01 14:53:10,688 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 160 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:53:10,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 553 Invalid, 122 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:53:10,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10164 states. [2022-03-01 14:53:10,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10164 to 8764. [2022-03-01 14:53:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8764 states, 8763 states have (on average 3.4374072806116627) internal successors, (30122), 8763 states have internal predecessors, (30122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8764 states to 8764 states and 30122 transitions. [2022-03-01 14:53:11,023 INFO L78 Accepts]: Start accepts. Automaton has 8764 states and 30122 transitions. Word has length 74 [2022-03-01 14:53:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:53:11,024 INFO L470 AbstractCegarLoop]: Abstraction has 8764 states and 30122 transitions. [2022-03-01 14:53:11,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:11,025 INFO L276 IsEmpty]: Start isEmpty. Operand 8764 states and 30122 transitions. [2022-03-01 14:53:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-01 14:53:11,038 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:53:11,038 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] [2022-03-01 14:53:11,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 14:53:11,038 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 14:53:11,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:53:11,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1735880242, now seen corresponding path program 1 times [2022-03-01 14:53:11,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:53:11,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815060296] [2022-03-01 14:53:11,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:53:11,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:53:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:53:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:53:11,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:53:11,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815060296] [2022-03-01 14:53:11,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815060296] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:53:11,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:53:11,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-01 14:53:11,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735390767] [2022-03-01 14:53:11,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:53:11,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 14:53:11,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:53:11,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 14:53:11,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-01 14:53:11,140 INFO L87 Difference]: Start difference. First operand 8764 states and 30122 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:53:11,599 INFO L93 Difference]: Finished difference Result 13622 states and 46153 transitions. [2022-03-01 14:53:11,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-01 14:53:11,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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 76 [2022-03-01 14:53:11,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:53:11,664 INFO L225 Difference]: With dead ends: 13622 [2022-03-01 14:53:11,665 INFO L226 Difference]: Without dead ends: 10390 [2022-03-01 14:53:11,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-03-01 14:53:11,666 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 306 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:53:11,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 653 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:53:11,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10390 states. [2022-03-01 14:53:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10390 to 8710. [2022-03-01 14:53:11,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8710 states, 8709 states have (on average 3.421173498679527) internal successors, (29795), 8709 states have internal predecessors, (29795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8710 states to 8710 states and 29795 transitions. [2022-03-01 14:53:11,951 INFO L78 Accepts]: Start accepts. Automaton has 8710 states and 29795 transitions. Word has length 76 [2022-03-01 14:53:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:53:11,952 INFO L470 AbstractCegarLoop]: Abstraction has 8710 states and 29795 transitions. [2022-03-01 14:53:11,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 8710 states and 29795 transitions. [2022-03-01 14:53:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-03-01 14:53:11,964 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:53:11,964 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] [2022-03-01 14:53:11,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 14:53:11,965 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 14:53:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:53:11,965 INFO L85 PathProgramCache]: Analyzing trace with hash -830862450, now seen corresponding path program 1 times [2022-03-01 14:53:11,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:53:11,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129313105] [2022-03-01 14:53:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:53:11,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:53:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:53:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:53:12,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:53:12,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129313105] [2022-03-01 14:53:12,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129313105] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:53:12,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:53:12,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-01 14:53:12,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638493638] [2022-03-01 14:53:12,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:53:12,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 14:53:12,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:53:12,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 14:53:12,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-01 14:53:12,064 INFO L87 Difference]: Start difference. First operand 8710 states and 29795 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:53:12,491 INFO L93 Difference]: Finished difference Result 11950 states and 40422 transitions. [2022-03-01 14:53:12,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-01 14:53:12,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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 76 [2022-03-01 14:53:12,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:53:12,525 INFO L225 Difference]: With dead ends: 11950 [2022-03-01 14:53:12,525 INFO L226 Difference]: Without dead ends: 9550 [2022-03-01 14:53:12,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-03-01 14:53:12,526 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 213 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:53:12,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 624 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:53:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9550 states. [2022-03-01 14:53:12,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9550 to 8150. [2022-03-01 14:53:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8150 states, 8149 states have (on average 3.403730519082096) internal successors, (27737), 8149 states have internal predecessors, (27737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8150 states to 8150 states and 27737 transitions. [2022-03-01 14:53:12,712 INFO L78 Accepts]: Start accepts. Automaton has 8150 states and 27737 transitions. Word has length 76 [2022-03-01 14:53:12,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:53:12,713 INFO L470 AbstractCegarLoop]: Abstraction has 8150 states and 27737 transitions. [2022-03-01 14:53:12,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 8150 states and 27737 transitions. [2022-03-01 14:53:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-03-01 14:53:12,844 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:53:12,844 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] [2022-03-01 14:53:12,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-01 14:53:12,844 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 14:53:12,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:53:12,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1660711373, now seen corresponding path program 1 times [2022-03-01 14:53:12,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:53:12,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131283757] [2022-03-01 14:53:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:53:12,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:53:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:53:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:53:12,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:53:12,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131283757] [2022-03-01 14:53:12,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131283757] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:53:12,931 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:53:12,931 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-01 14:53:12,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571229812] [2022-03-01 14:53:12,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:53:12,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-01 14:53:12,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:53:12,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-01 14:53:12,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-03-01 14:53:12,932 INFO L87 Difference]: Start difference. First operand 8150 states and 27737 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:53:13,207 INFO L93 Difference]: Finished difference Result 12070 states and 40698 transitions. [2022-03-01 14:53:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-01 14:53:13,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 78 [2022-03-01 14:53:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:53:13,232 INFO L225 Difference]: With dead ends: 12070 [2022-03-01 14:53:13,232 INFO L226 Difference]: Without dead ends: 6646 [2022-03-01 14:53:13,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-03-01 14:53:13,233 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 243 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:53:13,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 610 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:53:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6646 states. [2022-03-01 14:53:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6646 to 5771. [2022-03-01 14:53:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5771 states, 5770 states have (on average 3.3169844020797226) internal successors, (19139), 5770 states have internal predecessors, (19139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:13,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5771 states to 5771 states and 19139 transitions. [2022-03-01 14:53:13,428 INFO L78 Accepts]: Start accepts. Automaton has 5771 states and 19139 transitions. Word has length 78 [2022-03-01 14:53:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:53:13,429 INFO L470 AbstractCegarLoop]: Abstraction has 5771 states and 19139 transitions. [2022-03-01 14:53:13,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:13,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5771 states and 19139 transitions. [2022-03-01 14:53:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-03-01 14:53:13,442 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:53:13,442 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-03-01 14:53:13,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-01 14:53:13,442 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 14:53:13,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:53:13,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1886421856, now seen corresponding path program 1 times [2022-03-01 14:53:13,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:53:13,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825779085] [2022-03-01 14:53:13,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:53:13,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:53:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:53:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:53:13,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:53:13,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825779085] [2022-03-01 14:53:13,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825779085] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:53:13,527 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:53:13,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 14:53:13,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79288006] [2022-03-01 14:53:13,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:53:13,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 14:53:13,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:53:13,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 14:53:13,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-01 14:53:13,528 INFO L87 Difference]: Start difference. First operand 5771 states and 19139 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-03-01 14:53:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:53:13,680 INFO L93 Difference]: Finished difference Result 6401 states and 21128 transitions. [2022-03-01 14:53:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 14:53:13,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-03-01 14:53:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:53:13,694 INFO L225 Difference]: With dead ends: 6401 [2022-03-01 14:53:13,694 INFO L226 Difference]: Without dead ends: 5351 [2022-03-01 14:53:13,694 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-03-01 14:53:13,695 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 84 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:53:13,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 502 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:53:13,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5351 states. [2022-03-01 14:53:13,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5351 to 5351. [2022-03-01 14:53:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5351 states, 5350 states have (on average 3.3014953271028036) internal successors, (17663), 5350 states have internal predecessors, (17663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5351 states to 5351 states and 17663 transitions. [2022-03-01 14:53:13,841 INFO L78 Accepts]: Start accepts. Automaton has 5351 states and 17663 transitions. Word has length 79 [2022-03-01 14:53:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:53:13,841 INFO L470 AbstractCegarLoop]: Abstraction has 5351 states and 17663 transitions. [2022-03-01 14:53:13,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-03-01 14:53:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 5351 states and 17663 transitions. [2022-03-01 14:53:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-03-01 14:53:13,857 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:53:13,857 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-03-01 14:53:13,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-01 14:53:13,857 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 14:53:13,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:53:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1275858913, now seen corresponding path program 1 times [2022-03-01 14:53:13,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:53:13,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093880024] [2022-03-01 14:53:13,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:53:13,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:53:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:53:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:53:13,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:53:13,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093880024] [2022-03-01 14:53:13,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093880024] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:53:13,935 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:53:13,935 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 14:53:13,935 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448640204] [2022-03-01 14:53:13,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:53:13,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 14:53:13,936 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:53:13,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 14:53:13,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-01 14:53:13,936 INFO L87 Difference]: Start difference. First operand 5351 states and 17663 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-03-01 14:53:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:53:14,078 INFO L93 Difference]: Finished difference Result 6458 states and 20984 transitions. [2022-03-01 14:53:14,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 14:53:14,079 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-03-01 14:53:14,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:53:14,090 INFO L225 Difference]: With dead ends: 6458 [2022-03-01 14:53:14,090 INFO L226 Difference]: Without dead ends: 4723 [2022-03-01 14:53:14,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-01 14:53:14,091 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 176 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:53:14,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 388 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:53:14,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4723 states. [2022-03-01 14:53:14,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4723 to 4723. [2022-03-01 14:53:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4723 states, 4722 states have (on average 3.2323168149089367) internal successors, (15263), 4722 states have internal predecessors, (15263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 15263 transitions. [2022-03-01 14:53:14,175 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 15263 transitions. Word has length 81 [2022-03-01 14:53:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:53:14,175 INFO L470 AbstractCegarLoop]: Abstraction has 4723 states and 15263 transitions. [2022-03-01 14:53:14,175 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-03-01 14:53:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 15263 transitions. [2022-03-01 14:53:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-03-01 14:53:14,183 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:53:14,183 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-03-01 14:53:14,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-01 14:53:14,184 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 14:53:14,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:53:14,184 INFO L85 PathProgramCache]: Analyzing trace with hash 500927296, now seen corresponding path program 1 times [2022-03-01 14:53:14,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:53:14,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544657608] [2022-03-01 14:53:14,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:53:14,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:53:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:53:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:53:14,265 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:53:14,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544657608] [2022-03-01 14:53:14,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544657608] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:53:14,265 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:53:14,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-01 14:53:14,266 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400326108] [2022-03-01 14:53:14,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:53:14,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 14:53:14,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:53:14,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 14:53:14,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-01 14:53:14,267 INFO L87 Difference]: Start difference. First operand 4723 states and 15263 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-03-01 14:53:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:53:14,431 INFO L93 Difference]: Finished difference Result 4630 states and 14526 transitions. [2022-03-01 14:53:14,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-01 14:53:14,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-03-01 14:53:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:53:14,456 INFO L225 Difference]: With dead ends: 4630 [2022-03-01 14:53:14,457 INFO L226 Difference]: Without dead ends: 3235 [2022-03-01 14:53:14,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-03-01 14:53:14,458 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 283 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:53:14,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 444 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:53:14,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2022-03-01 14:53:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 3235. [2022-03-01 14:53:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3235 states, 3234 states have (on average 3.0769944341372915) internal successors, (9951), 3234 states have internal predecessors, (9951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 3235 states and 9951 transitions. [2022-03-01 14:53:14,523 INFO L78 Accepts]: Start accepts. Automaton has 3235 states and 9951 transitions. Word has length 83 [2022-03-01 14:53:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:53:14,523 INFO L470 AbstractCegarLoop]: Abstraction has 3235 states and 9951 transitions. [2022-03-01 14:53:14,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 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-03-01 14:53:14,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3235 states and 9951 transitions. [2022-03-01 14:53:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-03-01 14:53:14,529 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:53:14,529 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] [2022-03-01 14:53:14,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-01 14:53:14,529 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 14:53:14,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:53:14,530 INFO L85 PathProgramCache]: Analyzing trace with hash 162564927, now seen corresponding path program 1 times [2022-03-01 14:53:14,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:53:14,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522435061] [2022-03-01 14:53:14,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:53:14,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:53:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:53:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:53:14,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:53:14,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522435061] [2022-03-01 14:53:14,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522435061] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:53:14,674 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:53:14,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-01 14:53:14,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252051917] [2022-03-01 14:53:14,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:53:14,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 14:53:14,674 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:53:14,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 14:53:14,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-01 14:53:14,675 INFO L87 Difference]: Start difference. First operand 3235 states and 9951 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:53:14,843 INFO L93 Difference]: Finished difference Result 4811 states and 14762 transitions. [2022-03-01 14:53:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-01 14:53:14,843 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 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 85 [2022-03-01 14:53:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:53:14,851 INFO L225 Difference]: With dead ends: 4811 [2022-03-01 14:53:14,851 INFO L226 Difference]: Without dead ends: 3235 [2022-03-01 14:53:14,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-03-01 14:53:14,852 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 181 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:53:14,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 970 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:53:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2022-03-01 14:53:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 3235. [2022-03-01 14:53:14,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3235 states, 3234 states have (on average 3.04978354978355) internal successors, (9863), 3234 states have internal predecessors, (9863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 3235 states and 9863 transitions. [2022-03-01 14:53:14,910 INFO L78 Accepts]: Start accepts. Automaton has 3235 states and 9863 transitions. Word has length 85 [2022-03-01 14:53:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:53:14,911 INFO L470 AbstractCegarLoop]: Abstraction has 3235 states and 9863 transitions. [2022-03-01 14:53:14,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3235 states and 9863 transitions. [2022-03-01 14:53:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-03-01 14:53:14,917 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:53:14,917 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] [2022-03-01 14:53:14,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-01 14:53:14,917 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 14:53:14,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:53:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash -151458979, now seen corresponding path program 2 times [2022-03-01 14:53:14,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:53:14,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250760660] [2022-03-01 14:53:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:53:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:53:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:53:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:53:15,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:53:15,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250760660] [2022-03-01 14:53:15,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250760660] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:53:15,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:53:15,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-01 14:53:15,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338694804] [2022-03-01 14:53:15,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:53:15,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-01 14:53:15,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:53:15,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-01 14:53:15,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-01 14:53:15,013 INFO L87 Difference]: Start difference. First operand 3235 states and 9863 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:53:15,175 INFO L93 Difference]: Finished difference Result 2605 states and 7718 transitions. [2022-03-01 14:53:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-01 14:53:15,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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 85 [2022-03-01 14:53:15,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:53:15,178 INFO L225 Difference]: With dead ends: 2605 [2022-03-01 14:53:15,179 INFO L226 Difference]: Without dead ends: 1426 [2022-03-01 14:53:15,179 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-03-01 14:53:15,179 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 380 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:53:15,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 425 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:53:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2022-03-01 14:53:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1351. [2022-03-01 14:53:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1350 states have (on average 2.9066666666666667) internal successors, (3924), 1350 states have internal predecessors, (3924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 3924 transitions. [2022-03-01 14:53:15,201 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 3924 transitions. Word has length 85 [2022-03-01 14:53:15,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:53:15,201 INFO L470 AbstractCegarLoop]: Abstraction has 1351 states and 3924 transitions. [2022-03-01 14:53:15,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 3924 transitions. [2022-03-01 14:53:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-01 14:53:15,204 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:53:15,204 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] [2022-03-01 14:53:15,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-01 14:53:15,204 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 14:53:15,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:53:15,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1877862917, now seen corresponding path program 1 times [2022-03-01 14:53:15,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:53:15,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168602284] [2022-03-01 14:53:15,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:53:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:53:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:53:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 14:53:15,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:53:15,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168602284] [2022-03-01 14:53:15,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168602284] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:53:15,419 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:53:15,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 14:53:15,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203139969] [2022-03-01 14:53:15,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:53:15,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 14:53:15,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:53:15,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 14:53:15,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-03-01 14:53:15,421 INFO L87 Difference]: Start difference. First operand 1351 states and 3924 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:15,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:53:15,557 INFO L93 Difference]: Finished difference Result 1894 states and 5537 transitions. [2022-03-01 14:53:15,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-01 14:53:15,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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 88 [2022-03-01 14:53:15,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:53:15,560 INFO L225 Difference]: With dead ends: 1894 [2022-03-01 14:53:15,560 INFO L226 Difference]: Without dead ends: 979 [2022-03-01 14:53:15,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-03-01 14:53:15,560 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 163 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:53:15,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 880 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:53:15,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2022-03-01 14:53:15,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 979. [2022-03-01 14:53:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 978 states have (on average 2.789366053169734) internal successors, (2728), 978 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 2728 transitions. [2022-03-01 14:53:15,574 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 2728 transitions. Word has length 88 [2022-03-01 14:53:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:53:15,575 INFO L470 AbstractCegarLoop]: Abstraction has 979 states and 2728 transitions. [2022-03-01 14:53:15,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:53:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 2728 transitions. [2022-03-01 14:53:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-01 14:53:15,576 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:53:15,577 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] [2022-03-01 14:53:15,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-01 14:53:15,577 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-01 14:53:15,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:53:15,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1697319931, now seen corresponding path program 2 times [2022-03-01 14:53:15,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:53:15,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046189582] [2022-03-01 14:53:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:53:15,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:53:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 14:53:15,642 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-01 14:53:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 14:53:15,729 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-01 14:53:15,729 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-01 14:53:15,730 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-03-01 14:53:15,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-03-01 14:53:15,731 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-03-01 14:53:15,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-03-01 14:53:15,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-03-01 14:53:15,732 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-01 14:53:15,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-01 14:53:15,734 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:53:15,737 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-01 14:53:15,737 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 14:53:15,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 02:53:15 BasicIcfg [2022-03-01 14:53:15,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 14:53:15,832 INFO L158 Benchmark]: Toolchain (without parser) took 8774.45ms. Allocated memory was 205.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 177.8MB in the beginning and 912.6MB in the end (delta: -734.8MB). Peak memory consumption was 833.3MB. Max. memory is 8.0GB. [2022-03-01 14:53:15,833 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 205.5MB. Free memory is still 166.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 14:53:15,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.45ms. Allocated memory is still 205.5MB. Free memory was 177.6MB in the beginning and 164.6MB in the end (delta: 12.9MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2022-03-01 14:53:15,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.27ms. Allocated memory is still 205.5MB. Free memory was 164.6MB in the beginning and 162.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 14:53:15,833 INFO L158 Benchmark]: Boogie Preprocessor took 22.27ms. Allocated memory is still 205.5MB. Free memory was 162.0MB in the beginning and 160.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 14:53:15,833 INFO L158 Benchmark]: RCFGBuilder took 679.51ms. Allocated memory was 205.5MB in the beginning and 266.3MB in the end (delta: 60.8MB). Free memory was 159.9MB in the beginning and 212.1MB in the end (delta: -52.2MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2022-03-01 14:53:15,834 INFO L158 Benchmark]: TraceAbstraction took 7489.37ms. Allocated memory was 266.3MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 211.6MB in the beginning and 912.6MB in the end (delta: -701.0MB). Peak memory consumption was 806.9MB. Max. memory is 8.0GB. [2022-03-01 14:53:15,835 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 205.5MB. Free memory is still 166.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 538.45ms. Allocated memory is still 205.5MB. Free memory was 177.6MB in the beginning and 164.6MB in the end (delta: 12.9MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.27ms. Allocated memory is still 205.5MB. Free memory was 164.6MB in the beginning and 162.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.27ms. Allocated memory is still 205.5MB. Free memory was 162.0MB in the beginning and 160.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 679.51ms. Allocated memory was 205.5MB in the beginning and 266.3MB in the end (delta: 60.8MB). Free memory was 159.9MB in the beginning and 212.1MB in the end (delta: -52.2MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. * TraceAbstraction took 7489.37ms. Allocated memory was 266.3MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 211.6MB in the beginning and 912.6MB in the end (delta: -701.0MB). Peak memory consumption was 806.9MB. 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2073; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2073, ((void *)0), P0, ((void *)0))=-2, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2074; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2074, ((void *)0), P1, ((void *)0))=-1, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2075; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L836] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2075, ((void *)0), P2, ((void *)0))=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=66, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2236 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2236 mSDsluCounter, 6213 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5374 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1214 IncrementalHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 1358 mSDtfsCounter, 1214 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12293occurred in iteration=0, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 5430 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 945 NumberOfCodeBlocks, 945 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 846 ConstructedInterpolants, 0 QuantifiedInterpolants, 3049 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-03-01 14:53:15,887 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...