/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 12:39:36,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 12:39:36,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 12:39:36,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 12:39:36,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 12:39:36,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 12:39:36,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 12:39:36,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 12:39:36,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 12:39:36,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 12:39:36,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 12:39:36,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 12:39:36,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 12:39:36,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 12:39:36,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 12:39:36,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 12:39:36,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 12:39:36,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 12:39:36,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 12:39:36,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 12:39:36,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 12:39:36,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 12:39:36,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 12:39:36,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 12:39:36,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 12:39:36,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 12:39:36,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 12:39:36,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 12:39:36,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 12:39:36,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 12:39:36,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 12:39:36,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 12:39:36,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 12:39:36,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 12:39:36,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 12:39:36,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 12:39:36,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 12:39:36,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 12:39:36,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 12:39:36,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 12:39:36,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 12:39:36,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-09 12:39:36,823 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 12:39:36,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 12:39:36,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 12:39:36,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 12:39:36,825 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 12:39:36,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 12:39:36,825 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 12:39:36,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 12:39:36,825 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 12:39:36,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 12:39:36,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 12:39:36,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 12:39:36,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 12:39:36,826 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 12:39:36,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 12:39:36,827 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 12:39:36,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 12:39:36,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 12:39:36,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 12:39:36,827 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 12:39:36,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 12:39:36,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 12:39:36,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 12:39:36,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 12:39:36,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 12:39:36,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-09 12:39:36,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 12:39:36,829 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-09 12:39:36,829 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-09 12:39:36,829 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 12:39:37,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 12:39:37,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 12:39:37,153 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 12:39:37,155 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 12:39:37,155 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 12:39:37,156 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_tso.opt.i [2020-10-09 12:39:37,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f66876af/bfb0e08021724ea6aa8a2c944a371065/FLAGff43e062b [2020-10-09 12:39:37,742 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 12:39:37,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_tso.opt.i [2020-10-09 12:39:37,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f66876af/bfb0e08021724ea6aa8a2c944a371065/FLAGff43e062b [2020-10-09 12:39:38,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f66876af/bfb0e08021724ea6aa8a2c944a371065 [2020-10-09 12:39:38,056 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 12:39:38,058 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 12:39:38,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 12:39:38,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 12:39:38,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 12:39:38,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 12:39:38" (1/1) ... [2020-10-09 12:39:38,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fc2248a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:38, skipping insertion in model container [2020-10-09 12:39:38,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 12:39:38" (1/1) ... [2020-10-09 12:39:38,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 12:39:38,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 12:39:38,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 12:39:38,658 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 12:39:38,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 12:39:38,837 INFO L208 MainTranslator]: Completed translation [2020-10-09 12:39:38,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:38 WrapperNode [2020-10-09 12:39:38,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 12:39:38,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 12:39:38,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 12:39:38,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 12:39:38,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:38" (1/1) ... [2020-10-09 12:39:38,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:38" (1/1) ... [2020-10-09 12:39:38,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 12:39:38,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 12:39:38,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 12:39:38,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 12:39:38,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:38" (1/1) ... [2020-10-09 12:39:38,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:38" (1/1) ... [2020-10-09 12:39:38,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:38" (1/1) ... [2020-10-09 12:39:38,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:38" (1/1) ... [2020-10-09 12:39:38,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:38" (1/1) ... [2020-10-09 12:39:38,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:38" (1/1) ... [2020-10-09 12:39:38,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:38" (1/1) ... [2020-10-09 12:39:38,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 12:39:38,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 12:39:38,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 12:39:38,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 12:39:38,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:38" (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-09 12:39:39,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 12:39:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 12:39:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 12:39:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 12:39:39,037 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 12:39:39,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 12:39:39,038 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 12:39:39,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 12:39:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-09 12:39:39,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-09 12:39:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-09 12:39:39,040 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-09 12:39:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 12:39:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 12:39:39,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 12:39:39,042 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 12:39:41,168 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 12:39:41,168 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 12:39:41,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 12:39:41 BoogieIcfgContainer [2020-10-09 12:39:41,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 12:39:41,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 12:39:41,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 12:39:41,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 12:39:41,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 12:39:38" (1/3) ... [2020-10-09 12:39:41,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac1f201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 12:39:41, skipping insertion in model container [2020-10-09 12:39:41,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:39:38" (2/3) ... [2020-10-09 12:39:41,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac1f201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 12:39:41, skipping insertion in model container [2020-10-09 12:39:41,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 12:39:41" (3/3) ... [2020-10-09 12:39:41,181 INFO L111 eAbstractionObserver]: Analyzing ICFG mix029_tso.opt.i [2020-10-09 12:39:41,194 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-09 12:39:41,195 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 12:39:41,205 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 12:39:41,206 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 12:39:41,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,285 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,285 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,289 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,289 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,292 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,292 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,297 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,297 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,322 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,322 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,338 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,341 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,341 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,341 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,342 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,343 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,343 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,343 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,343 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,343 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,344 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,345 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,346 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,347 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,347 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,348 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,350 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,351 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,351 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,351 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:39:41,369 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-09 12:39:41,393 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 12:39:41,394 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-09 12:39:41,394 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 12:39:41,394 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 12:39:41,394 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 12:39:41,394 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 12:39:41,394 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 12:39:41,394 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 12:39:41,408 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-09 12:39:41,411 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-09 12:39:41,413 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-09 12:39:41,415 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-09 12:39:41,464 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-09 12:39:41,465 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 12:39:41,470 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-10-09 12:39:41,474 INFO L117 LiptonReduction]: Number of co-enabled transitions 2714 [2020-10-09 12:39:41,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:41,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:41,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:39:41,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:41,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:41,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:41,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:39:41,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:41,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:39:41,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:41,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:41,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:41,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:41,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:41,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:41,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:39:41,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:39:41,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:41,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:41,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:41,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:41,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:41,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:41,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:41,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:41,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:41,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:41,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:41,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:41,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:41,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:41,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:41,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:41,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:41,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:41,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:41,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:41,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:41,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:41,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:41,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:41,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:41,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:41,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:41,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:41,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:41,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:41,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:41,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:41,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:42,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:42,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:42,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:42,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:42,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:42,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 12:39:42,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:42,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:39:42,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:39:42,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:42,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:39:42,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:42,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:42,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:42,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:39:42,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:42,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:39:42,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:42,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:42,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:42,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:42,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:42,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:42,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:42,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:42,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:42,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:42,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:42,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:42,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:42,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:42,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:42,935 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-09 12:39:43,043 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-09 12:39:43,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:43,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:43,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:43,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:43,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:43,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:43,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:43,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:43,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:43,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:43,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:43,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:43,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:43,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:43,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:43,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:43,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:43,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:43,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:43,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:43,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:43,348 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-09 12:39:43,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:43,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:43,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:43,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:43,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:43,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:43,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:43,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:43,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:43,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:43,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:43,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 12:39:43,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:43,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:43,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:43,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:39:43,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:43,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:43,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:43,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:39:43,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:43,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:39:43,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:43,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:43,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:44,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:44,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:39:44,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:39:44,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:44,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:44,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:44,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:44,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:44,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:39:44,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:39:44,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:39:44,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:44,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:44,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:44,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:39:44,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:44,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:39:44,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:44,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:44,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:44,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:44,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:44,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:44,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:44,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:44,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:44,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:44,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:44,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:44,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:44,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:44,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:44,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:39:45,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:45,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:45,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:45,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:39:45,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:45,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:39:45,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:45,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:45,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:45,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:39:45,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:39:45,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:45,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:39:45,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:39:45,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:39:45,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:45,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:45,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:45,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:39:45,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:39:45,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:39:45,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:45,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:39:45,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:39:45,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:39:45,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:39:45,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:45,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:39:45,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:39:46,487 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-09 12:39:46,655 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-09 12:39:46,775 INFO L132 LiptonReduction]: Checked pairs total: 7814 [2020-10-09 12:39:46,775 INFO L134 LiptonReduction]: Total number of compositions: 87 [2020-10-09 12:39:46,784 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow [2020-10-09 12:39:47,107 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4874 states. [2020-10-09 12:39:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states. [2020-10-09 12:39:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-09 12:39:47,117 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:39:47,118 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-09 12:39:47,119 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:39:47,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:39:47,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1191868, now seen corresponding path program 1 times [2020-10-09 12:39:47,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:39:47,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213432450] [2020-10-09 12:39:47,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:39:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:39:47,390 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-09 12:39:47,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213432450] [2020-10-09 12:39:47,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:39:47,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:39:47,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953297484] [2020-10-09 12:39:47,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:39:47,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:39:47,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:39:47,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:39:47,412 INFO L87 Difference]: Start difference. First operand 4874 states. Second operand 3 states. [2020-10-09 12:39:47,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:39:47,569 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-10-09 12:39:47,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:39:47,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-09 12:39:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:39:47,645 INFO L225 Difference]: With dead ends: 4062 [2020-10-09 12:39:47,645 INFO L226 Difference]: Without dead ends: 3312 [2020-10-09 12:39:47,647 INFO L673 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-09 12:39:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2020-10-09 12:39:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2020-10-09 12:39:47,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2020-10-09 12:39:47,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2020-10-09 12:39:47,898 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 3 [2020-10-09 12:39:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:39:47,898 INFO L481 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2020-10-09 12:39:47,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:39:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2020-10-09 12:39:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-09 12:39:47,903 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:39:47,904 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:39:47,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-09 12:39:47,904 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:39:47,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:39:47,905 INFO L82 PathProgramCache]: Analyzing trace with hash -327406856, now seen corresponding path program 1 times [2020-10-09 12:39:47,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:39:47,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475539247] [2020-10-09 12:39:47,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:39:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:39:48,038 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-09 12:39:48,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475539247] [2020-10-09 12:39:48,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:39:48,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:39:48,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897053749] [2020-10-09 12:39:48,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:39:48,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:39:48,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:39:48,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:39:48,042 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states. [2020-10-09 12:39:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:39:48,087 INFO L93 Difference]: Finished difference Result 3262 states and 12720 transitions. [2020-10-09 12:39:48,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:39:48,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-09 12:39:48,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:39:48,118 INFO L225 Difference]: With dead ends: 3262 [2020-10-09 12:39:48,119 INFO L226 Difference]: Without dead ends: 3262 [2020-10-09 12:39:48,120 INFO L673 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-09 12:39:48,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2020-10-09 12:39:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3262. [2020-10-09 12:39:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2020-10-09 12:39:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 12720 transitions. [2020-10-09 12:39:48,257 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 12720 transitions. Word has length 11 [2020-10-09 12:39:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:39:48,258 INFO L481 AbstractCegarLoop]: Abstraction has 3262 states and 12720 transitions. [2020-10-09 12:39:48,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:39:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 12720 transitions. [2020-10-09 12:39:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-09 12:39:48,262 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:39:48,262 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:39:48,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-09 12:39:48,262 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:39:48,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:39:48,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1559477982, now seen corresponding path program 1 times [2020-10-09 12:39:48,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:39:48,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84346584] [2020-10-09 12:39:48,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:39:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:39:48,321 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-09 12:39:48,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84346584] [2020-10-09 12:39:48,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:39:48,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:39:48,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614564540] [2020-10-09 12:39:48,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:39:48,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:39:48,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:39:48,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:39:48,324 INFO L87 Difference]: Start difference. First operand 3262 states and 12720 transitions. Second operand 3 states. [2020-10-09 12:39:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:39:48,377 INFO L93 Difference]: Finished difference Result 3062 states and 11850 transitions. [2020-10-09 12:39:48,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:39:48,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-09 12:39:48,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:39:48,407 INFO L225 Difference]: With dead ends: 3062 [2020-10-09 12:39:48,407 INFO L226 Difference]: Without dead ends: 3062 [2020-10-09 12:39:48,408 INFO L673 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-09 12:39:48,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2020-10-09 12:39:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3062. [2020-10-09 12:39:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states. [2020-10-09 12:39:48,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 11850 transitions. [2020-10-09 12:39:48,627 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 11850 transitions. Word has length 12 [2020-10-09 12:39:48,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:39:48,628 INFO L481 AbstractCegarLoop]: Abstraction has 3062 states and 11850 transitions. [2020-10-09 12:39:48,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:39:48,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 11850 transitions. [2020-10-09 12:39:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-09 12:39:48,631 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:39:48,631 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:39:48,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-09 12:39:48,631 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:39:48,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:39:48,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1100407192, now seen corresponding path program 1 times [2020-10-09 12:39:48,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:39:48,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961263181] [2020-10-09 12:39:48,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:39:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:39:48,696 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-09 12:39:48,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961263181] [2020-10-09 12:39:48,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:39:48,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:39:48,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351168388] [2020-10-09 12:39:48,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:39:48,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:39:48,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:39:48,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:39:48,699 INFO L87 Difference]: Start difference. First operand 3062 states and 11850 transitions. Second operand 3 states. [2020-10-09 12:39:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:39:48,726 INFO L93 Difference]: Finished difference Result 3022 states and 11668 transitions. [2020-10-09 12:39:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:39:48,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-09 12:39:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:39:48,752 INFO L225 Difference]: With dead ends: 3022 [2020-10-09 12:39:48,753 INFO L226 Difference]: Without dead ends: 3022 [2020-10-09 12:39:48,753 INFO L673 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-09 12:39:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2020-10-09 12:39:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2020-10-09 12:39:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2020-10-09 12:39:48,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 11668 transitions. [2020-10-09 12:39:48,857 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 11668 transitions. Word has length 13 [2020-10-09 12:39:48,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:39:48,858 INFO L481 AbstractCegarLoop]: Abstraction has 3022 states and 11668 transitions. [2020-10-09 12:39:48,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:39:48,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 11668 transitions. [2020-10-09 12:39:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-09 12:39:48,861 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:39:48,861 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:39:48,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-09 12:39:48,861 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:39:48,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:39:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash 854550182, now seen corresponding path program 1 times [2020-10-09 12:39:48,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:39:48,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373820311] [2020-10-09 12:39:48,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:39:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:39:48,925 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-09 12:39:48,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373820311] [2020-10-09 12:39:48,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:39:48,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:39:48,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600921488] [2020-10-09 12:39:48,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:39:48,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:39:48,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:39:48,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:39:48,927 INFO L87 Difference]: Start difference. First operand 3022 states and 11668 transitions. Second operand 4 states. [2020-10-09 12:39:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:39:48,994 INFO L93 Difference]: Finished difference Result 2964 states and 10373 transitions. [2020-10-09 12:39:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-09 12:39:48,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-09 12:39:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:39:49,015 INFO L225 Difference]: With dead ends: 2964 [2020-10-09 12:39:49,015 INFO L226 Difference]: Without dead ends: 2214 [2020-10-09 12:39:49,016 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:39:49,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2020-10-09 12:39:49,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2214. [2020-10-09 12:39:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2020-10-09 12:39:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 7628 transitions. [2020-10-09 12:39:49,086 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 7628 transitions. Word has length 14 [2020-10-09 12:39:49,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:39:49,087 INFO L481 AbstractCegarLoop]: Abstraction has 2214 states and 7628 transitions. [2020-10-09 12:39:49,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:39:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 7628 transitions. [2020-10-09 12:39:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-09 12:39:49,090 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:39:49,091 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:39:49,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-09 12:39:49,091 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:39:49,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:39:49,091 INFO L82 PathProgramCache]: Analyzing trace with hash 935604432, now seen corresponding path program 1 times [2020-10-09 12:39:49,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:39:49,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554443634] [2020-10-09 12:39:49,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:39:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:39:49,175 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-09 12:39:49,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554443634] [2020-10-09 12:39:49,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:39:49,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-09 12:39:49,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011344516] [2020-10-09 12:39:49,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:39:49,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:39:49,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:39:49,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:39:49,177 INFO L87 Difference]: Start difference. First operand 2214 states and 7628 transitions. Second operand 3 states. [2020-10-09 12:39:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:39:49,202 INFO L93 Difference]: Finished difference Result 3270 states and 11011 transitions. [2020-10-09 12:39:49,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:39:49,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-10-09 12:39:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:39:49,212 INFO L225 Difference]: With dead ends: 3270 [2020-10-09 12:39:49,212 INFO L226 Difference]: Without dead ends: 2310 [2020-10-09 12:39:49,212 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:39:49,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2020-10-09 12:39:49,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2178. [2020-10-09 12:39:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2178 states. [2020-10-09 12:39:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 7215 transitions. [2020-10-09 12:39:49,276 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 7215 transitions. Word has length 17 [2020-10-09 12:39:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:39:49,276 INFO L481 AbstractCegarLoop]: Abstraction has 2178 states and 7215 transitions. [2020-10-09 12:39:49,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:39:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 7215 transitions. [2020-10-09 12:39:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-09 12:39:49,280 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:39:49,280 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:39:49,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-09 12:39:49,281 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:39:49,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:39:49,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1552882529, now seen corresponding path program 1 times [2020-10-09 12:39:49,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:39:49,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103634820] [2020-10-09 12:39:49,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:39:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:39:49,349 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-09 12:39:49,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103634820] [2020-10-09 12:39:49,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:39:49,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 12:39:49,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204593184] [2020-10-09 12:39:49,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 12:39:49,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:39:49,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 12:39:49,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:39:49,351 INFO L87 Difference]: Start difference. First operand 2178 states and 7215 transitions. Second operand 5 states. [2020-10-09 12:39:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:39:49,409 INFO L93 Difference]: Finished difference Result 1832 states and 5594 transitions. [2020-10-09 12:39:49,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:39:49,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-09 12:39:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:39:49,415 INFO L225 Difference]: With dead ends: 1832 [2020-10-09 12:39:49,416 INFO L226 Difference]: Without dead ends: 1402 [2020-10-09 12:39:49,416 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-09 12:39:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-10-09 12:39:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2020-10-09 12:39:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2020-10-09 12:39:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 4205 transitions. [2020-10-09 12:39:49,452 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 4205 transitions. Word has length 17 [2020-10-09 12:39:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:39:49,452 INFO L481 AbstractCegarLoop]: Abstraction has 1402 states and 4205 transitions. [2020-10-09 12:39:49,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 12:39:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 4205 transitions. [2020-10-09 12:39:49,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-09 12:39:49,456 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:39:49,456 INFO L421 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-09 12:39:49,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-09 12:39:49,457 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:39:49,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:39:49,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2019689364, now seen corresponding path program 1 times [2020-10-09 12:39:49,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:39:49,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443054844] [2020-10-09 12:39:49,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:39:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:39:49,574 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-09 12:39:49,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443054844] [2020-10-09 12:39:49,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:39:49,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 12:39:49,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883791135] [2020-10-09 12:39:49,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 12:39:49,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:39:49,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 12:39:49,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:39:49,576 INFO L87 Difference]: Start difference. First operand 1402 states and 4205 transitions. Second operand 6 states. [2020-10-09 12:39:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:39:49,659 INFO L93 Difference]: Finished difference Result 1239 states and 3690 transitions. [2020-10-09 12:39:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 12:39:49,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-09 12:39:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:39:49,664 INFO L225 Difference]: With dead ends: 1239 [2020-10-09 12:39:49,664 INFO L226 Difference]: Without dead ends: 1113 [2020-10-09 12:39:49,665 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-09 12:39:49,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2020-10-09 12:39:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2020-10-09 12:39:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2020-10-09 12:39:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 3362 transitions. [2020-10-09 12:39:49,695 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 3362 transitions. Word has length 20 [2020-10-09 12:39:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:39:49,695 INFO L481 AbstractCegarLoop]: Abstraction has 1113 states and 3362 transitions. [2020-10-09 12:39:49,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 12:39:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 3362 transitions. [2020-10-09 12:39:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-09 12:39:49,699 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:39:49,699 INFO L421 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-09 12:39:49,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-09 12:39:49,700 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:39:49,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:39:49,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1850353899, now seen corresponding path program 1 times [2020-10-09 12:39:49,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:39:49,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828506763] [2020-10-09 12:39:49,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:39:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:39:49,861 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-09 12:39:49,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828506763] [2020-10-09 12:39:49,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:39:49,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 12:39:49,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482790453] [2020-10-09 12:39:49,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 12:39:49,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:39:49,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 12:39:49,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-09 12:39:49,863 INFO L87 Difference]: Start difference. First operand 1113 states and 3362 transitions. Second operand 7 states. [2020-10-09 12:39:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:39:50,085 INFO L93 Difference]: Finished difference Result 1921 states and 5610 transitions. [2020-10-09 12:39:50,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 12:39:50,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-09 12:39:50,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:39:50,091 INFO L225 Difference]: With dead ends: 1921 [2020-10-09 12:39:50,092 INFO L226 Difference]: Without dead ends: 1674 [2020-10-09 12:39:50,092 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-09 12:39:50,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2020-10-09 12:39:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1352. [2020-10-09 12:39:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2020-10-09 12:39:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 4014 transitions. [2020-10-09 12:39:50,133 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 4014 transitions. Word has length 24 [2020-10-09 12:39:50,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:39:50,134 INFO L481 AbstractCegarLoop]: Abstraction has 1352 states and 4014 transitions. [2020-10-09 12:39:50,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 12:39:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 4014 transitions. [2020-10-09 12:39:50,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-09 12:39:50,138 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:39:50,138 INFO L421 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-09 12:39:50,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-09 12:39:50,139 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:39:50,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:39:50,139 INFO L82 PathProgramCache]: Analyzing trace with hash 301351231, now seen corresponding path program 2 times [2020-10-09 12:39:50,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:39:50,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380038558] [2020-10-09 12:39:50,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:39:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:39:50,294 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-09 12:39:50,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380038558] [2020-10-09 12:39:50,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:39:50,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-09 12:39:50,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775203903] [2020-10-09 12:39:50,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 12:39:50,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:39:50,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 12:39:50,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-09 12:39:50,296 INFO L87 Difference]: Start difference. First operand 1352 states and 4014 transitions. Second operand 7 states. [2020-10-09 12:39:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:39:50,391 INFO L93 Difference]: Finished difference Result 1322 states and 3950 transitions. [2020-10-09 12:39:50,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 12:39:50,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-09 12:39:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:39:50,395 INFO L225 Difference]: With dead ends: 1322 [2020-10-09 12:39:50,396 INFO L226 Difference]: Without dead ends: 941 [2020-10-09 12:39:50,396 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-09 12:39:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2020-10-09 12:39:50,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 941. [2020-10-09 12:39:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2020-10-09 12:39:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 2812 transitions. [2020-10-09 12:39:50,424 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 2812 transitions. Word has length 24 [2020-10-09 12:39:50,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:39:50,424 INFO L481 AbstractCegarLoop]: Abstraction has 941 states and 2812 transitions. [2020-10-09 12:39:50,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 12:39:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2812 transitions. [2020-10-09 12:39:50,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-09 12:39:50,427 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:39:50,428 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:39:50,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-09 12:39:50,428 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:39:50,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:39:50,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1383804645, now seen corresponding path program 1 times [2020-10-09 12:39:50,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:39:50,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523608782] [2020-10-09 12:39:50,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:39:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:39:50,599 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-09 12:39:50,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523608782] [2020-10-09 12:39:50,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:39:50,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:39:50,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154080550] [2020-10-09 12:39:50,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:39:50,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:39:50,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:39:50,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:39:50,601 INFO L87 Difference]: Start difference. First operand 941 states and 2812 transitions. Second operand 4 states. [2020-10-09 12:39:50,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:39:50,621 INFO L93 Difference]: Finished difference Result 1371 states and 4064 transitions. [2020-10-09 12:39:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-09 12:39:50,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-10-09 12:39:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:39:50,623 INFO L225 Difference]: With dead ends: 1371 [2020-10-09 12:39:50,624 INFO L226 Difference]: Without dead ends: 493 [2020-10-09 12:39:50,624 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:39:50,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2020-10-09 12:39:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2020-10-09 12:39:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-10-09 12:39:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1386 transitions. [2020-10-09 12:39:50,636 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1386 transitions. Word has length 28 [2020-10-09 12:39:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:39:50,636 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 1386 transitions. [2020-10-09 12:39:50,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:39:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1386 transitions. [2020-10-09 12:39:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-09 12:39:50,640 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:39:50,640 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:39:50,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-09 12:39:50,640 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:39:50,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:39:50,641 INFO L82 PathProgramCache]: Analyzing trace with hash -763891125, now seen corresponding path program 2 times [2020-10-09 12:39:50,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:39:50,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473073369] [2020-10-09 12:39:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:39:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:39:51,074 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-09 12:39:51,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473073369] [2020-10-09 12:39:51,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:39:51,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-09 12:39:51,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413639784] [2020-10-09 12:39:51,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 12:39:51,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:39:51,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 12:39:51,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-09 12:39:51,076 INFO L87 Difference]: Start difference. First operand 493 states and 1386 transitions. Second operand 8 states. [2020-10-09 12:39:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:39:51,362 INFO L93 Difference]: Finished difference Result 793 states and 2160 transitions. [2020-10-09 12:39:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 12:39:51,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-10-09 12:39:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:39:51,364 INFO L225 Difference]: With dead ends: 793 [2020-10-09 12:39:51,364 INFO L226 Difference]: Without dead ends: 586 [2020-10-09 12:39:51,365 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-09 12:39:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2020-10-09 12:39:51,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 493. [2020-10-09 12:39:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-10-09 12:39:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1332 transitions. [2020-10-09 12:39:51,380 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1332 transitions. Word has length 28 [2020-10-09 12:39:51,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:39:51,380 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 1332 transitions. [2020-10-09 12:39:51,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 12:39:51,381 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1332 transitions. [2020-10-09 12:39:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-09 12:39:51,382 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:39:51,382 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:39:51,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-09 12:39:51,383 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:39:51,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:39:51,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1982073503, now seen corresponding path program 3 times [2020-10-09 12:39:51,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:39:51,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871788913] [2020-10-09 12:39:51,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:39:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 12:39:51,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 12:39:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 12:39:51,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 12:39:51,642 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-09 12:39:51,642 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 12:39:51,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-09 12:39:51,644 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-09 12:39:51,675 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1152] [1152] L3-->L871: Formula: (let ((.cse6 (= (mod ~a$w_buff0_used~0_In7440151 256) 0)) (.cse7 (= (mod ~a$r_buff0_thd0~0_In7440151 256) 0)) (.cse8 (= (mod ~a$r_buff1_thd0~0_In7440151 256) 0)) (.cse9 (= (mod ~a$w_buff1_used~0_In7440151 256) 0))) (let ((.cse3 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse2 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (= ~a$r_buff0_thd0~0_In7440151 ~a$r_buff0_thd0~0_Out7440151) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In7440151 0)) (or (and (= ~a$w_buff0~0_In7440151 ~a~0_Out7440151) .cse0 .cse1) (and .cse2 (or (and (= ~a~0_In7440151 ~a~0_Out7440151) .cse3) (and (= ~a$w_buff1~0_In7440151 ~a~0_Out7440151) .cse4 .cse5)))) (or (and (= ~a$w_buff1_used~0_Out7440151 ~a$w_buff1_used~0_In7440151) .cse3) (and .cse4 (= ~a$w_buff1_used~0_Out7440151 0) .cse5)) (or (and .cse2 (= ~a$w_buff0_used~0_Out7440151 ~a$w_buff0_used~0_In7440151)) (and (= ~a$w_buff0_used~0_Out7440151 0) .cse0 .cse1)) (= ~a$r_buff1_thd0~0_In7440151 ~a$r_buff1_thd0~0_Out7440151)))) InVars {~a~0=~a~0_In7440151, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In7440151, ~a$w_buff1~0=~a$w_buff1~0_In7440151, ~a$w_buff0~0=~a$w_buff0~0_In7440151, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In7440151, ~a$w_buff0_used~0=~a$w_buff0_used~0_In7440151, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In7440151, ~a$w_buff1_used~0=~a$w_buff1_used~0_In7440151} OutVars{ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out7440151|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out7440151, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out7440151|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_Out7440151, ULTIMATE.start_main_#t~ite54=|ULTIMATE.start_main_#t~ite54_Out7440151|, ULTIMATE.start_main_#t~ite53=|ULTIMATE.start_main_#t~ite53_Out7440151|, ULTIMATE.start_main_#t~ite56=|ULTIMATE.start_main_#t~ite56_Out7440151|, ULTIMATE.start_main_#t~ite55=|ULTIMATE.start_main_#t~ite55_Out7440151|, ~a~0=~a~0_Out7440151, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In7440151, ~a$w_buff1~0=~a$w_buff1~0_In7440151, ~a$w_buff0~0=~a$w_buff0~0_In7440151, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out7440151, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out7440151} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite58, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ULTIMATE.start_main_#t~ite57, ~a$r_buff0_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55] because there is no mapped edge [2020-10-09 12:39:51,686 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-09 12:39:51,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,696 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-09 12:39:51,696 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,696 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-09 12:39:51,696 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,697 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-09 12:39:51,697 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,697 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-09 12:39:51,697 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,697 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-09 12:39:51,697 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,698 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-09 12:39:51,698 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,698 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-09 12:39:51,699 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,700 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-09 12:39:51,700 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,700 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-09 12:39:51,700 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,700 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-09 12:39:51,700 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,701 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-09 12:39:51,701 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,703 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-09 12:39:51,703 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,704 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-09 12:39:51,704 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,704 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-09 12:39:51,704 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,704 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-09 12:39:51,704 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,705 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-09 12:39:51,705 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,712 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-09 12:39:51,712 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,712 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-09 12:39:51,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,713 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-09 12:39:51,713 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,713 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-09 12:39:51,714 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,714 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-09 12:39:51,714 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,715 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-09 12:39:51,715 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,715 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-09 12:39:51,716 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,716 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-09 12:39:51,716 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,716 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-09 12:39:51,717 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,717 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-09 12:39:51,717 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,717 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-09 12:39:51,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,718 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-09 12:39:51,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,720 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-09 12:39:51,720 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,720 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-09 12:39:51,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,721 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-09 12:39:51,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,721 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-09 12:39:51,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,722 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-09 12:39:51,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:39:51,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 12:39:51 BasicIcfg [2020-10-09 12:39:51,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 12:39:51,855 INFO L168 Benchmark]: Toolchain (without parser) took 13797.18 ms. Allocated memory was 250.6 MB in the beginning and 585.6 MB in the end (delta: 335.0 MB). Free memory was 206.3 MB in the beginning and 324.6 MB in the end (delta: -118.3 MB). Peak memory consumption was 216.7 MB. Max. memory is 14.2 GB. [2020-10-09 12:39:51,856 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 12:39:51,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.36 ms. Allocated memory was 250.6 MB in the beginning and 312.5 MB in the end (delta: 61.9 MB). Free memory was 206.3 MB in the beginning and 258.2 MB in the end (delta: -51.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 14.2 GB. [2020-10-09 12:39:51,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.60 ms. Allocated memory is still 312.5 MB. Free memory was 258.2 MB in the beginning and 255.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 12:39:51,858 INFO L168 Benchmark]: Boogie Preprocessor took 49.04 ms. Allocated memory is still 312.5 MB. Free memory was 255.7 MB in the beginning and 253.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 12:39:51,859 INFO L168 Benchmark]: RCFGBuilder took 2220.10 ms. Allocated memory was 312.5 MB in the beginning and 356.5 MB in the end (delta: 44.0 MB). Free memory was 253.2 MB in the beginning and 161.6 MB in the end (delta: 91.6 MB). Peak memory consumption was 135.6 MB. Max. memory is 14.2 GB. [2020-10-09 12:39:51,860 INFO L168 Benchmark]: TraceAbstraction took 10680.51 ms. Allocated memory was 356.5 MB in the beginning and 585.6 MB in the end (delta: 229.1 MB). Free memory was 158.2 MB in the beginning and 324.6 MB in the end (delta: -166.4 MB). Peak memory consumption was 62.7 MB. Max. memory is 14.2 GB. [2020-10-09 12:39:51,863 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 250.6 MB. Free memory is still 227.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 778.36 ms. Allocated memory was 250.6 MB in the beginning and 312.5 MB in the end (delta: 61.9 MB). Free memory was 206.3 MB in the beginning and 258.2 MB in the end (delta: -51.8 MB). Peak memory consumption was 30.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 63.60 ms. Allocated memory is still 312.5 MB. Free memory was 258.2 MB in the beginning and 255.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 49.04 ms. Allocated memory is still 312.5 MB. Free memory was 255.7 MB in the beginning and 253.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2220.10 ms. Allocated memory was 312.5 MB in the beginning and 356.5 MB in the end (delta: 44.0 MB). Free memory was 253.2 MB in the beginning and 161.6 MB in the end (delta: 91.6 MB). Peak memory consumption was 135.6 MB. Max. memory is 14.2 GB. * TraceAbstraction took 10680.51 ms. Allocated memory was 356.5 MB in the beginning and 585.6 MB in the end (delta: 229.1 MB). Free memory was 158.2 MB in the beginning and 324.6 MB in the end (delta: -166.4 MB). Peak memory consumption was 62.7 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1738 VarBasedMoverChecksPositive, 112 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 96 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 217 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.3s, 123 PlacesBefore, 47 PlacesAfterwards, 112 TransitionsBefore, 34 TransitionsAfterwards, 2714 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 87 TotalNumberOfCompositions, 7814 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L708] 0 _Bool a$flush_delayed; [L709] 0 int a$mem_tmp; [L710] 0 _Bool a$r_buff0_thd0; [L711] 0 _Bool a$r_buff0_thd1; [L712] 0 _Bool a$r_buff0_thd2; [L713] 0 _Bool a$r_buff0_thd3; [L714] 0 _Bool a$r_buff0_thd4; [L715] 0 _Bool a$r_buff1_thd0; [L716] 0 _Bool a$r_buff1_thd1; [L717] 0 _Bool a$r_buff1_thd2; [L718] 0 _Bool a$r_buff1_thd3; [L719] 0 _Bool a$r_buff1_thd4; [L720] 0 _Bool a$read_delayed; [L721] 0 int *a$read_delayed_var; [L722] 0 int a$w_buff0; [L723] 0 _Bool a$w_buff0_used; [L724] 0 int a$w_buff1; [L725] 0 _Bool a$w_buff1_used; [L726] 0 _Bool main$tmp_guard0; [L727] 0 _Bool main$tmp_guard1; [L729] 0 int x = 0; [L731] 0 int y = 0; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L853] 0 pthread_t t797; [L854] FCALL, FORK 0 pthread_create(&t797, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 a$w_buff1 = a$w_buff0 [L740] 1 a$w_buff0 = 1 [L741] 1 a$w_buff1_used = a$w_buff0_used [L742] 1 a$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L744] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L745] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L746] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L747] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L748] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L749] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t798; [L856] FCALL, FORK 0 pthread_create(&t798, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t799; [L858] FCALL, FORK 0 pthread_create(&t799, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, z=0] [L789] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L775] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L775] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L776] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L776] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L777] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L777] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L778] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L778] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L779] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L779] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L795] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L795] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L795] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L795] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L796] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L797] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L797] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L798] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L798] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L799] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L799] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L802] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 3 return 0; [L859] 0 pthread_t t800; [L860] FCALL, FORK 0 pthread_create(&t800, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L809] 4 z = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L812] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L815] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 4 a$flush_delayed = weak$$choice2 [L818] 4 a$mem_tmp = a [L819] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L819] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L820] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L820] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L820] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0 [L820] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L820] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L820] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L821] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L821] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L822] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L822] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L823] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L823] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L824] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L824] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L824] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L824] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L824] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L825] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L826] 4 __unbuffered_p3_EBX = a [L827] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L827] 4 a = a$flush_delayed ? a$mem_tmp : a [L828] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=1, y=2, z=2] [L831] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L831] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L832] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L832] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L833] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L833] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L834] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L834] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L835] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L835] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L755] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L755] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L756] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L757] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L757] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L758] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L758] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L759] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L759] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=9, weak$$choice2=0, x=1, y=2, z=2] [L873] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=9, weak$$choice2=0, x=1, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 424 SDtfs, 734 SDslu, 691 SDs, 0 SdLazy, 256 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4874occurred 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.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 547 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 24379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...