/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-12 05:32:51,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-12 05:32:51,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-12 05:32:51,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-12 05:32:51,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-12 05:32:51,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-12 05:32:51,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-12 05:32:51,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-12 05:32:51,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-12 05:32:51,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-12 05:32:51,840 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-12 05:32:51,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-12 05:32:51,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-12 05:32:51,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-12 05:32:51,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-12 05:32:51,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-12 05:32:51,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-12 05:32:51,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-12 05:32:51,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-12 05:32:51,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-12 05:32:51,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-12 05:32:51,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-12 05:32:51,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-12 05:32:51,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-12 05:32:51,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-12 05:32:51,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-12 05:32:51,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-12 05:32:51,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-12 05:32:51,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-12 05:32:51,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-12 05:32:51,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-12 05:32:51,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-12 05:32:51,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-12 05:32:51,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-12 05:32:51,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-12 05:32:51,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-12 05:32:51,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-12 05:32:51,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-12 05:32:51,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-12 05:32:51,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-12 05:32:51,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-12 05:32:51,907 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-Delay.epf [2020-11-12 05:32:51,964 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-12 05:32:51,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-12 05:32:51,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-12 05:32:51,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-12 05:32:51,969 INFO L138 SettingsManager]: * Use SBE=true [2020-11-12 05:32:51,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-12 05:32:51,970 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-12 05:32:51,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-12 05:32:51,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-12 05:32:51,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-12 05:32:51,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-12 05:32:51,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-12 05:32:51,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-12 05:32:51,972 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-12 05:32:51,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-12 05:32:51,973 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-12 05:32:51,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-12 05:32:51,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-12 05:32:51,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-12 05:32:51,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-12 05:32:51,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-12 05:32:51,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-12 05:32:51,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-12 05:32:51,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-12 05:32:51,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-12 05:32:51,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-12 05:32:51,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-12 05:32:51,976 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-11-12 05:32:51,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-12 05:32:51,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-12 05:32:51,976 INFO L138 SettingsManager]: * Sleep set reduction in concurrent analysis=DELAY_SET 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 [2020-11-12 05:32:52,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-12 05:32:52,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-12 05:32:52,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-12 05:32:52,461 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-12 05:32:52,462 INFO L275 PluginConnector]: CDTParser initialized [2020-11-12 05:32:52,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt.i [2020-11-12 05:32:52,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49ad5f45/1b43659a5e034dc9ac4ceaa99c66394d/FLAGfac90480b [2020-11-12 05:32:53,328 INFO L306 CDTParser]: Found 1 translation units. [2020-11-12 05:32:53,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt.i [2020-11-12 05:32:53,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49ad5f45/1b43659a5e034dc9ac4ceaa99c66394d/FLAGfac90480b [2020-11-12 05:32:53,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49ad5f45/1b43659a5e034dc9ac4ceaa99c66394d [2020-11-12 05:32:53,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-12 05:32:53,633 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-12 05:32:53,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-12 05:32:53,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-12 05:32:53,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-12 05:32:53,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:32:53" (1/1) ... [2020-11-12 05:32:53,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b0d51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:32:53, skipping insertion in model container [2020-11-12 05:32:53,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:32:53" (1/1) ... [2020-11-12 05:32:53,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-12 05:32:53,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-12 05:32:54,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 05:32:54,185 INFO L203 MainTranslator]: Completed pre-run [2020-11-12 05:32:54,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 05:32:54,468 INFO L208 MainTranslator]: Completed translation [2020-11-12 05:32:54,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:32:54 WrapperNode [2020-11-12 05:32:54,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-12 05:32:54,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-12 05:32:54,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-12 05:32:54,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-12 05:32:54,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:32:54" (1/1) ... [2020-11-12 05:32:54,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:32:54" (1/1) ... [2020-11-12 05:32:54,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-12 05:32:54,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-12 05:32:54,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-12 05:32:54,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-12 05:32:54,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:32:54" (1/1) ... [2020-11-12 05:32:54,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:32:54" (1/1) ... [2020-11-12 05:32:54,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:32:54" (1/1) ... [2020-11-12 05:32:54,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:32:54" (1/1) ... [2020-11-12 05:32:54,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:32:54" (1/1) ... [2020-11-12 05:32:54,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:32:54" (1/1) ... [2020-11-12 05:32:54,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:32:54" (1/1) ... [2020-11-12 05:32:54,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-12 05:32:54,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-12 05:32:54,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-12 05:32:54,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-12 05:32:54,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:32:54" (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 [2020-11-12 05:32:54,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-12 05:32:54,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-12 05:32:54,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-12 05:32:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-12 05:32:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-12 05:32:54,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-12 05:32:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-12 05:32:54,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-12 05:32:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-12 05:32:54,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-12 05:32:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-12 05:32:54,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-12 05:32:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-12 05:32:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-12 05:32:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-12 05:32:54,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-12 05:32:54,803 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-12 05:32:58,050 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-12 05:32:58,050 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-12 05:32:58,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:32:58 BoogieIcfgContainer [2020-11-12 05:32:58,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-12 05:32:58,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-12 05:32:58,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-12 05:32:58,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-12 05:32:58,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:32:53" (1/3) ... [2020-11-12 05:32:58,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13dd6893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:32:58, skipping insertion in model container [2020-11-12 05:32:58,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:32:54" (2/3) ... [2020-11-12 05:32:58,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13dd6893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:32:58, skipping insertion in model container [2020-11-12 05:32:58,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:32:58" (3/3) ... [2020-11-12 05:32:58,063 INFO L111 eAbstractionObserver]: Analyzing ICFG mix026_power.opt.i [2020-11-12 05:32:58,081 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-12 05:32:58,081 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-12 05:32:58,085 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-12 05:32:58,086 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-12 05:32:58,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,160 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,160 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,160 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,161 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,184 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,184 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,184 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,185 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,185 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,186 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,187 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,189 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,196 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,200 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,201 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,201 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,201 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,202 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,202 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,202 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,203 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,204 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,205 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,206 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,207 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,210 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,212 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,221 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,222 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,222 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,227 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,227 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,230 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,231 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,231 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,231 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,231 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,232 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,232 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,232 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,232 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,232 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:32:58,235 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-12 05:32:58,249 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-12 05:32:58,273 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 05:32:58,274 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 05:32:58,274 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 05:32:58,274 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 05:32:58,274 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 05:32:58,274 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 05:32:58,274 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 05:32:58,274 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 05:32:58,289 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131 places, 121 transitions, 262 flow [2020-11-12 05:33:50,069 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 142955 states, 142951 states have (on average 4.556288518443383) internal successors, (651326), 142954 states have internal predecessors, (651326), 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) [2020-11-12 05:33:50,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-12 05:33:50,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:50,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-12 05:33:50,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:50,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:33:50,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:50,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:50,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:50,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:50,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:50,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:33:50,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:50,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:50,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:50,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:50,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:50,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:33:50,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:50,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:33:50,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:50,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:33:50,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:50,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:33:50,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:50,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:33:50,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:50,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:33:50,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:50,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:50,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:33:50,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:33:50,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:51,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:51,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:51,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:51,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:51,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:33:51,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:51,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:51,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:51,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:51,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:51,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:51,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:51,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:33:51,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:51,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:51,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:51,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:33:51,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:33:51,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:51,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:33:51,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:33:51,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:33:51,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:33:51,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:51,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:51,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:51,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:51,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:51,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:51,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:51,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:51,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:51,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:51,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:51,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:51,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:51,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:51,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:51,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:51,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:51,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:51,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:51,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:51,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:51,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:51,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:51,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:51,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:33:51,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:33:51,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:51,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:51,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:51,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:51,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:51,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:51,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:33:51,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:51,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:51,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:51,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:52,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:52,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:52,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:52,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:33:52,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:52,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:52,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:52,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:33:52,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:33:52,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:52,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:33:52,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:33:52,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:33:52,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:33:52,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:52,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:52,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:33:52,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:33:52,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:52,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:52,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:52,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:52,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:33:52,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:52,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:52,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:52,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:52,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:52,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:52,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:52,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:52,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:33:52,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:52,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:52,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:52,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:53,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:53,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:33:53,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:33:53,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:53,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:53,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:53,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:53,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:53,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:53,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:53,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:53,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:53,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:53,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:53,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:53,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:53,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:53,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:53,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:53,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:53,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:33:53,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:54,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:33:54,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:54,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:33:54,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:54,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:33:54,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:54,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:54,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:54,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:54,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:54,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:54,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:54,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:54,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:54,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:54,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:54,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:54,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:54,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:54,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:54,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:54,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:54,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:54,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:54,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:54,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:54,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:54,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:54,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:54,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:54,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:54,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:54,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:54,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:54,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:54,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:54,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:54,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:33:54,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:54,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:33:54,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:33:54,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:54,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:33:54,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:54,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:54,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:54,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:54,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:54,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:54,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:54,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:33:54,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:54,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:54,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:54,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:54,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:54,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:33:54,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:33:54,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:54,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:54,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:54,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:54,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:33:54,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:33:54,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:33:54,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:54,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:54,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:54,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:54,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:55,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:33:55,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:33:55,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:33:55,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:33:59,038 WARN L455 BasicCegarLoop]: Sleep Set Reduction Time: 8963ms [2020-11-12 05:33:59,193 WARN L456 BasicCegarLoop]: Sleep set: input automaton has 142955 states, 142951 states have (on average 4.556288518443383) internal successors, (651326), 142954 states have internal predecessors, (651326), 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) [2020-11-12 05:33:59,524 WARN L457 BasicCegarLoop]: Sleep set: output automaton has 142955 states, 127035 states have (on average 2.897965127720707) internal successors, (368143), 142954 states have internal predecessors, (368143), 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) [2020-11-12 05:34:00,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 142955 states, 127035 states have (on average 2.897965127720707) internal successors, (368143), 142954 states have internal predecessors, (368143), 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) [2020-11-12 05:34:00,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-12 05:34:00,021 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:34:00,022 INFO L494 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] [2020-11-12 05:34:00,023 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:34:00,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:34:00,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1840944912, now seen corresponding path program 1 times [2020-11-12 05:34:00,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:34:00,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368393049] [2020-11-12 05:34:00,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:34:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:34:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:34:00,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368393049] [2020-11-12 05:34:00,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:34:00,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-12 05:34:00,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405615755] [2020-11-12 05:34:00,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 05:34:00,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:34:00,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 05:34:00,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 05:34:00,613 INFO L87 Difference]: Start difference. First operand has 142955 states, 127035 states have (on average 2.897965127720707) internal successors, (368143), 142954 states have internal predecessors, (368143), 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 24.5) internal successors, (49), 3 states have internal predecessors, (49), 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) [2020-11-12 05:34:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:34:02,293 INFO L93 Difference]: Finished difference Result 119015 states and 298920 transitions. [2020-11-12 05:34:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 05:34:02,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2020-11-12 05:34:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:34:02,657 INFO L225 Difference]: With dead ends: 119015 [2020-11-12 05:34:02,658 INFO L226 Difference]: Without dead ends: 47992 [2020-11-12 05:34:02,660 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 05:34:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47992 states. [2020-11-12 05:34:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47992 to 47992. [2020-11-12 05:34:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47992 states, 47544 states have (on average 2.809944472488642) internal successors, (133596), 47991 states have internal predecessors, (133596), 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) [2020-11-12 05:34:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47992 states to 47992 states and 133596 transitions. [2020-11-12 05:34:05,543 INFO L78 Accepts]: Start accepts. Automaton has 47992 states and 133596 transitions. Word has length 49 [2020-11-12 05:34:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:34:05,544 INFO L481 AbstractCegarLoop]: Abstraction has 47992 states and 133596 transitions. [2020-11-12 05:34:05,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 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) [2020-11-12 05:34:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 47992 states and 133596 transitions. [2020-11-12 05:34:05,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-12 05:34:05,583 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:34:05,583 INFO L494 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] [2020-11-12 05:34:05,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-12 05:34:05,584 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:34:05,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:34:05,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1117153068, now seen corresponding path program 1 times [2020-11-12 05:34:05,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:34:05,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640500394] [2020-11-12 05:34:05,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:34:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:34:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:34:05,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640500394] [2020-11-12 05:34:05,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:34:05,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 05:34:05,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398687143] [2020-11-12 05:34:05,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 05:34:05,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:34:05,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 05:34:05,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 05:34:05,891 INFO L87 Difference]: Start difference. First operand 47992 states and 133596 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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) [2020-11-12 05:34:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:34:07,036 INFO L93 Difference]: Finished difference Result 49784 states and 144440 transitions. [2020-11-12 05:34:07,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 05:34:07,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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 [2020-11-12 05:34:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:34:07,402 INFO L225 Difference]: With dead ends: 49784 [2020-11-12 05:34:07,402 INFO L226 Difference]: Without dead ends: 37240 [2020-11-12 05:34:07,403 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:34:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37240 states. [2020-11-12 05:34:08,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37240 to 37240. [2020-11-12 05:34:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37240 states, 36792 states have (on average 2.841813437703849) internal successors, (104556), 37239 states have internal predecessors, (104556), 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) [2020-11-12 05:34:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37240 states to 37240 states and 104556 transitions. [2020-11-12 05:34:08,947 INFO L78 Accepts]: Start accepts. Automaton has 37240 states and 104556 transitions. Word has length 70 [2020-11-12 05:34:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:34:08,948 INFO L481 AbstractCegarLoop]: Abstraction has 37240 states and 104556 transitions. [2020-11-12 05:34:08,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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) [2020-11-12 05:34:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 37240 states and 104556 transitions. [2020-11-12 05:34:08,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-12 05:34:08,993 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:34:08,993 INFO L494 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] [2020-11-12 05:34:08,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-12 05:34:08,994 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:34:08,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:34:08,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1239419674, now seen corresponding path program 1 times [2020-11-12 05:34:08,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:34:08,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140515566] [2020-11-12 05:34:08,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:34:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:34:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:34:09,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140515566] [2020-11-12 05:34:09,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:34:09,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 05:34:09,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800299536] [2020-11-12 05:34:09,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 05:34:09,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:34:09,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 05:34:09,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 05:34:09,282 INFO L87 Difference]: Start difference. First operand 37240 states and 104556 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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) [2020-11-12 05:34:09,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:34:09,764 INFO L93 Difference]: Finished difference Result 43784 states and 114963 transitions. [2020-11-12 05:34:09,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 05:34:09,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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 73 [2020-11-12 05:34:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:34:09,859 INFO L225 Difference]: With dead ends: 43784 [2020-11-12 05:34:09,859 INFO L226 Difference]: Without dead ends: 31240 [2020-11-12 05:34:09,860 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:34:10,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31240 states. [2020-11-12 05:34:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31240 to 31240. [2020-11-12 05:34:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31240 states, 30792 states have (on average 2.8378150168875034) internal successors, (87382), 31239 states have internal predecessors, (87382), 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) [2020-11-12 05:34:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 87382 transitions. [2020-11-12 05:34:11,145 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 87382 transitions. Word has length 73 [2020-11-12 05:34:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:34:11,145 INFO L481 AbstractCegarLoop]: Abstraction has 31240 states and 87382 transitions. [2020-11-12 05:34:11,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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) [2020-11-12 05:34:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 87382 transitions. [2020-11-12 05:34:11,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-12 05:34:11,183 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:34:11,183 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:34:11,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-12 05:34:11,184 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:34:11,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:34:11,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1966462671, now seen corresponding path program 1 times [2020-11-12 05:34:11,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:34:11,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598602746] [2020-11-12 05:34:11,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:34:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:34:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:34:11,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598602746] [2020-11-12 05:34:11,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:34:11,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 05:34:11,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236891042] [2020-11-12 05:34:11,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 05:34:11,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:34:11,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 05:34:11,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-12 05:34:11,851 INFO L87 Difference]: Start difference. First operand 31240 states and 87382 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:34:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:34:12,334 INFO L93 Difference]: Finished difference Result 28084 states and 71456 transitions. [2020-11-12 05:34:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-12 05:34:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2020-11-12 05:34:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:34:12,389 INFO L225 Difference]: With dead ends: 28084 [2020-11-12 05:34:12,389 INFO L226 Difference]: Without dead ends: 17825 [2020-11-12 05:34:12,390 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-11-12 05:34:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17825 states. [2020-11-12 05:34:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17825 to 17825. [2020-11-12 05:34:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17825 states, 17477 states have (on average 2.76964009841506) internal successors, (48405), 17824 states have internal predecessors, (48405), 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) [2020-11-12 05:34:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17825 states to 17825 states and 48405 transitions. [2020-11-12 05:34:12,967 INFO L78 Accepts]: Start accepts. Automaton has 17825 states and 48405 transitions. Word has length 76 [2020-11-12 05:34:12,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:34:12,968 INFO L481 AbstractCegarLoop]: Abstraction has 17825 states and 48405 transitions. [2020-11-12 05:34:12,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:34:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 17825 states and 48405 transitions. [2020-11-12 05:34:12,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-12 05:34:12,996 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:34:12,996 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:34:12,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-12 05:34:12,996 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:34:12,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:34:12,997 INFO L82 PathProgramCache]: Analyzing trace with hash 780551121, now seen corresponding path program 1 times [2020-11-12 05:34:12,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:34:12,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019834729] [2020-11-12 05:34:12,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:34:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:34:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:34:13,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019834729] [2020-11-12 05:34:13,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:34:13,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 05:34:13,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396141638] [2020-11-12 05:34:13,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 05:34:13,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:34:13,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 05:34:13,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-12 05:34:13,285 INFO L87 Difference]: Start difference. First operand 17825 states and 48405 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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) [2020-11-12 05:34:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:34:13,618 INFO L93 Difference]: Finished difference Result 27645 states and 80518 transitions. [2020-11-12 05:34:13,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 05:34:13,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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 80 [2020-11-12 05:34:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:34:13,926 INFO L225 Difference]: With dead ends: 27645 [2020-11-12 05:34:13,927 INFO L226 Difference]: Without dead ends: 19265 [2020-11-12 05:34:13,928 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:34:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19265 states. [2020-11-12 05:34:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19265 to 15755. [2020-11-12 05:34:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15755 states, 15407 states have (on average 2.88342960991757) internal successors, (44425), 15754 states have internal predecessors, (44425), 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) [2020-11-12 05:34:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15755 states to 15755 states and 44425 transitions. [2020-11-12 05:34:14,468 INFO L78 Accepts]: Start accepts. Automaton has 15755 states and 44425 transitions. Word has length 80 [2020-11-12 05:34:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:34:14,469 INFO L481 AbstractCegarLoop]: Abstraction has 15755 states and 44425 transitions. [2020-11-12 05:34:14,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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) [2020-11-12 05:34:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 15755 states and 44425 transitions. [2020-11-12 05:34:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-12 05:34:14,492 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:34:14,493 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:34:14,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-12 05:34:14,493 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:34:14,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:34:14,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1831814387, now seen corresponding path program 2 times [2020-11-12 05:34:14,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:34:14,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648306176] [2020-11-12 05:34:14,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:34:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:34:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:34:14,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648306176] [2020-11-12 05:34:14,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:34:14,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 05:34:14,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399311226] [2020-11-12 05:34:14,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 05:34:14,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:34:14,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 05:34:14,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-12 05:34:14,850 INFO L87 Difference]: Start difference. First operand 15755 states and 44425 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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) [2020-11-12 05:34:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:34:15,245 INFO L93 Difference]: Finished difference Result 10073 states and 25242 transitions. [2020-11-12 05:34:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 05:34:15,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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 80 [2020-11-12 05:34:15,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:34:15,255 INFO L225 Difference]: With dead ends: 10073 [2020-11-12 05:34:15,255 INFO L226 Difference]: Without dead ends: 5720 [2020-11-12 05:34:15,255 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2020-11-12 05:34:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5720 states. [2020-11-12 05:34:15,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5720 to 5720. [2020-11-12 05:34:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5720 states, 5567 states have (on average 2.647566014011137) internal successors, (14739), 5719 states have internal predecessors, (14739), 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) [2020-11-12 05:34:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5720 states to 5720 states and 14739 transitions. [2020-11-12 05:34:15,358 INFO L78 Accepts]: Start accepts. Automaton has 5720 states and 14739 transitions. Word has length 80 [2020-11-12 05:34:15,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:34:15,359 INFO L481 AbstractCegarLoop]: Abstraction has 5720 states and 14739 transitions. [2020-11-12 05:34:15,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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) [2020-11-12 05:34:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 5720 states and 14739 transitions. [2020-11-12 05:34:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-11-12 05:34:15,366 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:34:15,366 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:34:15,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-12 05:34:15,366 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:34:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:34:15,366 INFO L82 PathProgramCache]: Analyzing trace with hash -466366667, now seen corresponding path program 1 times [2020-11-12 05:34:15,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:34:15,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606131929] [2020-11-12 05:34:15,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:34:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:34:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:34:15,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606131929] [2020-11-12 05:34:15,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:34:15,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 05:34:15,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058897363] [2020-11-12 05:34:15,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 05:34:15,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:34:15,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 05:34:15,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 05:34:15,619 INFO L87 Difference]: Start difference. First operand 5720 states and 14739 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:34:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:34:16,055 INFO L93 Difference]: Finished difference Result 3416 states and 7719 transitions. [2020-11-12 05:34:16,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-12 05:34:16,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2020-11-12 05:34:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:34:16,058 INFO L225 Difference]: With dead ends: 3416 [2020-11-12 05:34:16,058 INFO L226 Difference]: Without dead ends: 1259 [2020-11-12 05:34:16,058 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2020-11-12 05:34:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2020-11-12 05:34:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1259. [2020-11-12 05:34:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1232 states have (on average 2.4537337662337664) internal successors, (3023), 1258 states have internal predecessors, (3023), 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) [2020-11-12 05:34:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 3023 transitions. [2020-11-12 05:34:16,198 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 3023 transitions. Word has length 85 [2020-11-12 05:34:16,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:34:16,198 INFO L481 AbstractCegarLoop]: Abstraction has 1259 states and 3023 transitions. [2020-11-12 05:34:16,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:34:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 3023 transitions. [2020-11-12 05:34:16,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-12 05:34:16,206 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:34:16,206 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:34:16,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-12 05:34:16,206 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:34:16,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:34:16,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1850253565, now seen corresponding path program 1 times [2020-11-12 05:34:16,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:34:16,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939030824] [2020-11-12 05:34:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:34:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:34:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:34:16,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939030824] [2020-11-12 05:34:16,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:34:16,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 05:34:16,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618701897] [2020-11-12 05:34:16,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 05:34:16,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:34:16,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 05:34:16,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-12 05:34:16,464 INFO L87 Difference]: Start difference. First operand 1259 states and 3023 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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) [2020-11-12 05:34:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:34:16,638 INFO L93 Difference]: Finished difference Result 2006 states and 4932 transitions. [2020-11-12 05:34:16,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 05:34:16,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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 90 [2020-11-12 05:34:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:34:16,641 INFO L225 Difference]: With dead ends: 2006 [2020-11-12 05:34:16,641 INFO L226 Difference]: Without dead ends: 1079 [2020-11-12 05:34:16,642 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:34:16,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2020-11-12 05:34:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2020-11-12 05:34:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1052 states have (on average 2.4600760456273765) internal successors, (2588), 1078 states have internal predecessors, (2588), 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) [2020-11-12 05:34:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 2588 transitions. [2020-11-12 05:34:16,666 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 2588 transitions. Word has length 90 [2020-11-12 05:34:16,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:34:16,666 INFO L481 AbstractCegarLoop]: Abstraction has 1079 states and 2588 transitions. [2020-11-12 05:34:16,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 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) [2020-11-12 05:34:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 2588 transitions. [2020-11-12 05:34:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-12 05:34:16,669 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:34:16,669 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:34:16,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-12 05:34:16,670 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:34:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:34:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1794074457, now seen corresponding path program 2 times [2020-11-12 05:34:16,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:34:16,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938873576] [2020-11-12 05:34:16,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:34:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:34:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:34:16,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938873576] [2020-11-12 05:34:16,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:34:16,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 05:34:16,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215918757] [2020-11-12 05:34:16,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 05:34:16,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:34:16,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 05:34:16,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 05:34:16,885 INFO L87 Difference]: Start difference. First operand 1079 states and 2588 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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) [2020-11-12 05:34:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:34:17,017 INFO L93 Difference]: Finished difference Result 1701 states and 4233 transitions. [2020-11-12 05:34:17,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 05:34:17,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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 90 [2020-11-12 05:34:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:34:17,019 INFO L225 Difference]: With dead ends: 1701 [2020-11-12 05:34:17,020 INFO L226 Difference]: Without dead ends: 909 [2020-11-12 05:34:17,020 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-12 05:34:17,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2020-11-12 05:34:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2020-11-12 05:34:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 882 states have (on average 2.4716553287981857) internal successors, (2180), 908 states have internal predecessors, (2180), 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) [2020-11-12 05:34:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 2180 transitions. [2020-11-12 05:34:17,039 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 2180 transitions. Word has length 90 [2020-11-12 05:34:17,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:34:17,040 INFO L481 AbstractCegarLoop]: Abstraction has 909 states and 2180 transitions. [2020-11-12 05:34:17,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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) [2020-11-12 05:34:17,040 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 2180 transitions. [2020-11-12 05:34:17,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-12 05:34:17,042 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:34:17,042 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:34:17,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-12 05:34:17,042 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:34:17,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:34:17,043 INFO L82 PathProgramCache]: Analyzing trace with hash -977881245, now seen corresponding path program 3 times [2020-11-12 05:34:17,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:34:17,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918488066] [2020-11-12 05:34:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:34:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 05:34:17,145 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 05:34:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 05:34:17,249 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 05:34:17,332 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-12 05:34:17,333 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-12 05:34:17,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-12 05:34:17,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:34:17 BasicIcfg [2020-11-12 05:34:17,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-12 05:34:17,579 INFO L168 Benchmark]: Toolchain (without parser) took 83951.47 ms. Allocated memory was 302.0 MB in the beginning and 10.0 GB in the end (delta: 9.7 GB). Free memory was 276.9 MB in the beginning and 8.2 GB in the end (delta: -7.9 GB). Peak memory consumption was 1.8 GB. Max. memory is 16.0 GB. [2020-11-12 05:34:17,579 INFO L168 Benchmark]: CDTParser took 0.81 ms. Allocated memory is still 302.0 MB. Free memory was 272.7 MB in the beginning and 272.6 MB in the end (delta: 65.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2020-11-12 05:34:17,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.48 ms. Allocated memory is still 302.0 MB. Free memory was 276.4 MB in the beginning and 279.7 MB in the end (delta: -3.3 MB). Peak memory consumption was 37.9 MB. Max. memory is 16.0 GB. [2020-11-12 05:34:17,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.57 ms. Allocated memory is still 302.0 MB. Free memory was 279.7 MB in the beginning and 277.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-12 05:34:17,581 INFO L168 Benchmark]: Boogie Preprocessor took 90.89 ms. Allocated memory is still 302.0 MB. Free memory was 277.6 MB in the beginning and 274.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-12 05:34:17,582 INFO L168 Benchmark]: RCFGBuilder took 3345.90 ms. Allocated memory was 302.0 MB in the beginning and 394.3 MB in the end (delta: 92.3 MB). Free memory was 274.4 MB in the beginning and 306.7 MB in the end (delta: -32.3 MB). Peak memory consumption was 171.2 MB. Max. memory is 16.0 GB. [2020-11-12 05:34:17,583 INFO L168 Benchmark]: TraceAbstraction took 79521.05 ms. Allocated memory was 394.3 MB in the beginning and 10.0 GB in the end (delta: 9.6 GB). Free memory was 306.7 MB in the beginning and 8.2 GB in the end (delta: -7.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 16.0 GB. [2020-11-12 05:34:17,587 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.81 ms. Allocated memory is still 302.0 MB. Free memory was 272.7 MB in the beginning and 272.6 MB in the end (delta: 65.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 832.48 ms. Allocated memory is still 302.0 MB. Free memory was 276.4 MB in the beginning and 279.7 MB in the end (delta: -3.3 MB). Peak memory consumption was 37.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 143.57 ms. Allocated memory is still 302.0 MB. Free memory was 279.7 MB in the beginning and 277.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 90.89 ms. Allocated memory is still 302.0 MB. Free memory was 277.6 MB in the beginning and 274.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 3345.90 ms. Allocated memory was 302.0 MB in the beginning and 394.3 MB in the end (delta: 92.3 MB). Free memory was 274.4 MB in the beginning and 306.7 MB in the end (delta: -32.3 MB). Peak memory consumption was 171.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 79521.05 ms. Allocated memory was 394.3 MB in the beginning and 10.0 GB in the end (delta: 9.6 GB). Free memory was 306.7 MB in the beginning and 8.2 GB in the end (delta: -7.9 GB). Peak memory consumption was 1.7 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L713] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L717] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L719] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L721] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L727] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L728] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L729] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L730] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L731] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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] [L732] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0] [L733] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0] [L734] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L735] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L736] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L737] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L738] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L739] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L740] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L741] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L742] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L743] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L745] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L747] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L748] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L749] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L862] 0 pthread_t t685; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L864] 0 pthread_t t686; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L866] 0 pthread_t t687; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L868] 0 pthread_t t688; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L817] 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) [L817] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L817] 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) [L817] 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) [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] 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 [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L821] 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 [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 4 z = 2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 a = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L840] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L797] 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) [L797] 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) [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L799] 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 [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L801] 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 [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L875] 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) [L875] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L875] 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) [L875] 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) [L876] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L877] 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 [L878] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L879] 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 [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L18] 0 __assert_fail ("0", "mix026_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 79.0s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 61.2s, HoareTripleCheckerStatistics: 1253 SDtfs, 1618 SDslu, 3723 SDs, 0 SdLazy, 360 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142955occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 3510 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 783 NumberOfCodeBlocks, 783 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 125332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...