/usr/bin/java -Xmx16000000000 -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/mix028_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9b7772ad7705253c1305067fc38dc9bc7271fbe3-9b7772a [2021-04-15 00:32:19,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-15 00:32:19,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-15 00:32:19,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-15 00:32:19,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-15 00:32:19,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-15 00:32:19,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-15 00:32:20,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-15 00:32:20,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-15 00:32:20,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-15 00:32:20,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-15 00:32:20,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-15 00:32:20,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-15 00:32:20,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-15 00:32:20,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-15 00:32:20,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-15 00:32:20,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-15 00:32:20,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-15 00:32:20,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-15 00:32:20,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-15 00:32:20,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-15 00:32:20,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-15 00:32:20,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-15 00:32:20,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-15 00:32:20,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-15 00:32:20,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-15 00:32:20,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-15 00:32:20,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-15 00:32:20,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-15 00:32:20,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-15 00:32:20,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-15 00:32:20,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-15 00:32:20,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-15 00:32:20,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-15 00:32:20,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-15 00:32:20,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-15 00:32:20,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-15 00:32:20,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-15 00:32:20,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-15 00:32:20,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-15 00:32:20,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-15 00:32:20,034 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 [2021-04-15 00:32:20,060 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-15 00:32:20,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-15 00:32:20,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-04-15 00:32:20,060 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-04-15 00:32:20,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-15 00:32:20,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-15 00:32:20,063 INFO L138 SettingsManager]: * Use SBE=true [2021-04-15 00:32:20,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-15 00:32:20,063 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-15 00:32:20,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-15 00:32:20,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-15 00:32:20,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-15 00:32:20,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-15 00:32:20,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-15 00:32:20,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-15 00:32:20,064 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-15 00:32:20,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-15 00:32:20,064 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-15 00:32:20,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-15 00:32:20,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-15 00:32:20,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-15 00:32:20,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-15 00:32:20,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-15 00:32:20,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-15 00:32:20,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-15 00:32:20,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-15 00:32:20,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-15 00:32:20,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-15 00:32:20,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-15 00:32:20,065 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-04-15 00:32:20,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-04-15 00:32:20,065 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 [2021-04-15 00:32:20,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-15 00:32:20,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-15 00:32:20,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-15 00:32:20,291 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-15 00:32:20,291 INFO L275 PluginConnector]: CDTParser initialized [2021-04-15 00:32:20,292 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i [2021-04-15 00:32:20,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41bcea17/f8d5a47be1c4446197d4655e5a1420f9/FLAG0ef892108 [2021-04-15 00:32:20,994 INFO L306 CDTParser]: Found 1 translation units. [2021-04-15 00:32:20,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i [2021-04-15 00:32:21,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41bcea17/f8d5a47be1c4446197d4655e5a1420f9/FLAG0ef892108 [2021-04-15 00:32:21,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41bcea17/f8d5a47be1c4446197d4655e5a1420f9 [2021-04-15 00:32:21,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-15 00:32:21,121 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-15 00:32:21,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-15 00:32:21,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-15 00:32:21,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-15 00:32:21,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:21" (1/1) ... [2021-04-15 00:32:21,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55f73c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:21, skipping insertion in model container [2021-04-15 00:32:21,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:21" (1/1) ... [2021-04-15 00:32:21,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-15 00:32:21,175 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-15 00:32:21,305 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i[950,963] [2021-04-15 00:32:21,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 00:32:21,458 INFO L203 MainTranslator]: Completed pre-run [2021-04-15 00:32:21,465 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i[950,963] [2021-04-15 00:32:21,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 00:32:21,546 INFO L208 MainTranslator]: Completed translation [2021-04-15 00:32:21,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:21 WrapperNode [2021-04-15 00:32:21,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-15 00:32:21,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-15 00:32:21,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-15 00:32:21,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-15 00:32:21,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:21" (1/1) ... [2021-04-15 00:32:21,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:21" (1/1) ... [2021-04-15 00:32:21,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-15 00:32:21,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-15 00:32:21,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-15 00:32:21,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-15 00:32:21,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:21" (1/1) ... [2021-04-15 00:32:21,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:21" (1/1) ... [2021-04-15 00:32:21,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:21" (1/1) ... [2021-04-15 00:32:21,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:21" (1/1) ... [2021-04-15 00:32:21,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:21" (1/1) ... [2021-04-15 00:32:21,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:21" (1/1) ... [2021-04-15 00:32:21,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:21" (1/1) ... [2021-04-15 00:32:21,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-15 00:32:21,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-15 00:32:21,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-15 00:32:21,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-15 00:32:21,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-15 00:32:21,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-15 00:32:21,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-15 00:32:21,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-15 00:32:21,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-15 00:32:21,656 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-15 00:32:21,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-15 00:32:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-15 00:32:21,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-15 00:32:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-15 00:32:21,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-15 00:32:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-15 00:32:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-15 00:32:21,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-15 00:32:21,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-15 00:32:21,659 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-15 00:32:22,915 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-15 00:32:22,916 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-15 00:32:22,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:22 BoogieIcfgContainer [2021-04-15 00:32:22,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-15 00:32:22,918 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-15 00:32:22,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-15 00:32:22,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-15 00:32:22,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:32:21" (1/3) ... [2021-04-15 00:32:22,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534bca67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:22, skipping insertion in model container [2021-04-15 00:32:22,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:21" (2/3) ... [2021-04-15 00:32:22,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@534bca67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:22, skipping insertion in model container [2021-04-15 00:32:22,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:22" (3/3) ... [2021-04-15 00:32:22,921 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_power.opt.i [2021-04-15 00:32:22,925 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-04-15 00:32:22,925 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-15 00:32:22,928 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-15 00:32:22,928 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-15 00:32:22,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,954 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,954 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,954 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,954 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,964 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,964 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,965 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,965 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,965 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,966 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,967 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 00:32:22,968 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-15 00:32:22,978 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-15 00:32:22,988 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-15 00:32:22,988 INFO L377 AbstractCegarLoop]: Hoare is true [2021-04-15 00:32:22,988 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-15 00:32:22,988 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-15 00:32:22,988 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-15 00:32:22,988 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-15 00:32:22,989 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-15 00:32:22,989 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-15 00:32:22,994 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 99 transitions, 213 flow [2021-04-15 00:32:23,650 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 17206 states, 17202 states have (on average 3.6672479944192538) internal successors, (63084), 17205 states have internal predecessors, (63084), 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) [2021-04-15 00:32:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 17206 states, 17202 states have (on average 3.6672479944192538) internal successors, (63084), 17205 states have internal predecessors, (63084), 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) [2021-04-15 00:32:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-04-15 00:32:23,685 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:23,685 INFO L551 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] [2021-04-15 00:32:23,685 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:23,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:23,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1756561705, now seen corresponding path program 1 times [2021-04-15 00:32:23,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:23,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568618766] [2021-04-15 00:32:23,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:23,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:23,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568618766] [2021-04-15 00:32:23,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:23,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-15 00:32:23,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989092408] [2021-04-15 00:32:23,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-15 00:32:23,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:23,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-15 00:32:23,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 00:32:23,881 INFO L87 Difference]: Start difference. First operand has 17206 states, 17202 states have (on average 3.6672479944192538) internal successors, (63084), 17205 states have internal predecessors, (63084), 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 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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) [2021-04-15 00:32:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:24,104 INFO L93 Difference]: Finished difference Result 14726 states and 52626 transitions. [2021-04-15 00:32:24,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 00:32:24,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2021-04-15 00:32:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:24,168 INFO L225 Difference]: With dead ends: 14726 [2021-04-15 00:32:24,168 INFO L226 Difference]: Without dead ends: 8390 [2021-04-15 00:32:24,169 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 00:32:24,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8390 states. [2021-04-15 00:32:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8390 to 8390. [2021-04-15 00:32:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8390 states, 8389 states have (on average 3.524853975444034) internal successors, (29570), 8389 states have internal predecessors, (29570), 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) [2021-04-15 00:32:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8390 states to 8390 states and 29570 transitions. [2021-04-15 00:32:24,585 INFO L78 Accepts]: Start accepts. Automaton has 8390 states and 29570 transitions. Word has length 44 [2021-04-15 00:32:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:24,586 INFO L480 AbstractCegarLoop]: Abstraction has 8390 states and 29570 transitions. [2021-04-15 00:32:24,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 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) [2021-04-15 00:32:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 8390 states and 29570 transitions. [2021-04-15 00:32:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-04-15 00:32:24,597 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:24,597 INFO L551 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] [2021-04-15 00:32:24,598 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-15 00:32:24,598 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:24,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:24,601 INFO L82 PathProgramCache]: Analyzing trace with hash -718568062, now seen corresponding path program 1 times [2021-04-15 00:32:24,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:24,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125678243] [2021-04-15 00:32:24,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:24,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125678243] [2021-04-15 00:32:24,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:24,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 00:32:24,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025395039] [2021-04-15 00:32:24,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 00:32:24,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:24,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 00:32:24,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 00:32:24,802 INFO L87 Difference]: Start difference. First operand 8390 states and 29570 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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) [2021-04-15 00:32:24,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:24,932 INFO L93 Difference]: Finished difference Result 9542 states and 33250 transitions. [2021-04-15 00:32:24,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 00:32:24,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 59 [2021-04-15 00:32:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:24,971 INFO L225 Difference]: With dead ends: 9542 [2021-04-15 00:32:24,971 INFO L226 Difference]: Without dead ends: 7238 [2021-04-15 00:32:24,972 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 70.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:32:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7238 states. [2021-04-15 00:32:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7238 to 7238. [2021-04-15 00:32:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7238 states, 7237 states have (on average 3.489014785131961) internal successors, (25250), 7237 states have internal predecessors, (25250), 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) [2021-04-15 00:32:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7238 states to 7238 states and 25250 transitions. [2021-04-15 00:32:25,210 INFO L78 Accepts]: Start accepts. Automaton has 7238 states and 25250 transitions. Word has length 59 [2021-04-15 00:32:25,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:25,212 INFO L480 AbstractCegarLoop]: Abstraction has 7238 states and 25250 transitions. [2021-04-15 00:32:25,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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) [2021-04-15 00:32:25,212 INFO L276 IsEmpty]: Start isEmpty. Operand 7238 states and 25250 transitions. [2021-04-15 00:32:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-04-15 00:32:25,223 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:25,223 INFO L551 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] [2021-04-15 00:32:25,223 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-15 00:32:25,224 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:25,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:25,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1559309034, now seen corresponding path program 1 times [2021-04-15 00:32:25,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:25,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122010256] [2021-04-15 00:32:25,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:25,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122010256] [2021-04-15 00:32:25,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:25,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-15 00:32:25,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761473107] [2021-04-15 00:32:25,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-15 00:32:25,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:25,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-15 00:32:25,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-15 00:32:25,437 INFO L87 Difference]: Start difference. First operand 7238 states and 25250 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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) [2021-04-15 00:32:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:25,722 INFO L93 Difference]: Finished difference Result 8876 states and 30736 transitions. [2021-04-15 00:32:25,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-15 00:32:25,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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 62 [2021-04-15 00:32:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:25,747 INFO L225 Difference]: With dead ends: 8876 [2021-04-15 00:32:25,748 INFO L226 Difference]: Without dead ends: 7244 [2021-04-15 00:32:25,749 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 147.7ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-04-15 00:32:25,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7244 states. [2021-04-15 00:32:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7244 to 7022. [2021-04-15 00:32:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7022 states, 7021 states have (on average 3.4784218772254665) internal successors, (24422), 7021 states have internal predecessors, (24422), 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) [2021-04-15 00:32:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7022 states to 7022 states and 24422 transitions. [2021-04-15 00:32:25,939 INFO L78 Accepts]: Start accepts. Automaton has 7022 states and 24422 transitions. Word has length 62 [2021-04-15 00:32:25,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:25,939 INFO L480 AbstractCegarLoop]: Abstraction has 7022 states and 24422 transitions. [2021-04-15 00:32:25,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 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) [2021-04-15 00:32:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 7022 states and 24422 transitions. [2021-04-15 00:32:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-15 00:32:25,948 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:25,948 INFO L551 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] [2021-04-15 00:32:25,949 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-15 00:32:25,949 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:25,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1172402862, now seen corresponding path program 1 times [2021-04-15 00:32:25,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:25,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681103914] [2021-04-15 00:32:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:26,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:26,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681103914] [2021-04-15 00:32:26,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:26,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 00:32:26,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431834410] [2021-04-15 00:32:26,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 00:32:26,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:26,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 00:32:26,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-04-15 00:32:26,136 INFO L87 Difference]: Start difference. First operand 7022 states and 24422 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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) [2021-04-15 00:32:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:26,382 INFO L93 Difference]: Finished difference Result 8102 states and 27938 transitions. [2021-04-15 00:32:26,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-04-15 00:32:26,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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 64 [2021-04-15 00:32:26,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:26,406 INFO L225 Difference]: With dead ends: 8102 [2021-04-15 00:32:26,406 INFO L226 Difference]: Without dead ends: 6950 [2021-04-15 00:32:26,406 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 187.4ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-04-15 00:32:26,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6950 states. [2021-04-15 00:32:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6950 to 6950. [2021-04-15 00:32:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6950 states, 6949 states have (on average 3.473017700388545) internal successors, (24134), 6949 states have internal predecessors, (24134), 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) [2021-04-15 00:32:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6950 states to 6950 states and 24134 transitions. [2021-04-15 00:32:26,547 INFO L78 Accepts]: Start accepts. Automaton has 6950 states and 24134 transitions. Word has length 64 [2021-04-15 00:32:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:26,547 INFO L480 AbstractCegarLoop]: Abstraction has 6950 states and 24134 transitions. [2021-04-15 00:32:26,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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) [2021-04-15 00:32:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 6950 states and 24134 transitions. [2021-04-15 00:32:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-04-15 00:32:26,561 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:26,561 INFO L551 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] [2021-04-15 00:32:26,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-15 00:32:26,562 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:26,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:26,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1744826023, now seen corresponding path program 1 times [2021-04-15 00:32:26,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:26,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077723643] [2021-04-15 00:32:26,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:26,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077723643] [2021-04-15 00:32:26,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:26,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 00:32:26,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105433028] [2021-04-15 00:32:26,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 00:32:26,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:26,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 00:32:26,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-04-15 00:32:26,735 INFO L87 Difference]: Start difference. First operand 6950 states and 24134 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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) [2021-04-15 00:32:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:27,111 INFO L93 Difference]: Finished difference Result 7982 states and 27522 transitions. [2021-04-15 00:32:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-15 00:32:27,112 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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 65 [2021-04-15 00:32:27,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:27,134 INFO L225 Difference]: With dead ends: 7982 [2021-04-15 00:32:27,134 INFO L226 Difference]: Without dead ends: 6990 [2021-04-15 00:32:27,135 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 255.2ms TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2021-04-15 00:32:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6990 states. [2021-04-15 00:32:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6990 to 6990. [2021-04-15 00:32:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6990 states, 6989 states have (on average 3.4725997996852196) internal successors, (24270), 6989 states have internal predecessors, (24270), 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) [2021-04-15 00:32:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6990 states to 6990 states and 24270 transitions. [2021-04-15 00:32:27,265 INFO L78 Accepts]: Start accepts. Automaton has 6990 states and 24270 transitions. Word has length 65 [2021-04-15 00:32:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:27,266 INFO L480 AbstractCegarLoop]: Abstraction has 6990 states and 24270 transitions. [2021-04-15 00:32:27,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 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) [2021-04-15 00:32:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 6990 states and 24270 transitions. [2021-04-15 00:32:27,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-04-15 00:32:27,275 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:27,275 INFO L551 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] [2021-04-15 00:32:27,276 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-15 00:32:27,276 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:27,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:27,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2087916074, now seen corresponding path program 1 times [2021-04-15 00:32:27,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:27,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952035499] [2021-04-15 00:32:27,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:27,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952035499] [2021-04-15 00:32:27,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:27,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-04-15 00:32:27,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202020751] [2021-04-15 00:32:27,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-04-15 00:32:27,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:27,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-04-15 00:32:27,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:32:27,436 INFO L87 Difference]: Start difference. First operand 6990 states and 24270 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 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) [2021-04-15 00:32:27,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:27,793 INFO L93 Difference]: Finished difference Result 11510 states and 39150 transitions. [2021-04-15 00:32:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-04-15 00:32:27,794 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 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 66 [2021-04-15 00:32:27,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:27,822 INFO L225 Difference]: With dead ends: 11510 [2021-04-15 00:32:27,822 INFO L226 Difference]: Without dead ends: 9190 [2021-04-15 00:32:27,823 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 175.2ms TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2021-04-15 00:32:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9190 states. [2021-04-15 00:32:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9190 to 8230. [2021-04-15 00:32:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8230 states, 8229 states have (on average 3.4305504921618666) internal successors, (28230), 8229 states have internal predecessors, (28230), 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) [2021-04-15 00:32:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8230 states to 8230 states and 28230 transitions. [2021-04-15 00:32:28,001 INFO L78 Accepts]: Start accepts. Automaton has 8230 states and 28230 transitions. Word has length 66 [2021-04-15 00:32:28,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:28,001 INFO L480 AbstractCegarLoop]: Abstraction has 8230 states and 28230 transitions. [2021-04-15 00:32:28,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 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) [2021-04-15 00:32:28,002 INFO L276 IsEmpty]: Start isEmpty. Operand 8230 states and 28230 transitions. [2021-04-15 00:32:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-04-15 00:32:28,014 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:28,014 INFO L551 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] [2021-04-15 00:32:28,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-15 00:32:28,015 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:28,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:28,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1662028339, now seen corresponding path program 1 times [2021-04-15 00:32:28,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:28,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150592067] [2021-04-15 00:32:28,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:28,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150592067] [2021-04-15 00:32:28,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:28,228 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-04-15 00:32:28,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4564975] [2021-04-15 00:32:28,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-04-15 00:32:28,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:28,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-04-15 00:32:28,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-04-15 00:32:28,229 INFO L87 Difference]: Start difference. First operand 8230 states and 28230 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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) [2021-04-15 00:32:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:28,537 INFO L93 Difference]: Finished difference Result 8854 states and 30178 transitions. [2021-04-15 00:32:28,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-15 00:32:28,538 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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 66 [2021-04-15 00:32:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:28,570 INFO L225 Difference]: With dead ends: 8854 [2021-04-15 00:32:28,570 INFO L226 Difference]: Without dead ends: 8086 [2021-04-15 00:32:28,571 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 268.2ms TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2021-04-15 00:32:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8086 states. [2021-04-15 00:32:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8086 to 8086. [2021-04-15 00:32:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8086 states, 8085 states have (on average 3.424860853432282) internal successors, (27690), 8085 states have internal predecessors, (27690), 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) [2021-04-15 00:32:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8086 states to 8086 states and 27690 transitions. [2021-04-15 00:32:28,719 INFO L78 Accepts]: Start accepts. Automaton has 8086 states and 27690 transitions. Word has length 66 [2021-04-15 00:32:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:28,719 INFO L480 AbstractCegarLoop]: Abstraction has 8086 states and 27690 transitions. [2021-04-15 00:32:28,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 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) [2021-04-15 00:32:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 8086 states and 27690 transitions. [2021-04-15 00:32:28,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-04-15 00:32:28,730 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:28,730 INFO L551 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] [2021-04-15 00:32:28,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-15 00:32:28,731 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:28,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:28,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1958102191, now seen corresponding path program 1 times [2021-04-15 00:32:28,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:28,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12437045] [2021-04-15 00:32:28,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:28,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12437045] [2021-04-15 00:32:28,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:28,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 00:32:28,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343680245] [2021-04-15 00:32:28,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 00:32:28,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:28,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 00:32:28,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 00:32:28,802 INFO L87 Difference]: Start difference. First operand 8086 states and 27690 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2021-04-15 00:32:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:28,904 INFO L93 Difference]: Finished difference Result 12414 states and 42236 transitions. [2021-04-15 00:32:28,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-15 00:32:28,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 66 [2021-04-15 00:32:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:28,918 INFO L225 Difference]: With dead ends: 12414 [2021-04-15 00:32:28,918 INFO L226 Difference]: Without dead ends: 7918 [2021-04-15 00:32:28,918 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-04-15 00:32:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7918 states. [2021-04-15 00:32:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7918 to 7318. [2021-04-15 00:32:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7318 states, 7317 states have (on average 3.359026923602569) internal successors, (24578), 7317 states have internal predecessors, (24578), 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) [2021-04-15 00:32:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7318 states to 7318 states and 24578 transitions. [2021-04-15 00:32:29,041 INFO L78 Accepts]: Start accepts. Automaton has 7318 states and 24578 transitions. Word has length 66 [2021-04-15 00:32:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:29,041 INFO L480 AbstractCegarLoop]: Abstraction has 7318 states and 24578 transitions. [2021-04-15 00:32:29,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2021-04-15 00:32:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 7318 states and 24578 transitions. [2021-04-15 00:32:29,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-04-15 00:32:29,050 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:29,051 INFO L551 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] [2021-04-15 00:32:29,051 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-15 00:32:29,051 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:29,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:29,051 INFO L82 PathProgramCache]: Analyzing trace with hash -2027369583, now seen corresponding path program 2 times [2021-04-15 00:32:29,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:29,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899985269] [2021-04-15 00:32:29,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:29,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899985269] [2021-04-15 00:32:29,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:29,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 00:32:29,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936747149] [2021-04-15 00:32:29,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 00:32:29,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:29,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 00:32:29,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 00:32:29,113 INFO L87 Difference]: Start difference. First operand 7318 states and 24578 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2021-04-15 00:32:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:29,312 INFO L93 Difference]: Finished difference Result 8902 states and 29281 transitions. [2021-04-15 00:32:29,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 00:32:29,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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 66 [2021-04-15 00:32:29,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:29,323 INFO L225 Difference]: With dead ends: 8902 [2021-04-15 00:32:29,323 INFO L226 Difference]: Without dead ends: 6262 [2021-04-15 00:32:29,323 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 63.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:32:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6262 states. [2021-04-15 00:32:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6262 to 6262. [2021-04-15 00:32:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6262 states, 6261 states have (on average 3.2767928445935155) internal successors, (20516), 6261 states have internal predecessors, (20516), 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) [2021-04-15 00:32:29,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6262 states to 6262 states and 20516 transitions. [2021-04-15 00:32:29,424 INFO L78 Accepts]: Start accepts. Automaton has 6262 states and 20516 transitions. Word has length 66 [2021-04-15 00:32:29,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:29,424 INFO L480 AbstractCegarLoop]: Abstraction has 6262 states and 20516 transitions. [2021-04-15 00:32:29,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) [2021-04-15 00:32:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 6262 states and 20516 transitions. [2021-04-15 00:32:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-04-15 00:32:29,431 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:29,431 INFO L551 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] [2021-04-15 00:32:29,432 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-15 00:32:29,432 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:29,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:29,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1540969093, now seen corresponding path program 1 times [2021-04-15 00:32:29,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:29,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54986810] [2021-04-15 00:32:29,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:29,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54986810] [2021-04-15 00:32:29,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:29,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-15 00:32:29,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793300134] [2021-04-15 00:32:29,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-15 00:32:29,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:29,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-15 00:32:29,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-04-15 00:32:29,512 INFO L87 Difference]: Start difference. First operand 6262 states and 20516 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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) [2021-04-15 00:32:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:29,616 INFO L93 Difference]: Finished difference Result 5968 states and 18853 transitions. [2021-04-15 00:32:29,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-15 00:32:29,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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 67 [2021-04-15 00:32:29,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:29,622 INFO L225 Difference]: With dead ends: 5968 [2021-04-15 00:32:29,622 INFO L226 Difference]: Without dead ends: 3940 [2021-04-15 00:32:29,623 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 72.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-04-15 00:32:29,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2021-04-15 00:32:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 3940. [2021-04-15 00:32:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3940 states, 3939 states have (on average 3.0835237369890836) internal successors, (12146), 3939 states have internal predecessors, (12146), 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) [2021-04-15 00:32:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 12146 transitions. [2021-04-15 00:32:29,675 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 12146 transitions. Word has length 67 [2021-04-15 00:32:29,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:29,675 INFO L480 AbstractCegarLoop]: Abstraction has 3940 states and 12146 transitions. [2021-04-15 00:32:29,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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) [2021-04-15 00:32:29,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 12146 transitions. [2021-04-15 00:32:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-04-15 00:32:29,680 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:29,680 INFO L551 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] [2021-04-15 00:32:29,680 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-15 00:32:29,680 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:29,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:29,681 INFO L82 PathProgramCache]: Analyzing trace with hash -803323755, now seen corresponding path program 1 times [2021-04-15 00:32:29,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:29,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213995222] [2021-04-15 00:32:29,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:29,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213995222] [2021-04-15 00:32:29,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:29,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-04-15 00:32:29,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266032989] [2021-04-15 00:32:29,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-04-15 00:32:29,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:29,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-04-15 00:32:29,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-04-15 00:32:29,816 INFO L87 Difference]: Start difference. First operand 3940 states and 12146 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 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) [2021-04-15 00:32:30,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:30,198 INFO L93 Difference]: Finished difference Result 5574 states and 17183 transitions. [2021-04-15 00:32:30,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-04-15 00:32:30,198 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 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 70 [2021-04-15 00:32:30,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:30,203 INFO L225 Difference]: With dead ends: 5574 [2021-04-15 00:32:30,204 INFO L226 Difference]: Without dead ends: 4022 [2021-04-15 00:32:30,204 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 222.1ms TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2021-04-15 00:32:30,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2021-04-15 00:32:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 4012. [2021-04-15 00:32:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4012 states, 4011 states have (on average 3.069060084766891) internal successors, (12310), 4011 states have internal predecessors, (12310), 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) [2021-04-15 00:32:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4012 states to 4012 states and 12310 transitions. [2021-04-15 00:32:30,288 INFO L78 Accepts]: Start accepts. Automaton has 4012 states and 12310 transitions. Word has length 70 [2021-04-15 00:32:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:30,288 INFO L480 AbstractCegarLoop]: Abstraction has 4012 states and 12310 transitions. [2021-04-15 00:32:30,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 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) [2021-04-15 00:32:30,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4012 states and 12310 transitions. [2021-04-15 00:32:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-04-15 00:32:30,293 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:30,293 INFO L551 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] [2021-04-15 00:32:30,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-15 00:32:30,293 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:30,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:30,294 INFO L82 PathProgramCache]: Analyzing trace with hash -746120515, now seen corresponding path program 2 times [2021-04-15 00:32:30,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:30,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834411970] [2021-04-15 00:32:30,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:30,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834411970] [2021-04-15 00:32:30,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:30,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-04-15 00:32:30,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133007175] [2021-04-15 00:32:30,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-04-15 00:32:30,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:30,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-04-15 00:32:30,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-04-15 00:32:30,524 INFO L87 Difference]: Start difference. First operand 4012 states and 12310 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 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) [2021-04-15 00:32:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:30,734 INFO L93 Difference]: Finished difference Result 4192 states and 12820 transitions. [2021-04-15 00:32:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-15 00:32:30,734 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 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 70 [2021-04-15 00:32:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:30,740 INFO L225 Difference]: With dead ends: 4192 [2021-04-15 00:32:30,740 INFO L226 Difference]: Without dead ends: 3904 [2021-04-15 00:32:30,740 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 211.6ms TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2021-04-15 00:32:30,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2021-04-15 00:32:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3904. [2021-04-15 00:32:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3904 states, 3903 states have (on average 3.061747373815014) internal successors, (11950), 3903 states have internal predecessors, (11950), 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) [2021-04-15 00:32:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 11950 transitions. [2021-04-15 00:32:30,792 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 11950 transitions. Word has length 70 [2021-04-15 00:32:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:30,792 INFO L480 AbstractCegarLoop]: Abstraction has 3904 states and 11950 transitions. [2021-04-15 00:32:30,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 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) [2021-04-15 00:32:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 11950 transitions. [2021-04-15 00:32:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-04-15 00:32:30,797 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:30,797 INFO L551 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] [2021-04-15 00:32:30,797 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-15 00:32:30,797 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:30,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:30,798 INFO L82 PathProgramCache]: Analyzing trace with hash -430341994, now seen corresponding path program 1 times [2021-04-15 00:32:30,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:30,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779590370] [2021-04-15 00:32:30,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:30,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779590370] [2021-04-15 00:32:30,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:30,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-15 00:32:30,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085538968] [2021-04-15 00:32:30,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-15 00:32:30,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:30,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-15 00:32:30,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-15 00:32:30,862 INFO L87 Difference]: Start difference. First operand 3904 states and 11950 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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) [2021-04-15 00:32:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:30,959 INFO L93 Difference]: Finished difference Result 3022 states and 8983 transitions. [2021-04-15 00:32:30,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 00:32:30,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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 70 [2021-04-15 00:32:30,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:30,962 INFO L225 Difference]: With dead ends: 3022 [2021-04-15 00:32:30,962 INFO L226 Difference]: Without dead ends: 1790 [2021-04-15 00:32:30,962 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 76.2ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-04-15 00:32:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2021-04-15 00:32:30,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1470. [2021-04-15 00:32:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1469 states have (on average 2.8658951667801227) internal successors, (4210), 1469 states have internal predecessors, (4210), 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) [2021-04-15 00:32:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 4210 transitions. [2021-04-15 00:32:30,981 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 4210 transitions. Word has length 70 [2021-04-15 00:32:30,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:30,981 INFO L480 AbstractCegarLoop]: Abstraction has 1470 states and 4210 transitions. [2021-04-15 00:32:30,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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) [2021-04-15 00:32:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 4210 transitions. [2021-04-15 00:32:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-04-15 00:32:30,983 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:30,983 INFO L551 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] [2021-04-15 00:32:30,983 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-15 00:32:30,983 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:30,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:30,984 INFO L82 PathProgramCache]: Analyzing trace with hash 444696166, now seen corresponding path program 1 times [2021-04-15 00:32:30,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:30,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522999714] [2021-04-15 00:32:30,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:31,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522999714] [2021-04-15 00:32:31,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:31,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-15 00:32:31,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17984600] [2021-04-15 00:32:31,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-15 00:32:31,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:31,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-15 00:32:31,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-04-15 00:32:31,066 INFO L87 Difference]: Start difference. First operand 1470 states and 4210 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:32:31,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:31,119 INFO L93 Difference]: Finished difference Result 2008 states and 5788 transitions. [2021-04-15 00:32:31,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-15 00:32:31,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-04-15 00:32:31,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:31,121 INFO L225 Difference]: With dead ends: 2008 [2021-04-15 00:32:31,121 INFO L226 Difference]: Without dead ends: 842 [2021-04-15 00:32:31,121 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.5ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-04-15 00:32:31,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2021-04-15 00:32:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2021-04-15 00:32:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 2.7491082045184303) internal successors, (2312), 841 states have internal predecessors, (2312), 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) [2021-04-15 00:32:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2312 transitions. [2021-04-15 00:32:31,129 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 2312 transitions. Word has length 75 [2021-04-15 00:32:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:31,129 INFO L480 AbstractCegarLoop]: Abstraction has 842 states and 2312 transitions. [2021-04-15 00:32:31,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:32:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 2312 transitions. [2021-04-15 00:32:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-04-15 00:32:31,130 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:31,130 INFO L551 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] [2021-04-15 00:32:31,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-15 00:32:31,130 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:31,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:31,131 INFO L82 PathProgramCache]: Analyzing trace with hash -22245058, now seen corresponding path program 2 times [2021-04-15 00:32:31,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:31,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17780244] [2021-04-15 00:32:31,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 00:32:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 00:32:31,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17780244] [2021-04-15 00:32:31,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 00:32:31,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-04-15 00:32:31,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685588604] [2021-04-15 00:32:31,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-04-15 00:32:31,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 00:32:31,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-04-15 00:32:31,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-04-15 00:32:31,280 INFO L87 Difference]: Start difference. First operand 842 states and 2312 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:32:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 00:32:31,461 INFO L93 Difference]: Finished difference Result 1352 states and 3814 transitions. [2021-04-15 00:32:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-04-15 00:32:31,462 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-04-15 00:32:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 00:32:31,463 INFO L225 Difference]: With dead ends: 1352 [2021-04-15 00:32:31,463 INFO L226 Difference]: Without dead ends: 762 [2021-04-15 00:32:31,464 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 170.5ms TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-04-15 00:32:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2021-04-15 00:32:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 722. [2021-04-15 00:32:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 2.7461858529819696) internal successors, (1980), 721 states have internal predecessors, (1980), 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) [2021-04-15 00:32:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1980 transitions. [2021-04-15 00:32:31,472 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1980 transitions. Word has length 75 [2021-04-15 00:32:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 00:32:31,472 INFO L480 AbstractCegarLoop]: Abstraction has 722 states and 1980 transitions. [2021-04-15 00:32:31,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 00:32:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1980 transitions. [2021-04-15 00:32:31,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-04-15 00:32:31,476 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 00:32:31,476 INFO L551 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] [2021-04-15 00:32:31,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-15 00:32:31,476 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 00:32:31,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 00:32:31,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1425727776, now seen corresponding path program 3 times [2021-04-15 00:32:31,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 00:32:31,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436273840] [2021-04-15 00:32:31,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 00:32:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 00:32:31,507 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 00:32:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 00:32:31,540 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 00:32:31,577 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-15 00:32:31,578 INFO L652 BasicCegarLoop]: Counterexample might be feasible [2021-04-15 00:32:31,578 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-04-15 00:32:31,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:32:31 BasicIcfg [2021-04-15 00:32:31,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-15 00:32:31,671 INFO L168 Benchmark]: Toolchain (without parser) took 10550.20 ms. Allocated memory was 373.3 MB in the beginning and 3.2 GB in the end (delta: 2.8 GB). Free memory was 336.2 MB in the beginning and 2.3 GB in the end (delta: -2.0 GB). Peak memory consumption was 850.8 MB. Max. memory is 16.0 GB. [2021-04-15 00:32:31,671 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 373.3 MB. Free memory was 354.7 MB in the beginning and 354.6 MB in the end (delta: 75.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-15 00:32:31,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.67 ms. Allocated memory is still 373.3 MB. Free memory was 336.1 MB in the beginning and 332.2 MB in the end (delta: 3.8 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. [2021-04-15 00:32:31,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.26 ms. Allocated memory is still 373.3 MB. Free memory was 332.2 MB in the beginning and 329.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-15 00:32:31,671 INFO L168 Benchmark]: Boogie Preprocessor took 19.25 ms. Allocated memory is still 373.3 MB. Free memory was 329.1 MB in the beginning and 327.0 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-04-15 00:32:31,671 INFO L168 Benchmark]: RCFGBuilder took 1319.43 ms. Allocated memory is still 373.3 MB. Free memory was 327.0 MB in the beginning and 253.4 MB in the end (delta: 73.5 MB). Peak memory consumption was 133.3 MB. Max. memory is 16.0 GB. [2021-04-15 00:32:31,671 INFO L168 Benchmark]: TraceAbstraction took 8752.39 ms. Allocated memory was 373.3 MB in the beginning and 3.2 GB in the end (delta: 2.8 GB). Free memory was 252.4 MB in the beginning and 2.3 GB in the end (delta: -2.0 GB). Peak memory consumption was 764.8 MB. Max. memory is 16.0 GB. [2021-04-15 00:32:31,672 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.11 ms. Allocated memory is still 373.3 MB. Free memory was 354.7 MB in the beginning and 354.6 MB in the end (delta: 75.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 423.67 ms. Allocated memory is still 373.3 MB. Free memory was 336.1 MB in the beginning and 332.2 MB in the end (delta: 3.8 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 30.26 ms. Allocated memory is still 373.3 MB. Free memory was 332.2 MB in the beginning and 329.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 19.25 ms. Allocated memory is still 373.3 MB. Free memory was 329.1 MB in the beginning and 327.0 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 1319.43 ms. Allocated memory is still 373.3 MB. Free memory was 327.0 MB in the beginning and 253.4 MB in the end (delta: 73.5 MB). Peak memory consumption was 133.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 8752.39 ms. Allocated memory was 373.3 MB in the beginning and 3.2 GB in the end (delta: 2.8 GB). Free memory was 252.4 MB in the beginning and 2.3 GB in the end (delta: -2.0 GB). Peak memory consumption was 764.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L823] 0 pthread_t t748; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L824] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, 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] [L825] 0 pthread_t t749; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, 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] [L826] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, 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] [L827] 0 pthread_t t750; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, 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] [L828] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=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] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L778] 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) [L778] 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) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 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 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 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 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L801] 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) [L801] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L801] 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) [L801] 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) [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] 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 [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 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 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L834] 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) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] 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) [L834] 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) [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L836] 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 [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 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 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L845] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L846] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L846] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L846] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L847] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L847] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L847] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L847] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L848] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L848] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L848] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L848] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L849] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L850] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L850] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L850] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L851] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8591.6ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 147.0ms, AutomataDifference: 3597.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 661.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1894 SDtfs, 2959 SDslu, 7521 SDs, 0 SdLazy, 1201 SolverSat, 262 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1104.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 2030.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=17206occurred in iteration=0, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1875.9ms AutomataMinimizationTime, 15 MinimizatonAttempts, 2152 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 51.3ms SsaConstructionTime, 445.4ms SatisfiabilityAnalysisTime, 1564.4ms InterpolantComputationTime, 1060 NumberOfCodeBlocks, 1060 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 970 ConstructedInterpolants, 0 QuantifiedInterpolants, 5762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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! Received shutdown request...