/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/mix053_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:01:32,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:01:32,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:01:32,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:01:32,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:01:32,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:01:32,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:01:32,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:01:32,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:01:32,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:01:32,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:01:32,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:01:32,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:01:32,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:01:32,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:01:32,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:01:32,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:01:32,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:01:32,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:01:32,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:01:32,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:01:32,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:01:32,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:01:32,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:01:32,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:01:32,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:01:32,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:01:32,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:01:32,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:01:32,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:01:32,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:01:32,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:01:32,759 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:01:32,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:01:32,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:01:32,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:01:32,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:01:32,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:01:32,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:01:32,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:01:32,764 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:01:32,765 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 02:01:32,804 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:01:32,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:01:32,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:01:32,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:01:32,806 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:01:32,807 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:01:32,808 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:01:32,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:01:32,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:01:32,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:01:32,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:01:32,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:01:32,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:01:32,810 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:01:32,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:01:32,810 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:01:32,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:01:32,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:01:32,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:01:32,811 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:01:32,811 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:01:32,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:01:32,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:01:32,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:01:32,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:01:32,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:01:32,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:01:32,813 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:01:32,813 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:01:32,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:01:32,813 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:01:33,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:01:33,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:01:33,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:01:33,174 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:01:33,174 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:01:33,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_pso.opt.i [2020-10-22 02:01:33,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc1b7cb64/26fbc302ec6149a495d1de069bb6f13b/FLAG5df46435e [2020-10-22 02:01:33,790 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:01:33,791 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_pso.opt.i [2020-10-22 02:01:33,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc1b7cb64/26fbc302ec6149a495d1de069bb6f13b/FLAG5df46435e [2020-10-22 02:01:33,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc1b7cb64/26fbc302ec6149a495d1de069bb6f13b [2020-10-22 02:01:34,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:01:34,007 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:01:34,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:01:34,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:01:34,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:01:34,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:01:33" (1/1) ... [2020-10-22 02:01:34,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5f2f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:01:34, skipping insertion in model container [2020-10-22 02:01:34,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:01:33" (1/1) ... [2020-10-22 02:01:34,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:01:34,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:01:34,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:01:34,724 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:01:34,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:01:34,912 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:01:34,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:01:34 WrapperNode [2020-10-22 02:01:34,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:01:34,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:01:34,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:01:34,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:01:34,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:01:34" (1/1) ... [2020-10-22 02:01:34,944 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:01:34" (1/1) ... [2020-10-22 02:01:34,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:01:34,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:01:34,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:01:34,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:01:34,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:01:34" (1/1) ... [2020-10-22 02:01:34,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:01:34" (1/1) ... [2020-10-22 02:01:34,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:01:34" (1/1) ... [2020-10-22 02:01:34,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:01:34" (1/1) ... [2020-10-22 02:01:35,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:01:34" (1/1) ... [2020-10-22 02:01:35,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:01:34" (1/1) ... [2020-10-22 02:01:35,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:01:34" (1/1) ... [2020-10-22 02:01:35,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:01:35,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:01:35,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:01:35,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:01:35,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:01:34" (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 02:01:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:01:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:01:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:01:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:01:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:01:35,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:01:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:01:35,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:01:35,081 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:01:35,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:01:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-22 02:01:35,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-22 02:01:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:01:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:01:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:01:35,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:01:35,085 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 02:01:36,851 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:01:36,852 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 02:01:36,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:01:36 BoogieIcfgContainer [2020-10-22 02:01:36,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:01:36,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:01:36,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:01:36,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:01:36,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:01:33" (1/3) ... [2020-10-22 02:01:36,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1544a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:01:36, skipping insertion in model container [2020-10-22 02:01:36,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:01:34" (2/3) ... [2020-10-22 02:01:36,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d1544a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:01:36, skipping insertion in model container [2020-10-22 02:01:36,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:01:36" (3/3) ... [2020-10-22 02:01:36,864 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_pso.opt.i [2020-10-22 02:01:36,876 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:01:36,876 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:01:36,884 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 02:01:36,885 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:01:36,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,922 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,922 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,923 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,924 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,924 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,926 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,926 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,927 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,933 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,937 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,938 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,938 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,938 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,938 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,939 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,940 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,940 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,941 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,942 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,943 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,947 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,947 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,948 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,948 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,949 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,949 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,949 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,949 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,949 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,950 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,950 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,955 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,955 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,959 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:01:36,962 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:01:36,979 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-22 02:01:37,005 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:01:37,005 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:01:37,006 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:01:37,006 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:01:37,006 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:01:37,006 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:01:37,007 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:01:37,007 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:01:37,024 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:01:37,025 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 116 transitions, 252 flow [2020-10-22 02:01:37,028 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 116 transitions, 252 flow [2020-10-22 02:01:37,031 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 116 transitions, 252 flow [2020-10-22 02:01:37,093 INFO L129 PetriNetUnfolder]: 3/112 cut-off events. [2020-10-22 02:01:37,093 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:01:37,099 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-22 02:01:37,103 INFO L116 LiptonReduction]: Number of co-enabled transitions 2508 [2020-10-22 02:01:37,569 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-10-22 02:01:38,464 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-22 02:01:40,126 WARN L193 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-10-22 02:01:40,324 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-22 02:01:40,399 INFO L131 LiptonReduction]: Checked pairs total: 6377 [2020-10-22 02:01:40,399 INFO L133 LiptonReduction]: Total number of compositions: 105 [2020-10-22 02:01:40,406 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 31 transitions, 82 flow [2020-10-22 02:01:40,537 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2090 states. [2020-10-22 02:01:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states. [2020-10-22 02:01:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 02:01:40,549 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:01:40,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:01:40,550 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:01:40,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:01:40,556 INFO L82 PathProgramCache]: Analyzing trace with hash 933139422, now seen corresponding path program 1 times [2020-10-22 02:01:40,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:01:40,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741611789] [2020-10-22 02:01:40,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:01:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:01:40,854 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 02:01:40,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741611789] [2020-10-22 02:01:40,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:01:40,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:01:40,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2014015114] [2020-10-22 02:01:40,857 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:01:40,861 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:01:40,876 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 02:01:40,876 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:01:40,881 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:01:40,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:01:40,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:01:40,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:01:40,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:01:40,900 INFO L87 Difference]: Start difference. First operand 2090 states. Second operand 3 states. [2020-10-22 02:01:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:01:40,993 INFO L93 Difference]: Finished difference Result 1770 states and 6672 transitions. [2020-10-22 02:01:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:01:40,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 02:01:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:01:41,028 INFO L225 Difference]: With dead ends: 1770 [2020-10-22 02:01:41,028 INFO L226 Difference]: Without dead ends: 1450 [2020-10-22 02:01:41,030 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 02:01:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-10-22 02:01:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-10-22 02:01:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-10-22 02:01:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 5376 transitions. [2020-10-22 02:01:41,175 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 5376 transitions. Word has length 9 [2020-10-22 02:01:41,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:01:41,176 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 5376 transitions. [2020-10-22 02:01:41,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:01:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 5376 transitions. [2020-10-22 02:01:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:01:41,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:01:41,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:01:41,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:01:41,182 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:01:41,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:01:41,182 INFO L82 PathProgramCache]: Analyzing trace with hash -901106048, now seen corresponding path program 1 times [2020-10-22 02:01:41,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:01:41,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628258094] [2020-10-22 02:01:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:01:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:01:41,333 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 02:01:41,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628258094] [2020-10-22 02:01:41,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:01:41,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:01:41,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [644753552] [2020-10-22 02:01:41,335 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:01:41,336 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:01:41,338 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 02:01:41,338 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:01:41,339 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:01:41,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:01:41,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:01:41,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:01:41,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:01:41,341 INFO L87 Difference]: Start difference. First operand 1450 states and 5376 transitions. Second operand 3 states. [2020-10-22 02:01:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:01:41,365 INFO L93 Difference]: Finished difference Result 1410 states and 5194 transitions. [2020-10-22 02:01:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:01:41,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 02:01:41,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:01:41,423 INFO L225 Difference]: With dead ends: 1410 [2020-10-22 02:01:41,424 INFO L226 Difference]: Without dead ends: 1410 [2020-10-22 02:01:41,425 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 02:01:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-10-22 02:01:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2020-10-22 02:01:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2020-10-22 02:01:41,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 5194 transitions. [2020-10-22 02:01:41,475 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 5194 transitions. Word has length 11 [2020-10-22 02:01:41,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:01:41,475 INFO L481 AbstractCegarLoop]: Abstraction has 1410 states and 5194 transitions. [2020-10-22 02:01:41,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:01:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 5194 transitions. [2020-10-22 02:01:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:01:41,478 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:01:41,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:01:41,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:01:41,479 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:01:41,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:01:41,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2130482962, now seen corresponding path program 1 times [2020-10-22 02:01:41,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:01:41,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986271712] [2020-10-22 02:01:41,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:01:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:01:41,528 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 02:01:41,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986271712] [2020-10-22 02:01:41,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:01:41,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:01:41,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1389702717] [2020-10-22 02:01:41,530 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:01:41,531 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:01:41,534 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-10-22 02:01:41,534 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:01:41,633 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:01:41,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:01:41,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:01:41,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:01:41,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:01:41,634 INFO L87 Difference]: Start difference. First operand 1410 states and 5194 transitions. Second operand 3 states. [2020-10-22 02:01:41,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:01:41,656 INFO L93 Difference]: Finished difference Result 1380 states and 5060 transitions. [2020-10-22 02:01:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:01:41,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-22 02:01:41,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:01:41,668 INFO L225 Difference]: With dead ends: 1380 [2020-10-22 02:01:41,668 INFO L226 Difference]: Without dead ends: 1380 [2020-10-22 02:01:41,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 02:01:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-10-22 02:01:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1380. [2020-10-22 02:01:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2020-10-22 02:01:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 5060 transitions. [2020-10-22 02:01:41,729 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 5060 transitions. Word has length 12 [2020-10-22 02:01:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:01:41,729 INFO L481 AbstractCegarLoop]: Abstraction has 1380 states and 5060 transitions. [2020-10-22 02:01:41,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:01:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 5060 transitions. [2020-10-22 02:01:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:01:41,732 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:01:41,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:01:41,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:01:41,732 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:01:41,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:01:41,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1620459652, now seen corresponding path program 1 times [2020-10-22 02:01:41,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:01:41,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754067901] [2020-10-22 02:01:41,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:01:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:01:41,771 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 02:01:41,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754067901] [2020-10-22 02:01:41,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:01:41,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:01:41,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1666688369] [2020-10-22 02:01:41,772 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:01:41,774 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:01:41,777 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 37 transitions. [2020-10-22 02:01:41,778 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:01:41,866 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:01:41,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:01:41,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:01:41,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:01:41,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:01:41,867 INFO L87 Difference]: Start difference. First operand 1380 states and 5060 transitions. Second operand 3 states. [2020-10-22 02:01:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:01:41,903 INFO L93 Difference]: Finished difference Result 1868 states and 6582 transitions. [2020-10-22 02:01:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:01:41,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-22 02:01:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:01:41,917 INFO L225 Difference]: With dead ends: 1868 [2020-10-22 02:01:41,917 INFO L226 Difference]: Without dead ends: 1460 [2020-10-22 02:01:41,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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 02:01:41,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-10-22 02:01:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1340. [2020-10-22 02:01:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2020-10-22 02:01:41,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 4694 transitions. [2020-10-22 02:01:41,977 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 4694 transitions. Word has length 13 [2020-10-22 02:01:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:01:41,978 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 4694 transitions. [2020-10-22 02:01:41,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:01:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 4694 transitions. [2020-10-22 02:01:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:01:41,980 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:01:41,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:01:41,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:01:41,981 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:01:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:01:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1620460799, now seen corresponding path program 1 times [2020-10-22 02:01:41,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:01:41,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795623487] [2020-10-22 02:01:41,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:01:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:01:42,056 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 02:01:42,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795623487] [2020-10-22 02:01:42,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:01:42,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:01:42,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [298671853] [2020-10-22 02:01:42,058 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:01:42,060 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:01:42,063 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 47 transitions. [2020-10-22 02:01:42,064 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:01:42,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:42,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:42,337 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [21913#(not (= 4 ~__unbuffered_cnt~0))] [2020-10-22 02:01:42,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:01:42,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:01:42,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:01:42,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:01:42,338 INFO L87 Difference]: Start difference. First operand 1340 states and 4694 transitions. Second operand 5 states. [2020-10-22 02:01:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:01:42,415 INFO L93 Difference]: Finished difference Result 1028 states and 3153 transitions. [2020-10-22 02:01:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:01:42,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 02:01:42,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:01:42,421 INFO L225 Difference]: With dead ends: 1028 [2020-10-22 02:01:42,421 INFO L226 Difference]: Without dead ends: 708 [2020-10-22 02:01:42,421 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 02:01:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2020-10-22 02:01:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2020-10-22 02:01:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2020-10-22 02:01:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1994 transitions. [2020-10-22 02:01:42,442 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1994 transitions. Word has length 13 [2020-10-22 02:01:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:01:42,442 INFO L481 AbstractCegarLoop]: Abstraction has 708 states and 1994 transitions. [2020-10-22 02:01:42,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:01:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1994 transitions. [2020-10-22 02:01:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 02:01:42,444 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:01:42,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:01:42,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:01:42,444 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:01:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:01:42,445 INFO L82 PathProgramCache]: Analyzing trace with hash 988719004, now seen corresponding path program 1 times [2020-10-22 02:01:42,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:01:42,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815449296] [2020-10-22 02:01:42,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:01:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:01:42,500 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 02:01:42,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815449296] [2020-10-22 02:01:42,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:01:42,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:01:42,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1552636874] [2020-10-22 02:01:42,501 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:01:42,506 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:01:42,519 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 113 transitions. [2020-10-22 02:01:42,519 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:01:43,167 WARN L193 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 3 [2020-10-22 02:01:43,716 WARN L193 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 02:01:43,902 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:01:43,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:01:43,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:01:43,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:01:43,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:01:43,904 INFO L87 Difference]: Start difference. First operand 708 states and 1994 transitions. Second operand 3 states. [2020-10-22 02:01:43,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:01:43,923 INFO L93 Difference]: Finished difference Result 990 states and 2682 transitions. [2020-10-22 02:01:43,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:01:43,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-10-22 02:01:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:01:43,928 INFO L225 Difference]: With dead ends: 990 [2020-10-22 02:01:43,929 INFO L226 Difference]: Without dead ends: 718 [2020-10-22 02:01:43,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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 02:01:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2020-10-22 02:01:43,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 700. [2020-10-22 02:01:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2020-10-22 02:01:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1861 transitions. [2020-10-22 02:01:43,962 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1861 transitions. Word has length 17 [2020-10-22 02:01:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:01:43,962 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 1861 transitions. [2020-10-22 02:01:43,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:01:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1861 transitions. [2020-10-22 02:01:43,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 02:01:43,965 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:01:43,966 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:01:43,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:01:43,966 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:01:43,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:01:43,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1905403439, now seen corresponding path program 1 times [2020-10-22 02:01:43,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:01:43,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990368795] [2020-10-22 02:01:43,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:01:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:01:44,112 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 02:01:44,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990368795] [2020-10-22 02:01:44,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:01:44,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:01:44,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1532167171] [2020-10-22 02:01:44,115 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:01:44,120 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:01:44,134 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 95 transitions. [2020-10-22 02:01:44,134 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:01:44,748 WARN L193 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 3 [2020-10-22 02:01:45,298 WARN L193 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 02:01:45,926 WARN L193 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 02:01:46,736 WARN L193 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 3 [2020-10-22 02:01:46,861 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [26761#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:01:46,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:01:46,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:01:46,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:01:46,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:01:46,862 INFO L87 Difference]: Start difference. First operand 700 states and 1861 transitions. Second operand 7 states. [2020-10-22 02:01:46,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:01:46,931 INFO L93 Difference]: Finished difference Result 607 states and 1569 transitions. [2020-10-22 02:01:46,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:01:46,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-22 02:01:46,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:01:46,935 INFO L225 Difference]: With dead ends: 607 [2020-10-22 02:01:46,935 INFO L226 Difference]: Without dead ends: 488 [2020-10-22 02:01:46,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:01:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-10-22 02:01:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2020-10-22 02:01:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2020-10-22 02:01:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1246 transitions. [2020-10-22 02:01:46,949 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1246 transitions. Word has length 17 [2020-10-22 02:01:46,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:01:46,950 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 1246 transitions. [2020-10-22 02:01:46,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:01:46,950 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1246 transitions. [2020-10-22 02:01:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 02:01:46,952 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:01:46,952 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] [2020-10-22 02:01:46,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:01:46,952 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:01:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:01:46,953 INFO L82 PathProgramCache]: Analyzing trace with hash -14022687, now seen corresponding path program 1 times [2020-10-22 02:01:46,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:01:46,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353679377] [2020-10-22 02:01:46,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:01:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:01:47,063 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 02:01:47,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353679377] [2020-10-22 02:01:47,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:01:47,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:01:47,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470313795] [2020-10-22 02:01:47,064 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:01:47,069 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:01:47,104 INFO L252 McrAutomatonBuilder]: Finished intersection with 159 states and 358 transitions. [2020-10-22 02:01:47,104 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:01:47,540 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 3 [2020-10-22 02:01:48,006 WARN L193 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 3 [2020-10-22 02:01:48,604 WARN L193 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 02:01:49,371 WARN L193 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 3 [2020-10-22 02:01:49,846 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 3 [2020-10-22 02:01:50,203 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [28354#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:01:50,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:01:50,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:01:50,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:01:50,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:01:50,205 INFO L87 Difference]: Start difference. First operand 488 states and 1246 transitions. Second operand 8 states. [2020-10-22 02:01:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:01:50,288 INFO L93 Difference]: Finished difference Result 465 states and 1200 transitions. [2020-10-22 02:01:50,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 02:01:50,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-10-22 02:01:50,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:01:50,291 INFO L225 Difference]: With dead ends: 465 [2020-10-22 02:01:50,291 INFO L226 Difference]: Without dead ends: 187 [2020-10-22 02:01:50,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:01:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-10-22 02:01:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2020-10-22 02:01:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-10-22 02:01:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 447 transitions. [2020-10-22 02:01:50,308 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 447 transitions. Word has length 20 [2020-10-22 02:01:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:01:50,309 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 447 transitions. [2020-10-22 02:01:50,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:01:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 447 transitions. [2020-10-22 02:01:50,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 02:01:50,310 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:01:50,310 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, 1, 1, 1] [2020-10-22 02:01:50,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:01:50,310 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:01:50,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:01:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash 735320181, now seen corresponding path program 1 times [2020-10-22 02:01:50,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:01:50,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980371774] [2020-10-22 02:01:50,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:01:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:01:50,411 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 02:01:50,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980371774] [2020-10-22 02:01:50,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:01:50,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:01:50,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1234332735] [2020-10-22 02:01:50,412 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:01:50,417 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:01:50,480 INFO L252 McrAutomatonBuilder]: Finished intersection with 191 states and 426 transitions. [2020-10-22 02:01:50,480 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:01:50,992 WARN L193 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 02:01:51,555 WARN L193 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 02:01:52,482 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:01:52,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:01:52,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:01:52,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:01:52,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:01:52,483 INFO L87 Difference]: Start difference. First operand 187 states and 447 transitions. Second operand 4 states. [2020-10-22 02:01:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:01:52,499 INFO L93 Difference]: Finished difference Result 252 states and 596 transitions. [2020-10-22 02:01:52,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:01:52,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-22 02:01:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:01:52,500 INFO L225 Difference]: With dead ends: 252 [2020-10-22 02:01:52,501 INFO L226 Difference]: Without dead ends: 79 [2020-10-22 02:01:52,502 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 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 02:01:52,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-22 02:01:52,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-22 02:01:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-22 02:01:52,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 165 transitions. [2020-10-22 02:01:52,504 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 165 transitions. Word has length 24 [2020-10-22 02:01:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:01:52,505 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 165 transitions. [2020-10-22 02:01:52,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:01:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 165 transitions. [2020-10-22 02:01:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 02:01:52,505 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:01:52,506 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, 1, 1, 1] [2020-10-22 02:01:52,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:01:52,508 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:01:52,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:01:52,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1951036389, now seen corresponding path program 2 times [2020-10-22 02:01:52,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:01:52,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995507589] [2020-10-22 02:01:52,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:01:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:01:52,648 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 02:01:52,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995507589] [2020-10-22 02:01:52,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:01:52,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:01:52,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1181731062] [2020-10-22 02:01:52,649 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:01:52,654 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:01:52,690 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 213 transitions. [2020-10-22 02:01:52,690 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:01:52,846 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 214 [2020-10-22 02:01:52,953 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-22 02:01:52,953 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:52,955 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:01:52,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:52,956 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-22 02:01:52,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:52,960 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:01:52,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:52,963 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 02:01:52,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:52,964 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:01:52,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:52,966 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:01:52,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:52,973 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 02:01:52,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:52,974 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:01:52,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:52,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:52,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:53,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:53,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:53,337 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 214 [2020-10-22 02:01:53,404 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-22 02:01:53,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,405 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:01:53,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,406 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-22 02:01:53,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,408 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:01:53,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,409 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 02:01:53,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,410 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 02:01:53,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,412 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 02:01:53,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,413 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 02:01:53,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,414 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 02:01:53,414 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:53,438 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:53,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:53,630 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-22 02:01:53,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,631 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-22 02:01:53,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,637 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:53,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,638 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:53,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,641 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:53,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:53,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:53,688 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-22 02:01:53,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,827 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-22 02:01:53,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,828 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-22 02:01:53,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,831 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:53,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,832 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:01:53,832 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,838 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:53,841 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:53,843 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:53,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:53,854 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:53,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,869 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:53,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,883 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-22 02:01:53,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,947 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-22 02:01:53,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,948 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-22 02:01:53,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,951 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:01:53,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,953 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:53,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,969 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:53,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:53,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,015 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:54,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:54,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,166 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:54,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:54,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,257 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:54,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,265 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-22 02:01:54,265 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,533 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-22 02:01:54,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,534 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-22 02:01:54,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,537 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:01:54,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,543 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,555 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:54,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:54,576 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:54,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:54,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:54,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,598 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:54,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,650 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:01:54,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:54,670 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:54,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:54,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:54,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,701 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,721 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-22 02:01:54,721 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,850 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 90 [2020-10-22 02:01:54,858 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-22 02:01:54,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,859 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-22 02:01:54,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,861 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:01:54,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:01:54,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:54,896 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:01:54,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:54,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:01:54,920 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:01:54,926 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:01:54,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:54,941 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-22 02:01:54,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:01:55,022 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [29617#(and (not (= ~z$w_buff0~0 0)) (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd4~0 256) 0)))] [2020-10-22 02:01:55,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:01:55,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:01:55,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:01:55,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:01:55,024 INFO L87 Difference]: Start difference. First operand 79 states and 165 transitions. Second operand 6 states. [2020-10-22 02:01:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:01:55,103 INFO L93 Difference]: Finished difference Result 97 states and 199 transitions. [2020-10-22 02:01:55,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:01:55,104 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-22 02:01:55,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:01:55,105 INFO L225 Difference]: With dead ends: 97 [2020-10-22 02:01:55,106 INFO L226 Difference]: Without dead ends: 51 [2020-10-22 02:01:55,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:01:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-22 02:01:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-22 02:01:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-22 02:01:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 89 transitions. [2020-10-22 02:01:55,109 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 89 transitions. Word has length 24 [2020-10-22 02:01:55,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:01:55,110 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 89 transitions. [2020-10-22 02:01:55,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:01:55,110 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 89 transitions. [2020-10-22 02:01:55,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 02:01:55,111 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:01:55,111 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, 1, 1, 1] [2020-10-22 02:01:55,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 02:01:55,111 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:01:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:01:55,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1990240619, now seen corresponding path program 3 times [2020-10-22 02:01:55,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:01:55,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182328441] [2020-10-22 02:01:55,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:01:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:01:55,159 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:01:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:01:55,200 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:01:55,244 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:01:55,244 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:01:55,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 02:01:55,246 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 02:01:55,361 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L2-->L862: Formula: (let ((.cse7 (= (mod ~z$r_buff0_thd0~0_In-111851842 256) 0)) (.cse6 (= (mod ~z$w_buff0_used~0_In-111851842 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In-111851842 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In-111851842 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and (= ~z$w_buff1_used~0_In-111851842 ~z$w_buff1_used~0_Out-111851842) .cse0) (and (= 0 ~z$w_buff1_used~0_Out-111851842) .cse1 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-111851842 0)) (or (and .cse3 (= ~z$w_buff0_used~0_Out-111851842 0) .cse4) (and .cse5 (= ~z$w_buff0_used~0_In-111851842 ~z$w_buff0_used~0_Out-111851842))) (= ~z$r_buff0_thd0~0_In-111851842 ~z$r_buff0_thd0~0_Out-111851842) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-111851842 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-111851842|) (= ~z$r_buff1_thd0~0_Out-111851842 ~z$r_buff1_thd0~0_In-111851842) (or (and (or (and (= ~z~0_In-111851842 ~z~0_Out-111851842) .cse0) (and .cse1 .cse2 (= ~z$w_buff1~0_In-111851842 ~z~0_Out-111851842))) .cse5) (and .cse3 (= ~z~0_Out-111851842 ~z$w_buff0~0_In-111851842) .cse4))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-111851842|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-111851842, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-111851842, ~z$w_buff0~0=~z$w_buff0~0_In-111851842, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-111851842, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-111851842, ~z$w_buff1~0=~z$w_buff1~0_In-111851842, ~z~0=~z~0_In-111851842} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-111851842, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-111851842|, ~z$w_buff0~0=~z$w_buff0~0_In-111851842, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-111851842, ~z$w_buff1~0=~z$w_buff1~0_In-111851842, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-111851842|, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-111851842|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-111851842|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-111851842|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-111851842, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-111851842|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-111851842|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-111851842, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-111851842, ~z~0=~z~0_Out-111851842} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ~z~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2020-10-22 02:01:55,369 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 02:01:55,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,370 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 02:01:55,370 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [805] [2020-10-22 02:01:55,372 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 02:01:55,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,372 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 02:01:55,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,373 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 02:01:55,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,373 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 02:01:55,373 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,374 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 02:01:55,374 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,374 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 02:01:55,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,375 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 02:01:55,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,375 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 02:01:55,375 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,376 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 02:01:55,376 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,376 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 02:01:55,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,377 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 02:01:55,377 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,377 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 02:01:55,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,378 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 02:01:55,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,378 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 02:01:55,378 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:01:55,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:01:55 BasicIcfg [2020-10-22 02:01:55,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:01:55,471 INFO L168 Benchmark]: Toolchain (without parser) took 21466.76 ms. Allocated memory was 146.3 MB in the beginning and 432.0 MB in the end (delta: 285.7 MB). Free memory was 101.1 MB in the beginning and 337.3 MB in the end (delta: -236.2 MB). Peak memory consumption was 335.9 MB. Max. memory is 7.1 GB. [2020-10-22 02:01:55,471 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-22 02:01:55,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 905.87 ms. Allocated memory was 146.3 MB in the beginning and 201.9 MB in the end (delta: 55.6 MB). Free memory was 100.0 MB in the beginning and 152.8 MB in the end (delta: -52.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-10-22 02:01:55,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.07 ms. Allocated memory is still 201.9 MB. Free memory was 152.8 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:01:55,477 INFO L168 Benchmark]: Boogie Preprocessor took 38.59 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 147.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:01:55,482 INFO L168 Benchmark]: RCFGBuilder took 1832.63 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 147.3 MB in the beginning and 210.3 MB in the end (delta: -63.0 MB). Peak memory consumption was 101.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:01:55,483 INFO L168 Benchmark]: TraceAbstraction took 18610.85 ms. Allocated memory was 248.5 MB in the beginning and 432.0 MB in the end (delta: 183.5 MB). Free memory was 208.4 MB in the beginning and 337.3 MB in the end (delta: -128.9 MB). Peak memory consumption was 341.0 MB. Max. memory is 7.1 GB. [2020-10-22 02:01:55,494 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 905.87 ms. Allocated memory was 146.3 MB in the beginning and 201.9 MB in the end (delta: 55.6 MB). Free memory was 100.0 MB in the beginning and 152.8 MB in the end (delta: -52.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.07 ms. Allocated memory is still 201.9 MB. Free memory was 152.8 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.59 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 147.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1832.63 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 147.3 MB in the beginning and 210.3 MB in the end (delta: -63.0 MB). Peak memory consumption was 101.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18610.85 ms. Allocated memory was 248.5 MB in the beginning and 432.0 MB in the end (delta: 183.5 MB). Free memory was 208.4 MB in the beginning and 337.3 MB in the end (delta: -128.9 MB). Peak memory consumption was 341.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1340 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 95 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.3s, 126 PlacesBefore, 43 PlacesAfterwards, 116 TransitionsBefore, 31 TransitionsAfterwards, 2508 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 105 TotalNumberOfCompositions, 6377 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1421; [L845] FCALL, FORK 0 pthread_create(&t1421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1422; [L847] FCALL, FORK 0 pthread_create(&t1422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1423; [L849] FCALL, FORK 0 pthread_create(&t1423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1424; [L851] FCALL, FORK 0 pthread_create(&t1424, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND FALSE 4 !(0) [L17] 4 __assert_fail ("0", "mix053_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L778] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L787] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix053_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 307 SDtfs, 267 SDslu, 446 SDs, 0 SdLazy, 163 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 242 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2090occurred 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.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 138 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 8877 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...