/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/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 01:35:18,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 01:35:18,784 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 01:35:18,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 01:35:18,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 01:35:18,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 01:35:18,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 01:35:18,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 01:35:18,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 01:35:18,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 01:35:18,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 01:35:18,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 01:35:18,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 01:35:18,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 01:35:18,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 01:35:18,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 01:35:18,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 01:35:18,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 01:35:18,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 01:35:18,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 01:35:18,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 01:35:18,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 01:35:18,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 01:35:18,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 01:35:18,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 01:35:18,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 01:35:18,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 01:35:18,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 01:35:18,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 01:35:18,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 01:35:18,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 01:35:18,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 01:35:18,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 01:35:18,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 01:35:18,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 01:35:18,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 01:35:18,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 01:35:18,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 01:35:18,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 01:35:18,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 01:35:18,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 01:35:18,846 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-10-22 01:35:18,869 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 01:35:18,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 01:35:18,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 01:35:18,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 01:35:18,871 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 01:35:18,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 01:35:18,871 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 01:35:18,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 01:35:18,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 01:35:18,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 01:35:18,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 01:35:18,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 01:35:18,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 01:35:18,873 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 01:35:18,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 01:35:18,873 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 01:35:18,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 01:35:18,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 01:35:18,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 01:35:18,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 01:35:18,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 01:35:18,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 01:35:18,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 01:35:18,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 01:35:18,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 01:35:18,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 01:35:18,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 01:35:18,876 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 01:35:18,876 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 01:35:18,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 01:35:18,876 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 01:35:19,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 01:35:19,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 01:35:19,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 01:35:19,264 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 01:35:19,264 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 01:35:19,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_rmo.opt.i [2020-10-22 01:35:19,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abfa8f0cc/b7b58a43cb894060a37ebba09e6bf191/FLAGc8808c17a [2020-10-22 01:35:19,927 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 01:35:19,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_rmo.opt.i [2020-10-22 01:35:19,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abfa8f0cc/b7b58a43cb894060a37ebba09e6bf191/FLAGc8808c17a [2020-10-22 01:35:20,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abfa8f0cc/b7b58a43cb894060a37ebba09e6bf191 [2020-10-22 01:35:20,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 01:35:20,222 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 01:35:20,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 01:35:20,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 01:35:20,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 01:35:20,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:35:20" (1/1) ... [2020-10-22 01:35:20,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fba72e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:35:20, skipping insertion in model container [2020-10-22 01:35:20,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:35:20" (1/1) ... [2020-10-22 01:35:20,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 01:35:20,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 01:35:20,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 01:35:20,831 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 01:35:20,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 01:35:20,990 INFO L208 MainTranslator]: Completed translation [2020-10-22 01:35:20,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:35:20 WrapperNode [2020-10-22 01:35:20,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 01:35:20,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 01:35:20,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 01:35:20,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 01:35:21,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:35:20" (1/1) ... [2020-10-22 01:35:21,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:35:20" (1/1) ... [2020-10-22 01:35:21,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 01:35:21,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 01:35:21,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 01:35:21,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 01:35:21,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:35:20" (1/1) ... [2020-10-22 01:35:21,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:35:20" (1/1) ... [2020-10-22 01:35:21,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:35:20" (1/1) ... [2020-10-22 01:35:21,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:35:20" (1/1) ... [2020-10-22 01:35:21,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:35:20" (1/1) ... [2020-10-22 01:35:21,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:35:20" (1/1) ... [2020-10-22 01:35:21,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:35:20" (1/1) ... [2020-10-22 01:35:21,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 01:35:21,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 01:35:21,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 01:35:21,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 01:35:21,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:35:20" (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-22 01:35:21,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 01:35:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 01:35:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 01:35:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 01:35:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 01:35:21,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 01:35:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 01:35:21,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 01:35:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 01:35:21,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 01:35:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 01:35:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 01:35:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 01:35:21,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 01:35:21,235 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 01:35:23,747 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 01:35:23,747 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 01:35:23,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:35:23 BoogieIcfgContainer [2020-10-22 01:35:23,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 01:35:23,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 01:35:23,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 01:35:23,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 01:35:23,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 01:35:20" (1/3) ... [2020-10-22 01:35:23,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bcc48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:35:23, skipping insertion in model container [2020-10-22 01:35:23,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:35:20" (2/3) ... [2020-10-22 01:35:23,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bcc48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:35:23, skipping insertion in model container [2020-10-22 01:35:23,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:35:23" (3/3) ... [2020-10-22 01:35:23,765 INFO L111 eAbstractionObserver]: Analyzing ICFG mix006_rmo.opt.i [2020-10-22 01:35:23,778 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 01:35:23,779 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 01:35:23,792 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 01:35:23,794 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 01:35:23,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,847 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,848 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,848 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,861 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,861 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,862 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,863 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,876 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,876 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,886 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,887 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,897 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,897 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,897 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,899 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,901 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,905 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,906 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,907 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,913 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,914 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,914 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:35:23,915 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 01:35:23,931 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 01:35:23,957 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 01:35:23,957 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 01:35:23,957 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 01:35:23,958 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 01:35:23,958 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 01:35:23,958 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 01:35:23,958 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 01:35:23,958 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 01:35:23,982 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 01:35:23,982 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 104 transitions, 223 flow [2020-10-22 01:35:23,985 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 104 transitions, 223 flow [2020-10-22 01:35:23,987 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 111 places, 104 transitions, 223 flow [2020-10-22 01:35:24,078 INFO L129 PetriNetUnfolder]: 3/101 cut-off events. [2020-10-22 01:35:24,079 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 01:35:24,084 INFO L80 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 3/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-22 01:35:24,087 INFO L116 LiptonReduction]: Number of co-enabled transitions 1834 [2020-10-22 01:35:24,680 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 01:35:24,828 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-22 01:35:26,645 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2020-10-22 01:35:27,362 WARN L193 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-10-22 01:35:27,575 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-22 01:35:27,590 INFO L131 LiptonReduction]: Checked pairs total: 5372 [2020-10-22 01:35:27,590 INFO L133 LiptonReduction]: Total number of compositions: 94 [2020-10-22 01:35:27,597 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-22 01:35:27,647 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 750 states. [2020-10-22 01:35:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2020-10-22 01:35:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-22 01:35:27,667 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:35:27,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:35:27,670 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-22 01:35:27,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:35:27,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1276634938, now seen corresponding path program 1 times [2020-10-22 01:35:27,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:35:27,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453374376] [2020-10-22 01:35:27,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:35:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:35:27,986 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-22 01:35:27,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453374376] [2020-10-22 01:35:27,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:35:27,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:35:27,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [332430472] [2020-10-22 01:35:27,991 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:35:27,994 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:35:28,011 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-22 01:35:28,011 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:35:28,019 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:35:28,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:35:28,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:35:28,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:35:28,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:35:28,044 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2020-10-22 01:35:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:35:28,147 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-10-22 01:35:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:35:28,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-22 01:35:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:35:28,181 INFO L225 Difference]: With dead ends: 650 [2020-10-22 01:35:28,181 INFO L226 Difference]: Without dead ends: 530 [2020-10-22 01:35:28,183 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-22 01:35:28,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-22 01:35:28,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-22 01:35:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-22 01:35:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2020-10-22 01:35:28,303 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2020-10-22 01:35:28,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:35:28,305 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2020-10-22 01:35:28,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:35:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2020-10-22 01:35:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 01:35:28,310 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:35:28,310 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:35:28,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 01:35:28,311 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-22 01:35:28,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:35:28,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1514554596, now seen corresponding path program 1 times [2020-10-22 01:35:28,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:35:28,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425289534] [2020-10-22 01:35:28,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:35:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:35:28,453 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-22 01:35:28,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425289534] [2020-10-22 01:35:28,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:35:28,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:35:28,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [538004197] [2020-10-22 01:35:28,454 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:35:28,455 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:35:28,456 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 01:35:28,456 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:35:28,457 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:35:28,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:35:28,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:35:28,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:35:28,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:35:28,459 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 3 states. [2020-10-22 01:35:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:35:28,477 INFO L93 Difference]: Finished difference Result 518 states and 1576 transitions. [2020-10-22 01:35:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:35:28,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 01:35:28,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:35:28,483 INFO L225 Difference]: With dead ends: 518 [2020-10-22 01:35:28,483 INFO L226 Difference]: Without dead ends: 518 [2020-10-22 01:35:28,484 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-22 01:35:28,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-10-22 01:35:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2020-10-22 01:35:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2020-10-22 01:35:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1576 transitions. [2020-10-22 01:35:28,533 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1576 transitions. Word has length 9 [2020-10-22 01:35:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:35:28,535 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 1576 transitions. [2020-10-22 01:35:28,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:35:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1576 transitions. [2020-10-22 01:35:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 01:35:28,537 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:35:28,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:35:28,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 01:35:28,538 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-22 01:35:28,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:35:28,539 INFO L82 PathProgramCache]: Analyzing trace with hash -293447874, now seen corresponding path program 1 times [2020-10-22 01:35:28,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:35:28,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529277072] [2020-10-22 01:35:28,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:35:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:35:28,629 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-22 01:35:28,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529277072] [2020-10-22 01:35:28,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:35:28,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:35:28,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1383970565] [2020-10-22 01:35:28,631 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:35:28,632 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:35:28,634 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-10-22 01:35:28,634 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:35:28,702 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:35:28,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:35:28,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:35:28,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:35:28,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:35:28,703 INFO L87 Difference]: Start difference. First operand 518 states and 1576 transitions. Second operand 3 states. [2020-10-22 01:35:28,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:35:28,712 INFO L93 Difference]: Finished difference Result 482 states and 1450 transitions. [2020-10-22 01:35:28,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:35:28,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 01:35:28,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:35:28,716 INFO L225 Difference]: With dead ends: 482 [2020-10-22 01:35:28,717 INFO L226 Difference]: Without dead ends: 482 [2020-10-22 01:35:28,717 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-22 01:35:28,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-22 01:35:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-10-22 01:35:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-22 01:35:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1450 transitions. [2020-10-22 01:35:28,735 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1450 transitions. Word has length 10 [2020-10-22 01:35:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:35:28,736 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1450 transitions. [2020-10-22 01:35:28,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:35:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1450 transitions. [2020-10-22 01:35:28,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 01:35:28,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:35:28,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:35:28,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 01:35:28,738 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-22 01:35:28,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:35:28,739 INFO L82 PathProgramCache]: Analyzing trace with hash -506951332, now seen corresponding path program 1 times [2020-10-22 01:35:28,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:35:28,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596990058] [2020-10-22 01:35:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:35:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:35:28,776 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-22 01:35:28,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596990058] [2020-10-22 01:35:28,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:35:28,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:35:28,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1832883430] [2020-10-22 01:35:28,777 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:35:28,779 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:35:28,781 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 27 transitions. [2020-10-22 01:35:28,781 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:35:28,874 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:35:28,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:35:28,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:35:28,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:35:28,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:35:28,875 INFO L87 Difference]: Start difference. First operand 482 states and 1450 transitions. Second operand 3 states. [2020-10-22 01:35:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:35:28,889 INFO L93 Difference]: Finished difference Result 458 states and 1368 transitions. [2020-10-22 01:35:28,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:35:28,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 01:35:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:35:28,893 INFO L225 Difference]: With dead ends: 458 [2020-10-22 01:35:28,893 INFO L226 Difference]: Without dead ends: 458 [2020-10-22 01:35:28,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-22 01:35:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-22 01:35:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2020-10-22 01:35:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-10-22 01:35:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1368 transitions. [2020-10-22 01:35:28,909 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1368 transitions. Word has length 11 [2020-10-22 01:35:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:35:28,909 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1368 transitions. [2020-10-22 01:35:28,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:35:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1368 transitions. [2020-10-22 01:35:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 01:35:28,911 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:35:28,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:35:28,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 01:35:28,911 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-22 01:35:28,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:35:28,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1215221922, now seen corresponding path program 1 times [2020-10-22 01:35:28,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:35:28,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427625985] [2020-10-22 01:35:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:35:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:35:29,013 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-22 01:35:29,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427625985] [2020-10-22 01:35:29,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:35:29,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:35:29,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [969512161] [2020-10-22 01:35:29,014 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:35:29,017 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:35:29,024 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 45 transitions. [2020-10-22 01:35:29,024 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:35:29,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:29,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:29,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:29,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:29,285 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7714#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-22 01:35:29,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 01:35:29,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:35:29,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 01:35:29,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 01:35:29,286 INFO L87 Difference]: Start difference. First operand 458 states and 1368 transitions. Second operand 5 states. [2020-10-22 01:35:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:35:29,356 INFO L93 Difference]: Finished difference Result 325 states and 864 transitions. [2020-10-22 01:35:29,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 01:35:29,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 01:35:29,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:35:29,365 INFO L225 Difference]: With dead ends: 325 [2020-10-22 01:35:29,365 INFO L226 Difference]: Without dead ends: 205 [2020-10-22 01:35:29,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:35:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-10-22 01:35:29,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2020-10-22 01:35:29,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-10-22 01:35:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 471 transitions. [2020-10-22 01:35:29,376 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 471 transitions. Word has length 13 [2020-10-22 01:35:29,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:35:29,377 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 471 transitions. [2020-10-22 01:35:29,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 01:35:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 471 transitions. [2020-10-22 01:35:29,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 01:35:29,378 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:35:29,378 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-22 01:35:29,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 01:35:29,379 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-22 01:35:29,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:35:29,379 INFO L82 PathProgramCache]: Analyzing trace with hash 351823196, now seen corresponding path program 1 times [2020-10-22 01:35:29,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:35:29,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066741364] [2020-10-22 01:35:29,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:35:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:35:29,547 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-22 01:35:29,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066741364] [2020-10-22 01:35:29,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:35:29,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 01:35:29,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1860776359] [2020-10-22 01:35:29,548 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:35:29,555 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:35:29,583 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 123 transitions. [2020-10-22 01:35:29,583 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:35:30,106 WARN L193 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 01:35:30,448 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8460#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 01:35:30,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 01:35:30,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:35:30,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 01:35:30,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:35:30,449 INFO L87 Difference]: Start difference. First operand 205 states and 471 transitions. Second operand 7 states. [2020-10-22 01:35:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:35:30,512 INFO L93 Difference]: Finished difference Result 186 states and 431 transitions. [2020-10-22 01:35:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 01:35:30,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-22 01:35:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:35:30,514 INFO L225 Difference]: With dead ends: 186 [2020-10-22 01:35:30,514 INFO L226 Difference]: Without dead ends: 173 [2020-10-22 01:35:30,515 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 01:35:30,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-22 01:35:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-10-22 01:35:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-10-22 01:35:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 407 transitions. [2020-10-22 01:35:30,520 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 407 transitions. Word has length 18 [2020-10-22 01:35:30,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:35:30,520 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 407 transitions. [2020-10-22 01:35:30,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 01:35:30,521 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 407 transitions. [2020-10-22 01:35:30,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 01:35:30,522 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:35:30,522 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-22 01:35:30,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 01:35:30,522 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-22 01:35:30,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:35:30,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2087708654, now seen corresponding path program 1 times [2020-10-22 01:35:30,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:35:30,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396161951] [2020-10-22 01:35:30,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:35:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:35:30,593 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-22 01:35:30,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396161951] [2020-10-22 01:35:30,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:35:30,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:35:30,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [725040157] [2020-10-22 01:35:30,594 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:35:30,599 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:35:30,635 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 143 transitions. [2020-10-22 01:35:30,636 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:35:31,267 WARN L193 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 01:35:31,507 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:35:31,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:35:31,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:35:31,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:35:31,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:35:31,508 INFO L87 Difference]: Start difference. First operand 173 states and 407 transitions. Second operand 4 states. [2020-10-22 01:35:31,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:35:31,527 INFO L93 Difference]: Finished difference Result 220 states and 505 transitions. [2020-10-22 01:35:31,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 01:35:31,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-22 01:35:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:35:31,528 INFO L225 Difference]: With dead ends: 220 [2020-10-22 01:35:31,529 INFO L226 Difference]: Without dead ends: 92 [2020-10-22 01:35:31,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-22 01:35:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-22 01:35:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-22 01:35:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-22 01:35:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2020-10-22 01:35:31,533 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 21 [2020-10-22 01:35:31,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:35:31,533 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2020-10-22 01:35:31,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:35:31,533 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2020-10-22 01:35:31,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 01:35:31,534 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:35:31,534 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-22 01:35:31,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 01:35:31,535 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-22 01:35:31,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:35:31,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2050200090, now seen corresponding path program 2 times [2020-10-22 01:35:31,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:35:31,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534688217] [2020-10-22 01:35:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:35:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:35:31,636 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-22 01:35:31,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534688217] [2020-10-22 01:35:31,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:35:31,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 01:35:31,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1073919718] [2020-10-22 01:35:31,638 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:35:31,642 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:35:31,660 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 55 transitions. [2020-10-22 01:35:31,661 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:35:31,729 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:35:31,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:35:31,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:35:31,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:35:31,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:35:31,730 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand 3 states. [2020-10-22 01:35:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:35:31,742 INFO L93 Difference]: Finished difference Result 118 states and 233 transitions. [2020-10-22 01:35:31,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:35:31,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-22 01:35:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:35:31,743 INFO L225 Difference]: With dead ends: 118 [2020-10-22 01:35:31,744 INFO L226 Difference]: Without dead ends: 48 [2020-10-22 01:35:31,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-22 01:35:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-22 01:35:31,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-22 01:35:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-22 01:35:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-10-22 01:35:31,747 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2020-10-22 01:35:31,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:35:31,747 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-10-22 01:35:31,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:35:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-10-22 01:35:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 01:35:31,748 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:35:31,748 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-22 01:35:31,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 01:35:31,749 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-22 01:35:31,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:35:31,749 INFO L82 PathProgramCache]: Analyzing trace with hash -509228208, now seen corresponding path program 3 times [2020-10-22 01:35:31,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:35:31,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012494447] [2020-10-22 01:35:31,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:35:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:35:32,202 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-22 01:35:32,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012494447] [2020-10-22 01:35:32,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:35:32,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 01:35:32,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1577350051] [2020-10-22 01:35:32,204 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:35:32,209 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:35:32,236 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 88 transitions. [2020-10-22 01:35:32,237 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:35:33,067 WARN L193 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 230 [2020-10-22 01:35:33,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-22 01:35:33,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,170 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:35:33,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,171 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-22 01:35:33,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,173 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-22 01:35:33,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,174 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:35:33,174 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,176 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:35:33,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,178 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:35:33,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,180 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:35:33,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,182 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:35:33,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:33,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:33,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 01:35:33,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 01:35:33,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:33,338 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:33,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,441 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:33,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:33,454 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:35:33,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:33,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:33,515 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:33,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:33,526 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,528 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,534 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:35:33,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,538 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 4, 3, 3, 2, 2, 3, 2, 1] term [2020-10-22 01:35:33,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:33,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:33,541 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-22 01:35:33,542 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:33,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:33,549 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:33,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:33,574 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:33,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,597 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:35:33,598 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:33,599 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:33,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:33,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,636 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:33,646 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:33,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,668 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:35:33,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:33,673 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 01:35:33,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,695 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:33,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,707 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:33,721 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 01:35:33,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,728 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:33,731 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,738 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,759 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 01:35:33,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,778 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:33,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,782 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:33,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:33,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:33,821 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 2, 4, 2, 3, 2, 1] term [2020-10-22 01:35:33,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:34,421 WARN L193 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 39 [2020-10-22 01:35:34,724 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2020-10-22 01:35:34,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:34,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:34,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:34,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:34,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:34,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:34,756 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:35:34,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:34,758 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 4, 3, 3, 2, 2, 2, 2, 2, 1] term [2020-10-22 01:35:34,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:34,759 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:34,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:34,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:34,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:34,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:34,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:34,841 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:35:34,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:34,845 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:34,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:34,869 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:34,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:34,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:34,882 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:35:34,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:34,885 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:34,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:34,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:34,912 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 2, 4, 2, 3, 2, 1] term [2020-10-22 01:35:34,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,292 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 101 [2020-10-22 01:35:35,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:35,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:35,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,306 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:35,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:35,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,316 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:35:35,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,319 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 4, 3, 3, 2, 2, 3, 2, 1] term [2020-10-22 01:35:35,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:35,320 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 01:35:35,321 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:35,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,338 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,348 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:35,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,357 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:35,391 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:35:35,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:35,404 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 01:35:35,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,414 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,421 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:35,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,432 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:35,439 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 01:35:35,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,449 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:35,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,491 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:35:35,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:35,498 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 01:35:35,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,511 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,524 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:35,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,528 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,536 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:35,542 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,548 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 2, 4, 2, 3, 2, 1] term [2020-10-22 01:35:35,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,933 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 101 [2020-10-22 01:35:35,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:35,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:35,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:35,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:35,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,945 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,951 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:35:35,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,952 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 4, 3, 3, 2, 2, 3, 2, 1] term [2020-10-22 01:35:35,953 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:35,953 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 01:35:35,956 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:35,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,967 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:35,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:35,993 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:35,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:35,997 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-22 01:35:35,998 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:35:35,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:36,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:36,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,018 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:35:36,018 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:36,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,024 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:35:36,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:36,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,030 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:36,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:36,035 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:36,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:36,047 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:35:36,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:36,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:36,054 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,059 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:36,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:35:36,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:36,068 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:36,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,078 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:36,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,085 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-22 01:35:36,085 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:36,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,091 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:35:36,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:36,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:36,106 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:35:36,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:36,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:36,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,125 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:35:36,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:35:36,129 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:36,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:35:36,136 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:35:36,142 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:35:36,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:36,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:36,154 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 2, 4, 2, 3, 2, 1] term [2020-10-22 01:35:36,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:35:36,435 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 38 [2020-10-22 01:35:36,436 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9629#(or (= ~__unbuffered_p2_EAX~0 0) (and (or (= (mod ~y$w_buff0_used~0 256) 0) (= ~y$w_buff0~0 1) (= ~y$w_buff0~0 ~__unbuffered_p2_EAX~0)) (or (and (or (= ~y~0 1) (= ~y~0 ~__unbuffered_p2_EAX~0)) (or (and (= ~y~0 1) (or (and (= ~y$w_buff0~0 1) (= ~y$w_buff1_used~0 0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))) (= ~y$w_buff0_used~0 0)) (= (mod ~y$w_buff1_used~0 256) 0)) (and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0))))))] [2020-10-22 01:35:36,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 01:35:36,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:35:36,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 01:35:36,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-22 01:35:36,438 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 8 states. [2020-10-22 01:35:36,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:35:36,655 INFO L93 Difference]: Finished difference Result 58 states and 95 transitions. [2020-10-22 01:35:36,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 01:35:36,656 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-22 01:35:36,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:35:36,657 INFO L225 Difference]: With dead ends: 58 [2020-10-22 01:35:36,657 INFO L226 Difference]: Without dead ends: 32 [2020-10-22 01:35:36,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-22 01:35:36,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-22 01:35:36,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-22 01:35:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-22 01:35:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-10-22 01:35:36,659 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 21 [2020-10-22 01:35:36,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:35:36,659 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-10-22 01:35:36,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 01:35:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2020-10-22 01:35:36,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 01:35:36,660 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:35:36,660 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-22 01:35:36,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 01:35:36,660 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-22 01:35:36,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:35:36,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1088702254, now seen corresponding path program 4 times [2020-10-22 01:35:36,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:35:36,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627175435] [2020-10-22 01:35:36,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:35:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 01:35:36,720 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 01:35:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 01:35:36,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 01:35:36,807 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 01:35:36,807 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 01:35:36,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 01:35:36,808 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 01:35:36,825 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1193] [1193] L3-->L862: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In1181606450 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In1181606450 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In1181606450 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In1181606450 256) 0))) (let ((.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse0 (not .cse6)) (.cse1 (not .cse7)) (.cse2 (or .cse6 .cse7))) (and (= ~y$r_buff0_thd0~0_In1181606450 ~y$r_buff0_thd0~0_Out1181606450) (or (and (= ~y~0_Out1181606450 ~y$w_buff0~0_In1181606450) .cse0 .cse1) (and .cse2 (or (and .cse3 (= ~y~0_Out1181606450 ~y$w_buff1~0_In1181606450) .cse4) (and (= ~y~0_Out1181606450 ~y~0_In1181606450) .cse5)))) (or (and .cse5 (= ~y$w_buff1_used~0_Out1181606450 ~y$w_buff1_used~0_In1181606450)) (and .cse3 (= ~y$w_buff1_used~0_Out1181606450 0) .cse4)) (= ~y$r_buff1_thd0~0_In1181606450 ~y$r_buff1_thd0~0_Out1181606450) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1181606450 0)) (or (and (= ~y$w_buff0_used~0_Out1181606450 0) .cse0 .cse1) (and (= ~y$w_buff0_used~0_Out1181606450 ~y$w_buff0_used~0_In1181606450) .cse2))))) InVars {ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1181606450, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1181606450, ~y$w_buff1~0=~y$w_buff1~0_In1181606450, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1181606450, ~y$w_buff0~0=~y$w_buff0~0_In1181606450, ~y~0=~y~0_In1181606450, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1181606450, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1181606450} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1181606450, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1181606450|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1181606450|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1181606450|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1181606450|, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1181606450|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1181606450|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1181606450, ~y$w_buff1~0=~y$w_buff1~0_In1181606450, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1181606450, ~y$w_buff0~0=~y$w_buff0~0_In1181606450, ~y~0=~y~0_Out1181606450, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1181606450, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1181606450} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~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-22 01:35:36,831 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-22 01:35:36,832 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [792] [2020-10-22 01:35:36,832 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-22 01:35:36,833 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,833 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-22 01:35:36,833 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,833 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-22 01:35:36,833 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,834 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-22 01:35:36,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,834 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-22 01:35:36,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,834 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-22 01:35:36,834 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,835 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-22 01:35:36,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,835 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-22 01:35:36,835 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,835 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-22 01:35:36,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,836 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-22 01:35:36,836 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,837 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-22 01:35:36,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,838 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-22 01:35:36,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,838 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-22 01:35:36,838 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,838 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-22 01:35:36,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,839 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-22 01:35:36,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,839 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-22 01:35:36,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,839 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-22 01:35:36,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,840 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-22 01:35:36,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,840 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-22 01:35:36,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,841 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-22 01:35:36,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,841 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-22 01:35:36,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,841 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-22 01:35:36,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,842 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-22 01:35:36,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,842 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-22 01:35:36,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,843 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-22 01:35:36,843 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,843 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-22 01:35:36,843 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,843 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-22 01:35:36,844 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:35:36,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 01:35:36 BasicIcfg [2020-10-22 01:35:36,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 01:35:36,936 INFO L168 Benchmark]: Toolchain (without parser) took 16718.73 ms. Allocated memory was 144.7 MB in the beginning and 397.4 MB in the end (delta: 252.7 MB). Free memory was 99.4 MB in the beginning and 83.9 MB in the end (delta: 15.5 MB). Peak memory consumption was 268.2 MB. Max. memory is 7.1 GB. [2020-10-22 01:35:36,936 INFO L168 Benchmark]: CDTParser took 3.20 ms. Allocated memory is still 144.7 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 01:35:36,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.54 ms. Allocated memory was 144.7 MB in the beginning and 199.2 MB in the end (delta: 54.5 MB). Free memory was 98.5 MB in the beginning and 148.5 MB in the end (delta: -50.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2020-10-22 01:35:36,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.70 ms. Allocated memory is still 199.2 MB. Free memory was 148.5 MB in the beginning and 145.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-22 01:35:36,942 INFO L168 Benchmark]: Boogie Preprocessor took 43.78 ms. Allocated memory is still 199.2 MB. Free memory was 145.7 MB in the beginning and 142.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-22 01:35:36,943 INFO L168 Benchmark]: RCFGBuilder took 2604.46 ms. Allocated memory was 199.2 MB in the beginning and 252.2 MB in the end (delta: 53.0 MB). Free memory was 142.8 MB in the beginning and 107.8 MB in the end (delta: 35.0 MB). Peak memory consumption was 100.4 MB. Max. memory is 7.1 GB. [2020-10-22 01:35:36,943 INFO L168 Benchmark]: TraceAbstraction took 13180.83 ms. Allocated memory was 252.2 MB in the beginning and 397.4 MB in the end (delta: 145.2 MB). Free memory was 107.8 MB in the beginning and 83.9 MB in the end (delta: 23.9 MB). Peak memory consumption was 169.1 MB. Max. memory is 7.1 GB. [2020-10-22 01:35:36,953 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.20 ms. Allocated memory is still 144.7 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.54 ms. Allocated memory was 144.7 MB in the beginning and 199.2 MB in the end (delta: 54.5 MB). Free memory was 98.5 MB in the beginning and 148.5 MB in the end (delta: -50.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 110.70 ms. Allocated memory is still 199.2 MB. Free memory was 148.5 MB in the beginning and 145.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.78 ms. Allocated memory is still 199.2 MB. Free memory was 145.7 MB in the beginning and 142.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2604.46 ms. Allocated memory was 199.2 MB in the beginning and 252.2 MB in the end (delta: 53.0 MB). Free memory was 142.8 MB in the beginning and 107.8 MB in the end (delta: 35.0 MB). Peak memory consumption was 100.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13180.83 ms. Allocated memory was 252.2 MB in the beginning and 397.4 MB in the end (delta: 145.2 MB). Free memory was 107.8 MB in the beginning and 83.9 MB in the end (delta: 23.9 MB). Peak memory consumption was 169.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1030 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 82 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.6s, 111 PlacesBefore, 36 PlacesAfterwards, 104 TransitionsBefore, 26 TransitionsAfterwards, 1834 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 94 TotalNumberOfCompositions, 5372 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_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L846] 0 pthread_t t168; [L847] FCALL, FORK 0 pthread_create(&t168, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L848] 0 pthread_t t169; [L849] FCALL, FORK 0 pthread_create(&t169, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L850] 0 pthread_t t170; [L851] FCALL, FORK 0 pthread_create(&t170, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] 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) [L809] 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) [L810] 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)) [L810] 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)) [L811] 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)) [L811] 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)) [L812] 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)) [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_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 3 __unbuffered_p2_EAX = y [L817] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=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=50, 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] [L821] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=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=50, 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] [L747] 1 z = 1 VAL [__unbuffered_cnt=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=50, 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] [L750] 1 x = 1 VAL [__unbuffered_cnt=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=50, 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] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __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=50, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=50, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 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) [L772] 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) [L773] 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)) [L773] 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 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L773] 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)) [L773] 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)) [L774] 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)) [L774] 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)) [L775] 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)) [L775] 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) [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 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) [L775] 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)) [L775] 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)) [L776] 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)) [L776] 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)) [L777] 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)) [L777] EXPR 2 !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) [L777] 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)) [L777] 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)) [L778] 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)) [L778] 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)) [L779] 2 __unbuffered_p1_EBX = y [L780] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 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) [L824] 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) [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L826] 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 [L827] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L828] 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 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __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", "mix006_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __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=51, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=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, 102 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.8s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 223 SDtfs, 162 SDslu, 337 SDs, 0 SdLazy, 127 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 117 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.2s 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 11374 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...