/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_rmo.opt.0.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 21:47:43,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 21:47:43,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 21:47:43,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 21:47:43,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 21:47:43,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 21:47:43,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 21:47:43,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 21:47:43,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 21:47:43,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 21:47:43,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 21:47:43,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 21:47:43,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 21:47:43,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 21:47:43,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 21:47:43,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 21:47:43,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 21:47:43,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 21:47:43,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 21:47:43,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 21:47:43,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 21:47:43,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 21:47:43,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 21:47:43,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 21:47:43,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 21:47:43,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 21:47:43,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 21:47:43,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 21:47:43,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 21:47:43,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 21:47:43,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 21:47:43,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 21:47:43,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 21:47:43,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 21:47:43,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 21:47:43,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 21:47:43,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 21:47:43,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 21:47:43,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 21:47:43,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 21:47:43,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 21:47:43,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-21 21:47:43,662 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 21:47:43,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 21:47:43,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 21:47:43,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 21:47:43,665 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 21:47:43,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 21:47:43,665 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 21:47:43,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 21:47:43,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 21:47:43,666 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 21:47:43,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 21:47:43,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 21:47:43,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 21:47:43,666 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 21:47:43,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 21:47:43,667 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 21:47:43,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 21:47:43,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 21:47:43,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 21:47:43,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 21:47:43,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 21:47:43,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 21:47:43,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 21:47:43,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-21 21:47:43,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 21:47:43,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 21:47:43,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 21:47:43,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 21:47:43,670 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-21 21:47:43,670 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-21 21:47:44,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 21:47:44,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 21:47:44,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 21:47:44,026 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 21:47:44,027 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 21:47:44,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_rmo.opt.0.i [2020-10-21 21:47:44,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18243b0d9/c603ed6105b941e7865d300f08914174/FLAG9fa6a983d [2020-10-21 21:47:44,682 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 21:47:44,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_rmo.opt.0.i [2020-10-21 21:47:44,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18243b0d9/c603ed6105b941e7865d300f08914174/FLAG9fa6a983d [2020-10-21 21:47:44,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18243b0d9/c603ed6105b941e7865d300f08914174 [2020-10-21 21:47:44,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 21:47:44,958 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 21:47:44,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 21:47:44,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 21:47:44,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 21:47:44,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:47:44" (1/1) ... [2020-10-21 21:47:44,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2f7a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:47:44, skipping insertion in model container [2020-10-21 21:47:44,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:47:44" (1/1) ... [2020-10-21 21:47:44,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 21:47:45,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 21:47:45,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:47:45,554 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 21:47:45,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:47:45,766 INFO L208 MainTranslator]: Completed translation [2020-10-21 21:47:45,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:47:45 WrapperNode [2020-10-21 21:47:45,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 21:47:45,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 21:47:45,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 21:47:45,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 21:47:45,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:47:45" (1/1) ... [2020-10-21 21:47:45,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:47:45" (1/1) ... [2020-10-21 21:47:45,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 21:47:45,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 21:47:45,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 21:47:45,851 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 21:47:45,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:47:45" (1/1) ... [2020-10-21 21:47:45,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:47:45" (1/1) ... [2020-10-21 21:47:45,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:47:45" (1/1) ... [2020-10-21 21:47:45,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:47:45" (1/1) ... [2020-10-21 21:47:45,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:47:45" (1/1) ... [2020-10-21 21:47:45,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:47:45" (1/1) ... [2020-10-21 21:47:45,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:47:45" (1/1) ... [2020-10-21 21:47:45,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 21:47:45,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 21:47:45,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 21:47:45,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 21:47:45,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:47:45" (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-10-21 21:47:45,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 21:47:45,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 21:47:45,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 21:47:45,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 21:47:45,979 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 21:47:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 21:47:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 21:47:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 21:47:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 21:47:45,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 21:47:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 21:47:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 21:47:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 21:47:45,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 21:47:45,984 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 21:47:48,604 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 21:47:48,604 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 21:47:48,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:47:48 BoogieIcfgContainer [2020-10-21 21:47:48,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 21:47:48,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 21:47:48,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 21:47:48,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 21:47:48,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 09:47:44" (1/3) ... [2020-10-21 21:47:48,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d3ba990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:47:48, skipping insertion in model container [2020-10-21 21:47:48,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:47:45" (2/3) ... [2020-10-21 21:47:48,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d3ba990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:47:48, skipping insertion in model container [2020-10-21 21:47:48,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:47:48" (3/3) ... [2020-10-21 21:47:48,617 INFO L111 eAbstractionObserver]: Analyzing ICFG mix003_rmo.opt.0.i [2020-10-21 21:47:48,629 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 21:47:48,629 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-21 21:47:48,638 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 21:47:48,639 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 21:47:48,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,680 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,680 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,681 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,681 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,681 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,682 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,683 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,695 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,695 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,696 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,697 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,711 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,712 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,713 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,719 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,722 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,726 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,727 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,727 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,728 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,734 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,735 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:47:48,737 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 21:47:48,752 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-21 21:47:48,775 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 21:47:48,776 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 21:47:48,776 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-21 21:47:48,776 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 21:47:48,776 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 21:47:48,776 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 21:47:48,777 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 21:47:48,777 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 21:47:48,793 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-21 21:47:48,797 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 105 transitions, 225 flow [2020-10-21 21:47:48,801 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 105 transitions, 225 flow [2020-10-21 21:47:48,803 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 112 places, 105 transitions, 225 flow [2020-10-21 21:47:48,908 INFO L129 PetriNetUnfolder]: 3/102 cut-off events. [2020-10-21 21:47:48,908 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 21:47:48,914 INFO L80 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 3/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-21 21:47:48,918 INFO L116 LiptonReduction]: Number of co-enabled transitions 1834 [2020-10-21 21:47:49,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:47:49,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:49,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:49,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:49,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:49,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:47:49,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:47:49,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:47:49,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:49,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:49,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:49,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:49,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:49,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:47:49,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:47:49,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:47:49,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:47:49,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:49,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:47:49,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:47:49,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:47:49,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:49,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:47:49,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:49,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:47:49,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:47:49,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:47:49,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:47:49,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:47:49,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:47:49,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:47:49,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:49,271 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-10-21 21:47:49,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:49,273 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-10-21 21:47:49,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:49,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:49,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:49,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:47:49,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:47:49,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:47:49,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:47:49,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:47:49,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:47:49,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:47:49,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:49,452 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-10-21 21:47:49,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:49,454 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-10-21 21:47:49,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:49,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:47:49,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-21 21:47:49,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:47:49,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:50,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:47:50,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:50,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:50,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:50,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:50,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:47:50,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:47:50,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:47:50,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:50,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:50,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:50,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:50,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:50,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:47:50,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:47:50,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:47:50,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:47:50,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:50,676 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-21 21:47:50,811 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 21:47:50,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:47:50,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:50,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-21 21:47:50,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:50,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-21 21:47:50,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:51,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:47:51,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:51,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-21 21:47:51,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:51,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-21 21:47:51,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:51,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:47:51,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:47:51,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:47:51,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:51,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:51,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:51,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:47:51,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:47:51,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:47:51,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:47:51,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:47:51,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:47:51,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:47:51,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:51,639 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-10-21 21:47:51,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:51,641 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-10-21 21:47:51,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:51,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:47:51,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:51,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:51,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:51,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:51,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:47:51,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:47:51,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:47:51,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:51,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:51,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:51,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:51,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:51,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:51,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:47:51,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:51,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:51,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:51,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:51,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:51,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:51,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:51,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:47:51,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:51,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:47:51,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:51,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:51,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:51,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:51,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:47:51,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:47:51,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:47:52,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:47:52,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:52,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:47:52,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:47:52,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:47:52,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:47:52,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:47:52,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:47:52,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:47:52,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:52,186 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-10-21 21:47:52,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:52,189 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-10-21 21:47:52,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:47:52,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:47:52,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:47:52,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:47:52,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:47:52,719 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-21 21:47:53,784 WARN L193 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-10-21 21:47:53,984 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-21 21:47:54,135 INFO L131 LiptonReduction]: Checked pairs total: 4926 [2020-10-21 21:47:54,136 INFO L133 LiptonReduction]: Total number of compositions: 96 [2020-10-21 21:47:54,143 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-21 21:47:54,191 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 750 states. [2020-10-21 21:47:54,193 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2020-10-21 21:47:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 21:47:54,201 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:47:54,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:47:54,202 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:47:54,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:47:54,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1458904489, now seen corresponding path program 1 times [2020-10-21 21:47:54,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:47:54,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856557115] [2020-10-21 21:47:54,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:47:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:47:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:47:54,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856557115] [2020-10-21 21:47:54,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:47:54,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:47:54,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097723391] [2020-10-21 21:47:54,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:47:54,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:47:54,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:47:54,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:47:54,515 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2020-10-21 21:47:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:47:54,651 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-10-21 21:47:54,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:47:54,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 21:47:54,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:47:54,691 INFO L225 Difference]: With dead ends: 650 [2020-10-21 21:47:54,691 INFO L226 Difference]: Without dead ends: 530 [2020-10-21 21:47:54,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:47:54,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-21 21:47:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-21 21:47:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-21 21:47:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2020-10-21 21:47:54,798 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2020-10-21 21:47:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:47:54,799 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2020-10-21 21:47:54,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:47:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2020-10-21 21:47:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 21:47:54,801 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:47:54,801 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:47:54,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 21:47:54,802 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:47:54,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:47:54,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1847941690, now seen corresponding path program 1 times [2020-10-21 21:47:54,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:47:54,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946674291] [2020-10-21 21:47:54,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:47:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:47:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:47:54,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946674291] [2020-10-21 21:47:54,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:47:54,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:47:54,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307368559] [2020-10-21 21:47:54,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:47:54,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:47:54,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:47:54,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:47:54,886 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 3 states. [2020-10-21 21:47:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:47:54,912 INFO L93 Difference]: Finished difference Result 482 states and 1450 transitions. [2020-10-21 21:47:54,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:47:54,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 21:47:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:47:54,919 INFO L225 Difference]: With dead ends: 482 [2020-10-21 21:47:54,920 INFO L226 Difference]: Without dead ends: 482 [2020-10-21 21:47:54,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:47:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-21 21:47:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-10-21 21:47:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-21 21:47:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1450 transitions. [2020-10-21 21:47:54,957 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1450 transitions. Word has length 9 [2020-10-21 21:47:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:47:54,957 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1450 transitions. [2020-10-21 21:47:54,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:47:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1450 transitions. [2020-10-21 21:47:54,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 21:47:54,961 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:47:54,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:47:54,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 21:47:54,962 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:47:54,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:47:54,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2048887062, now seen corresponding path program 1 times [2020-10-21 21:47:54,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:47:54,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554053981] [2020-10-21 21:47:54,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:47:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:47:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:47:55,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554053981] [2020-10-21 21:47:55,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:47:55,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:47:55,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499222495] [2020-10-21 21:47:55,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:47:55,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:47:55,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:47:55,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:47:55,086 INFO L87 Difference]: Start difference. First operand 482 states and 1450 transitions. Second operand 3 states. [2020-10-21 21:47:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:47:55,100 INFO L93 Difference]: Finished difference Result 458 states and 1368 transitions. [2020-10-21 21:47:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:47:55,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 21:47:55,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:47:55,105 INFO L225 Difference]: With dead ends: 458 [2020-10-21 21:47:55,105 INFO L226 Difference]: Without dead ends: 458 [2020-10-21 21:47:55,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:47:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-21 21:47:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2020-10-21 21:47:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-10-21 21:47:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1368 transitions. [2020-10-21 21:47:55,122 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1368 transitions. Word has length 11 [2020-10-21 21:47:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:47:55,122 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1368 transitions. [2020-10-21 21:47:55,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:47:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1368 transitions. [2020-10-21 21:47:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 21:47:55,125 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:47:55,125 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:47:55,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 21:47:55,125 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:47:55,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:47:55,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1884345578, now seen corresponding path program 1 times [2020-10-21 21:47:55,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:47:55,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313017880] [2020-10-21 21:47:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:47:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:47:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:47:55,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313017880] [2020-10-21 21:47:55,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:47:55,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:47:55,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805489213] [2020-10-21 21:47:55,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:47:55,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:47:55,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:47:55,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:47:55,321 INFO L87 Difference]: Start difference. First operand 458 states and 1368 transitions. Second operand 4 states. [2020-10-21 21:47:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:47:55,367 INFO L93 Difference]: Finished difference Result 440 states and 1162 transitions. [2020-10-21 21:47:55,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:47:55,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 21:47:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:47:55,370 INFO L225 Difference]: With dead ends: 440 [2020-10-21 21:47:55,370 INFO L226 Difference]: Without dead ends: 320 [2020-10-21 21:47:55,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:47:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-10-21 21:47:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2020-10-21 21:47:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-10-21 21:47:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 816 transitions. [2020-10-21 21:47:55,380 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 816 transitions. Word has length 13 [2020-10-21 21:47:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:47:55,380 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 816 transitions. [2020-10-21 21:47:55,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:47:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 816 transitions. [2020-10-21 21:47:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 21:47:55,381 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:47:55,382 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:47:55,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 21:47:55,382 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:47:55,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:47:55,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1805713443, now seen corresponding path program 1 times [2020-10-21 21:47:55,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:47:55,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849894087] [2020-10-21 21:47:55,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:47:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:47:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:47:55,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849894087] [2020-10-21 21:47:55,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:47:55,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:47:55,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617990832] [2020-10-21 21:47:55,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:47:55,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:47:55,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:47:55,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:47:55,525 INFO L87 Difference]: Start difference. First operand 320 states and 816 transitions. Second operand 5 states. [2020-10-21 21:47:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:47:55,574 INFO L93 Difference]: Finished difference Result 265 states and 624 transitions. [2020-10-21 21:47:55,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 21:47:55,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-21 21:47:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:47:55,581 INFO L225 Difference]: With dead ends: 265 [2020-10-21 21:47:55,581 INFO L226 Difference]: Without dead ends: 205 [2020-10-21 21:47:55,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:47:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-10-21 21:47:55,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2020-10-21 21:47:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-10-21 21:47:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 471 transitions. [2020-10-21 21:47:55,587 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 471 transitions. Word has length 15 [2020-10-21 21:47:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:47:55,588 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 471 transitions. [2020-10-21 21:47:55,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:47:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 471 transitions. [2020-10-21 21:47:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 21:47:55,589 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:47:55,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:47:55,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 21:47:55,589 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:47:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:47:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash 446008099, now seen corresponding path program 1 times [2020-10-21 21:47:55,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:47:55,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690569527] [2020-10-21 21:47:55,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:47:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:47:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:47:55,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690569527] [2020-10-21 21:47:55,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:47:55,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:47:55,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606502381] [2020-10-21 21:47:55,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 21:47:55,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:47:55,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 21:47:55,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:47:55,701 INFO L87 Difference]: Start difference. First operand 205 states and 471 transitions. Second operand 6 states. [2020-10-21 21:47:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:47:55,757 INFO L93 Difference]: Finished difference Result 186 states and 431 transitions. [2020-10-21 21:47:55,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:47:55,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-21 21:47:55,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:47:55,759 INFO L225 Difference]: With dead ends: 186 [2020-10-21 21:47:55,759 INFO L226 Difference]: Without dead ends: 173 [2020-10-21 21:47:55,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:47:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-21 21:47:55,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-10-21 21:47:55,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-10-21 21:47:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 407 transitions. [2020-10-21 21:47:55,765 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 407 transitions. Word has length 18 [2020-10-21 21:47:55,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:47:55,766 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 407 transitions. [2020-10-21 21:47:55,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 21:47:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 407 transitions. [2020-10-21 21:47:55,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 21:47:55,767 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:47:55,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:47:55,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 21:47:55,767 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:47:55,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:47:55,768 INFO L82 PathProgramCache]: Analyzing trace with hash 991297394, now seen corresponding path program 1 times [2020-10-21 21:47:55,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:47:55,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542783525] [2020-10-21 21:47:55,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:47:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:47:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:47:55,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542783525] [2020-10-21 21:47:55,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:47:55,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:47:55,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005666322] [2020-10-21 21:47:55,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:47:55,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:47:55,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:47:55,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:47:55,833 INFO L87 Difference]: Start difference. First operand 173 states and 407 transitions. Second operand 4 states. [2020-10-21 21:47:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:47:55,849 INFO L93 Difference]: Finished difference Result 220 states and 505 transitions. [2020-10-21 21:47:55,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 21:47:55,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-21 21:47:55,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:47:55,850 INFO L225 Difference]: With dead ends: 220 [2020-10-21 21:47:55,850 INFO L226 Difference]: Without dead ends: 92 [2020-10-21 21:47:55,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:47:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-21 21:47:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-21 21:47:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-21 21:47:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2020-10-21 21:47:55,854 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 21 [2020-10-21 21:47:55,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:47:55,854 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2020-10-21 21:47:55,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:47:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2020-10-21 21:47:55,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 21:47:55,855 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:47:55,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:47:55,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 21:47:55,856 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:47:55,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:47:55,856 INFO L82 PathProgramCache]: Analyzing trace with hash 559280400, now seen corresponding path program 2 times [2020-10-21 21:47:55,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:47:55,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705656242] [2020-10-21 21:47:55,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:47:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:47:55,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:47:55,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705656242] [2020-10-21 21:47:55,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:47:55,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:47:55,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341496192] [2020-10-21 21:47:55,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:47:55,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:47:55,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:47:55,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:47:55,913 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand 4 states. [2020-10-21 21:47:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:47:55,932 INFO L93 Difference]: Finished difference Result 118 states and 233 transitions. [2020-10-21 21:47:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 21:47:55,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-21 21:47:55,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:47:55,933 INFO L225 Difference]: With dead ends: 118 [2020-10-21 21:47:55,934 INFO L226 Difference]: Without dead ends: 48 [2020-10-21 21:47:55,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:47:55,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-21 21:47:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-21 21:47:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-21 21:47:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-10-21 21:47:55,936 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2020-10-21 21:47:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:47:55,936 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-10-21 21:47:55,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:47:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-10-21 21:47:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 21:47:55,937 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:47:55,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:47:55,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 21:47:55,938 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:47:55,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:47:55,938 INFO L82 PathProgramCache]: Analyzing trace with hash 237741602, now seen corresponding path program 3 times [2020-10-21 21:47:55,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:47:55,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216723600] [2020-10-21 21:47:55,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:47:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:47:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:47:56,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216723600] [2020-10-21 21:47:56,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:47:56,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:47:56,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424346677] [2020-10-21 21:47:56,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:47:56,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:47:56,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:47:56,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:47:56,400 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 7 states. [2020-10-21 21:47:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:47:56,575 INFO L93 Difference]: Finished difference Result 58 states and 95 transitions. [2020-10-21 21:47:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 21:47:56,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-21 21:47:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:47:56,576 INFO L225 Difference]: With dead ends: 58 [2020-10-21 21:47:56,577 INFO L226 Difference]: Without dead ends: 32 [2020-10-21 21:47:56,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-21 21:47:56,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-21 21:47:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-21 21:47:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-21 21:47:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-10-21 21:47:56,579 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 21 [2020-10-21 21:47:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:47:56,579 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-21 21:47:56,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:47:56,580 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2020-10-21 21:47:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 21:47:56,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:47:56,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:47:56,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 21:47:56,582 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:47:56,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:47:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1432706462, now seen corresponding path program 4 times [2020-10-21 21:47:56,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:47:56,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427087270] [2020-10-21 21:47:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:47:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 21:47:56,671 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 21:47:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 21:47:56,755 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 21:47:56,850 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 21:47:56,850 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 21:47:56,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 21:47:56,851 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 21:47:56,868 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1199] [1199] L2-->L864: Formula: (let ((.cse6 (= (mod ~y$r_buff0_thd0~0_In1749979861 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In1749979861 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In1749979861 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In1749979861 256) 0))) (let ((.cse5 (or .cse8 .cse9)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse2 (or .cse6 .cse7))) (and (= ~y$r_buff0_thd0~0_In1749979861 ~y$r_buff0_thd0~0_Out1749979861) (= ~y$r_buff1_thd0~0_Out1749979861 ~y$r_buff1_thd0~0_In1749979861) (or (and (= ~y~0_Out1749979861 ~y$w_buff0~0_In1749979861) .cse0 .cse1) (and .cse2 (or (and .cse3 (= ~y~0_Out1749979861 ~y$w_buff1~0_In1749979861) .cse4) (and .cse5 (= ~y~0_Out1749979861 ~y~0_In1749979861))))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1749979861 0)) (or (and .cse5 (= ~y$w_buff1_used~0_Out1749979861 ~y$w_buff1_used~0_In1749979861)) (and (= ~y$w_buff1_used~0_Out1749979861 0) .cse3 .cse4)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1749979861 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1749979861|) (or (and (= ~y$w_buff0_used~0_Out1749979861 0) .cse0 .cse1) (and (= ~y$w_buff0_used~0_In1749979861 ~y$w_buff0_used~0_Out1749979861) .cse2))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1749979861|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1749979861, ~y$w_buff1~0=~y$w_buff1~0_In1749979861, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1749979861, ~y$w_buff0~0=~y$w_buff0~0_In1749979861, ~y~0=~y~0_In1749979861, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1749979861, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1749979861} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1749979861, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1749979861|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1749979861|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1749979861|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1749979861|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1749979861|, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1749979861|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1749979861|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1749979861, ~y$w_buff1~0=~y$w_buff1~0_In1749979861, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1749979861, ~y$w_buff0~0=~y$w_buff0~0_In1749979861, ~y~0=~y~0_Out1749979861, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1749979861, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1749979861} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-21 21:47:56,875 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,875 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [794] [2020-10-21 21:47:56,875 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,876 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,876 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,876 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,876 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,877 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,877 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,877 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,877 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,877 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,877 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,878 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,878 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,878 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,879 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,879 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,879 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,879 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,880 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,880 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,880 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,880 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,882 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,882 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,883 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,883 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,883 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,883 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,884 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,884 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,884 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,885 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,885 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,886 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,886 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,888 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,888 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,889 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,889 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,889 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-21 21:47:56,889 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:47:56,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 09:47:56 BasicIcfg [2020-10-21 21:47:56,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 21:47:56,985 INFO L168 Benchmark]: Toolchain (without parser) took 12033.22 ms. Allocated memory was 136.8 MB in the beginning and 442.0 MB in the end (delta: 305.1 MB). Free memory was 98.2 MB in the beginning and 373.7 MB in the end (delta: -275.6 MB). Peak memory consumption was 269.5 MB. Max. memory is 7.1 GB. [2020-10-21 21:47:56,986 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 136.8 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 21:47:56,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.38 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 97.3 MB in the beginning and 149.0 MB in the end (delta: -51.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-10-21 21:47:56,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.12 ms. Allocated memory is still 199.8 MB. Free memory was 149.0 MB in the beginning and 146.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-21 21:47:56,988 INFO L168 Benchmark]: Boogie Preprocessor took 45.96 ms. Allocated memory is still 199.8 MB. Free memory was 146.1 MB in the beginning and 143.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-21 21:47:56,989 INFO L168 Benchmark]: RCFGBuilder took 2710.29 ms. Allocated memory was 199.8 MB in the beginning and 255.9 MB in the end (delta: 56.1 MB). Free memory was 143.2 MB in the beginning and 107.9 MB in the end (delta: 35.2 MB). Peak memory consumption was 100.3 MB. Max. memory is 7.1 GB. [2020-10-21 21:47:56,990 INFO L168 Benchmark]: TraceAbstraction took 8374.76 ms. Allocated memory was 255.9 MB in the beginning and 442.0 MB in the end (delta: 186.1 MB). Free memory was 107.9 MB in the beginning and 373.7 MB in the end (delta: -265.8 MB). Peak memory consumption was 160.2 MB. Max. memory is 7.1 GB. [2020-10-21 21:47:56,994 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.25 ms. Allocated memory is still 136.8 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 808.38 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 97.3 MB in the beginning and 149.0 MB in the end (delta: -51.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.12 ms. Allocated memory is still 199.8 MB. Free memory was 149.0 MB in the beginning and 146.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.96 ms. Allocated memory is still 199.8 MB. Free memory was 146.1 MB in the beginning and 143.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2710.29 ms. Allocated memory was 199.8 MB in the beginning and 255.9 MB in the end (delta: 56.1 MB). Free memory was 143.2 MB in the beginning and 107.9 MB in the end (delta: 35.2 MB). Peak memory consumption was 100.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8374.76 ms. Allocated memory was 255.9 MB in the beginning and 442.0 MB in the end (delta: 186.1 MB). Free memory was 107.9 MB in the beginning and 373.7 MB in the end (delta: -265.8 MB). Peak memory consumption was 160.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1229 VarBasedMoverChecksPositive, 66 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 50 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 123 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.3s, 112 PlacesBefore, 36 PlacesAfterwards, 105 TransitionsBefore, 26 TransitionsAfterwards, 1834 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 96 TotalNumberOfCompositions, 4926 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t77; [L849] FCALL, FORK 0 pthread_create(&t77, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t78; [L851] FCALL, FORK 0 pthread_create(&t78, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t79; [L853] FCALL, FORK 0 pthread_create(&t79, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0 [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L812] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L816] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EAX = y [L819] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L764] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L777] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L778] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L780] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = y [L782] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L826] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L828] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L830] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L866] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix003_rmo.opt.0.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 103 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.0s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 235 SDtfs, 199 SDslu, 360 SDs, 0 SdLazy, 137 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred 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: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 11965 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...