java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/SifaC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a32b1f7 [2019-08-18 11:21:24,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-18 11:21:24,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-18 11:21:24,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-18 11:21:24,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-18 11:21:24,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-18 11:21:24,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-18 11:21:24,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-18 11:21:24,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-18 11:21:24,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-18 11:21:24,062 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-18 11:21:24,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-18 11:21:24,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-18 11:21:24,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-18 11:21:24,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-18 11:21:24,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-18 11:21:24,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-18 11:21:24,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-18 11:21:24,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-18 11:21:24,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-18 11:21:24,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-18 11:21:24,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-18 11:21:24,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-18 11:21:24,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-18 11:21:24,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-18 11:21:24,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-18 11:21:24,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-18 11:21:24,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-18 11:21:24,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-18 11:21:24,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-18 11:21:24,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-18 11:21:24,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-18 11:21:24,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-18 11:21:24,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-18 11:21:24,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-18 11:21:24,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-18 11:21:24,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-18 11:21:24,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-18 11:21:24,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-18 11:21:24,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-18 11:21:24,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-18 11:21:24,092 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 [2019-08-18 11:21:24,107 INFO L113 SettingsManager]: Loading preferences was successful [2019-08-18 11:21:24,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-08-18 11:21:24,109 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-08-18 11:21:24,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-08-18 11:21:24,109 INFO L138 SettingsManager]: * Use SBE=true [2019-08-18 11:21:24,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-08-18 11:21:24,110 INFO L138 SettingsManager]: * sizeof long=4 [2019-08-18 11:21:24,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-08-18 11:21:24,110 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-08-18 11:21:24,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-08-18 11:21:24,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-08-18 11:21:24,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-08-18 11:21:24,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-08-18 11:21:24,112 INFO L138 SettingsManager]: * sizeof long double=12 [2019-08-18 11:21:24,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-08-18 11:21:24,112 INFO L138 SettingsManager]: * Use constant arrays=true [2019-08-18 11:21:24,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-08-18 11:21:24,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-08-18 11:21:24,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-08-18 11:21:24,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-08-18 11:21:24,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-08-18 11:21:24,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-08-18 11:21:24,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-08-18 11:21:24,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-08-18 11:21:24,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-08-18 11:21:24,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-08-18 11:21:24,114 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-08-18 11:21:24,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-08-18 11:21:24,115 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-08-18 11:21:24,156 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-18 11:21:24,168 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-18 11:21:24,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-18 11:21:24,177 INFO L271 PluginConnector]: Initializing CDTParser... [2019-08-18 11:21:24,177 INFO L275 PluginConnector]: CDTParser initialized [2019-08-18 11:21:24,178 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-08-18 11:21:24,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3780117fe/59fc0db3ec874c9587ecda98a2dc110b/FLAGbfe0d73d6 [2019-08-18 11:21:24,854 INFO L306 CDTParser]: Found 1 translation units. [2019-08-18 11:21:24,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-08-18 11:21:24,872 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3780117fe/59fc0db3ec874c9587ecda98a2dc110b/FLAGbfe0d73d6 [2019-08-18 11:21:25,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3780117fe/59fc0db3ec874c9587ecda98a2dc110b [2019-08-18 11:21:25,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-18 11:21:25,143 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-18 11:21:25,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-08-18 11:21:25,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-08-18 11:21:25,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-08-18 11:21:25,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 11:21:25" (1/1) ... [2019-08-18 11:21:25,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7aee02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:21:25, skipping insertion in model container [2019-08-18 11:21:25,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 11:21:25" (1/1) ... [2019-08-18 11:21:25,163 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-08-18 11:21:25,223 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-08-18 11:21:25,736 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-08-18 11:21:25,749 INFO L188 MainTranslator]: Completed pre-run [2019-08-18 11:21:25,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-08-18 11:21:25,888 INFO L192 MainTranslator]: Completed translation [2019-08-18 11:21:25,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:21:25 WrapperNode [2019-08-18 11:21:25,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-08-18 11:21:25,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-18 11:21:25,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-18 11:21:25,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-18 11:21:25,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:21:25" (1/1) ... [2019-08-18 11:21:25,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:21:25" (1/1) ... [2019-08-18 11:21:25,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:21:25" (1/1) ... [2019-08-18 11:21:25,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:21:25" (1/1) ... [2019-08-18 11:21:25,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:21:25" (1/1) ... [2019-08-18 11:21:25,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:21:25" (1/1) ... [2019-08-18 11:21:25,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:21:25" (1/1) ... [2019-08-18 11:21:26,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-18 11:21:26,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-18 11:21:26,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-18 11:21:26,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-18 11:21:26,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 11:21:25" (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 [2019-08-18 11:21:26,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-08-18 11:21:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-18 11:21:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-18 11:21:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-08-18 11:21:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-08-18 11:21:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-08-18 11:21:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-08-18 11:21:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-08-18 11:21:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-08-18 11:21:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-08-18 11:21:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-08-18 11:21:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-08-18 11:21:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-08-18 11:21:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-08-18 11:21:26,095 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-08-18 11:21:26,095 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-08-18 11:21:26,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-18 11:21:26,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-08-18 11:21:26,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-18 11:21:27,386 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-18 11:21:27,386 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-18 11:21:27,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 11:21:27 BoogieIcfgContainer [2019-08-18 11:21:27,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-18 11:21:27,388 INFO L113 PluginConnector]: ------------------------Symbolic Interpretation---------------------------- [2019-08-18 11:21:27,389 INFO L271 PluginConnector]: Initializing Symbolic Interpretation... [2019-08-18 11:21:27,389 INFO L275 PluginConnector]: Symbolic Interpretation initialized [2019-08-18 11:21:27,390 INFO L185 PluginConnector]: Executing the observer SymbolicInterpretationObserver from plugin Symbolic Interpretation for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 11:21:27" (1/1) ... [2019-08-18 11:21:27,403 INFO L148 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-08-18 11:21:27,406 INFO L155 IcfgInterpreter]: Building call graph [2019-08-18 11:21:27,416 INFO L160 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-08-18 11:21:27,423 INFO L165 IcfgInterpreter]: Starting interpretation [2019-08-18 11:21:27,425 INFO L185 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 [2019-08-18 11:21:27,543 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-18 11:21:27,544 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-18 11:21:27,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2019-08-18 11:21:27,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-18 11:21:27,750 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-08-18 11:21:27,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-18 11:21:27,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-18 11:21:27,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-18 11:21:27,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-18 11:21:27,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2019-08-18 11:21:27,781 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-18 11:21:27,973 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-08-18 11:21:27,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-18 11:21:27,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-18 11:21:27,976 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:151, output treesize:157 [2019-08-18 11:21:28,036 INFO L185 IcfgInterpreter]: Interpreting procedure main with input of size 183 [2019-08-18 11:21:28,885 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:28,988 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,087 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,297 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,430 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,450 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,459 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,499 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,505 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,506 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,516 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,524 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,535 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,543 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,552 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,559 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,572 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,670 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,683 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,693 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,702 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,724 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,765 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,768 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,786 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,836 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,845 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,877 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:29,943 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,010 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,084 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,159 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,421 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,477 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,532 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,756 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,762 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,805 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,823 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,827 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,839 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,847 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,854 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,863 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,874 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,922 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,932 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,940 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,987 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:30,994 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,000 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,007 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,016 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,026 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,040 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,044 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,056 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,081 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,148 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,149 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,156 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,168 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,174 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,206 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,215 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,227 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,230 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,241 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,243 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,244 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,291 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,302 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,349 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,367 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,372 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,382 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,390 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,419 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,426 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,435 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,498 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,501 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,502 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,508 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,514 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,519 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,525 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,531 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,537 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,550 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,558 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,564 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,569 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,574 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,580 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,597 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,605 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,641 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,650 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,657 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,661 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,669 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,675 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,682 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,686 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,694 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,700 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,706 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,788 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,789 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,800 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,834 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,857 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,878 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,879 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,912 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,914 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,915 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,949 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,977 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,978 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,982 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:31,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,031 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,112 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,123 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,128 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,144 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,146 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,155 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,157 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,162 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,167 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,183 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,202 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,204 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,242 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,249 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,290 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,295 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,305 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,311 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,366 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,369 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,373 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,375 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,377 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,385 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,388 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,392 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-18 11:21:32,422 INFO L169 IcfgInterpreter]: Interpretation finished [2019-08-18 11:21:32,423 INFO L177 IcfgInterpreter]: Final predicates for locations of interest are: [2019-08-18 11:21:32,426 INFO L179 IcfgInterpreter]: Location mainErr4ASSERT_VIOLATIONERROR_FUNCTION has predicate 4892#(and (= ~nomsg~0 ~p2_new~0) (= ~nomsg~0 ~p1_new~0) (= ~__return_1744~0 main_~check__tmp~6) (= (mod main_~assert__arg~6 256) 0) (not (<= 3 (mod ~r1~0 256))) (or (and (= ~nomsg~0 main_~node3__m3~4) (= 0 ~mode3~0) (or (and (= 0 ~mode2~0) (or (and (= 0 ~mode1~0) (= ~send2~0 main_~node2__m2~3) (= main_~node1__m1~1 ~id1~0) (not (< ~id1~0 main_~node1__m1~1)) (< ~id2~0 main_~node2__m2~3) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (not (= main_~node2__m2~3 ~id2~0)) (not (< ~id1~0 main_~node1__m1~1)) (not (< ~id2~0 main_~node2__m2~3)) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (= ~nomsg~0 main_~node2__m2~3) (not (< ~id1~0 main_~node1__m1~1)) (= 0 ~mode2~0) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))))) (and (or (and (not (= ~nomsg~0 main_~node3__m3~4)) (not (= ~id3~0 main_~node3__m3~4)) (not (< ~id3~0 main_~node3__m3~4)) (or (and (= 0 ~mode2~0) (or (and (= 0 ~mode1~0) (= ~send2~0 main_~node2__m2~3) (= main_~node1__m1~1 ~id1~0) (not (< ~id1~0 main_~node1__m1~1)) (< ~id2~0 main_~node2__m2~3) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (not (= main_~node2__m2~3 ~id2~0)) (not (< ~id1~0 main_~node1__m1~1)) (not (< ~id2~0 main_~node2__m2~3)) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (= ~nomsg~0 main_~node2__m2~3) (not (< ~id1~0 main_~node1__m1~1)) (= 0 ~mode2~0) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))))) (and (not (= ~nomsg~0 main_~node3__m3~4)) (= ~send3~0 main_~node3__m3~4) (< ~id3~0 main_~node3__m3~4) (or (and (= 0 ~mode2~0) (or (and (= 0 ~mode1~0) (= ~send2~0 main_~node2__m2~3) (= main_~node1__m1~1 ~id1~0) (not (< ~id1~0 main_~node1__m1~1)) (< ~id2~0 main_~node2__m2~3) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (not (= main_~node2__m2~3 ~id2~0)) (not (< ~id1~0 main_~node1__m1~1)) (not (< ~id2~0 main_~node2__m2~3)) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (= ~nomsg~0 main_~node2__m2~3) (not (< ~id1~0 main_~node1__m1~1)) (= 0 ~mode2~0) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0)))))) (= 0 ~mode3~0))) (not (= (+ ~st3~0 ~st1~0 ~st2~0) 0)) (= 0 main_~check__tmp~6) (= main_~__tmp_7~0 (ite (= main_~main__c1~0 0) 0 1)) (= main_~__tmp_7~0 main_~assert__arg~6) (= main_~main__c1~0 ~__return_1744~0) (<= (+ ~st3~0 ~st1~0 ~st2~0) 1) (= ~p3_new~0 ~nomsg~0)) [2019-08-18 11:21:32,426 INFO L179 IcfgInterpreter]: Location mainErr0ASSERT_VIOLATIONERROR_FUNCTION has predicate 7884#(and (= 0 (mod main_~assert__arg~2 256)) (or (and (= ~nomsg~0 ~p1_new~0) (= ~nomsg~0 ~p2_new~0) (not (<= (+ ~st3~0 ~st1~0 ~st2~0) 1)) (not (= ~nomsg~0 main_~node3__m3~5)) (= ~id3~0 main_~node3__m3~5) (= 0 ~mode3~0) (not (= ~nomsg~0 main_~node2__m2~3)) (not (= main_~node1__m1~1 ~nomsg~0)) (= 0 ~mode1~0) (= ~__return_2228~0 main_~check__tmp~9) (= main_~node2__m2~3 ~id2~0) (= main_~node1__m1~1 ~id1~0) (= ~st2~0 1) (= 0 main_~check__tmp~9) (= ~st3~0 1) (not (< ~id1~0 main_~node1__m1~1)) (not (< ~id2~0 main_~node2__m2~3)) (= ~p3_new~0 ~nomsg~0) (= main_~main__c1~0 ~__return_2228~0) (not (< ~id3~0 main_~node3__m3~5)) (= 0 ~mode2~0) (= ~st1~0 1)) (and (= main_~main__c1~0 ~__return_1594~0) (= ~__return_1594~0 main_~check__tmp~2))) (= main_~__tmp_3~0 main_~assert__arg~2) (= main_~__tmp_3~0 (ite (= main_~main__c1~0 0) 0 1))) [2019-08-18 11:21:32,427 INFO L179 IcfgInterpreter]: Location mainErr1ASSERT_VIOLATIONERROR_FUNCTION has predicate 6068#(and (= ~nomsg~0 ~p2_new~0) (= ~nomsg~0 ~p1_new~0) (= 0 (mod main_~assert__arg~3 256)) (not (<= 3 (mod ~r1~0 256))) (= main_~__tmp_4~0 main_~assert__arg~3) (not (< ~id3~0 main_~node3__m3~1)) (= ~id3~0 main_~node3__m3~1) (= ~__return_1827~0 main_~check__tmp~3) (not (= (+ ~st3~0 ~st1~0 ~st2~0) 0)) (= 0 ~mode3~0) (= main_~main__c1~0 ~__return_1827~0) (not (= ~nomsg~0 main_~node3__m3~1)) (= main_~__tmp_4~0 (ite (= main_~main__c1~0 0) 0 1)) (= ~st3~0 1) (or (and (= ~nomsg~0 main_~node2__m2~1) (= 0 ~mode2~0) (= ~mode1~0 0)) (and (or (and (= ~send2~0 main_~node2__m2~1) (< ~id2~0 main_~node2__m2~1) (not (= ~nomsg~0 main_~node2__m2~1)) (= ~mode1~0 0)) (and (not (= main_~node2__m2~1 ~id2~0)) (not (< ~id2~0 main_~node2__m2~1)) (not (= ~nomsg~0 main_~node2__m2~1)) (= ~mode1~0 0))) (= 0 ~mode2~0))) (<= (+ ~st3~0 ~st1~0 ~st2~0) 1) (= 0 main_~check__tmp~3) (= ~p3_new~0 ~nomsg~0)) [2019-08-18 11:21:32,427 INFO L179 IcfgInterpreter]: Location mainErr2ASSERT_VIOLATIONERROR_FUNCTION has predicate 6044#(and (= ~nomsg~0 ~p2_new~0) (= ~nomsg~0 ~p1_new~0) (= main_~__tmp_5~0 main_~assert__arg~4) (= ~__return_2004~0 main_~check__tmp~4) (= main_~__tmp_5~0 (ite (= main_~main__c1~0 0) 0 1)) (not (<= 3 (mod ~r1~0 256))) (= main_~main__c1~0 ~__return_2004~0) (not (= (+ ~st3~0 ~st1~0 ~st2~0) 0)) (= 0 (mod main_~assert__arg~4 256)) (or (and (= main_~node2__m2~1 ~id2~0) (= ~st2~0 1) (not (< ~id2~0 main_~node2__m2~1)) (not (= ~nomsg~0 main_~node2__m2~1)) (= 0 ~mode2~0) (= ~mode1~0 0) (= 0 ~mode3~0) (= ~nomsg~0 main_~node3__m3~3)) (and (or (and (= main_~node2__m2~1 ~id2~0) (= ~st2~0 1) (not (< ~id2~0 main_~node2__m2~1)) (not (= ~nomsg~0 main_~node2__m2~1)) (< ~id3~0 main_~node3__m3~3) (not (= ~nomsg~0 main_~node3__m3~3)) (= ~send3~0 main_~node3__m3~3) (= 0 ~mode2~0) (= ~mode1~0 0)) (and (= main_~node2__m2~1 ~id2~0) (not (= ~id3~0 main_~node3__m3~3)) (= ~st2~0 1) (not (< ~id2~0 main_~node2__m2~1)) (not (= ~nomsg~0 main_~node2__m2~1)) (not (= ~nomsg~0 main_~node3__m3~3)) (= 0 ~mode2~0) (= ~mode1~0 0) (not (< ~id3~0 main_~node3__m3~3)))) (= 0 ~mode3~0))) (= 0 main_~check__tmp~4) (<= (+ ~st3~0 ~st1~0 ~st2~0) 1) (= ~p3_new~0 ~nomsg~0)) [2019-08-18 11:21:32,427 INFO L179 IcfgInterpreter]: Location mainErr5ASSERT_VIOLATIONERROR_FUNCTION has predicate 4914#(and (= ~nomsg~0 ~p1_new~0) (= ~nomsg~0 ~p2_new~0) (not (<= (+ ~st3~0 ~st1~0 ~st2~0) 1)) (not (= ~nomsg~0 main_~node3__m3~4)) (= main_~__tmp_8~0 main_~assert__arg~7) (= main_~main__c1~0 ~__return_1893~0) (= ~id3~0 main_~node3__m3~4) (= 0 main_~check__tmp~7) (not (< ~id3~0 main_~node3__m3~4)) (= 0 ~mode3~0) (or (and (= 0 ~mode2~0) (or (and (= 0 ~mode1~0) (= ~send2~0 main_~node2__m2~3) (= main_~node1__m1~1 ~id1~0) (not (< ~id1~0 main_~node1__m1~1)) (< ~id2~0 main_~node2__m2~3) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (not (= main_~node2__m2~3 ~id2~0)) (not (< ~id1~0 main_~node1__m1~1)) (not (< ~id2~0 main_~node2__m2~3)) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (= ~nomsg~0 main_~node2__m2~3) (not (< ~id1~0 main_~node1__m1~1)) (= 0 ~mode2~0) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0)))) (= ~st3~0 1) (= (mod main_~assert__arg~7 256) 0) (= main_~__tmp_8~0 (ite (= main_~main__c1~0 0) 0 1)) (= ~__return_1893~0 main_~check__tmp~7) (= ~p3_new~0 ~nomsg~0)) [2019-08-18 11:21:32,428 INFO L179 IcfgInterpreter]: Location mainErr3ASSERT_VIOLATIONERROR_FUNCTION has predicate 6082#(and (= ~nomsg~0 ~p1_new~0) (= ~nomsg~0 ~p2_new~0) (= main_~node2__m2~1 ~id2~0) (not (<= (+ ~st3~0 ~st1~0 ~st2~0) 1)) (not (< ~id2~0 main_~node2__m2~1)) (= main_~main__c1~0 ~__return_2162~0) (= main_~__tmp_6~0 (ite (= main_~main__c1~0 0) 0 1)) (= 0 main_~check__tmp~5) (= ~mode1~0 0) (= (mod main_~assert__arg~5 256) 0) (= 0 ~mode3~0) (= main_~__tmp_6~0 main_~assert__arg~5) (= ~id3~0 main_~node3__m3~3) (= ~st2~0 1) (= ~st3~0 1) (not (= ~nomsg~0 main_~node2__m2~1)) (= ~__return_2162~0 main_~check__tmp~5) (= ~p3_new~0 ~nomsg~0) (not (= ~nomsg~0 main_~node3__m3~3)) (= 0 ~mode2~0) (not (< ~id3~0 main_~node3__m3~3))) [2019-08-18 11:21:32,428 INFO L179 IcfgInterpreter]: Location mainErr6ASSERT_VIOLATIONERROR_FUNCTION has predicate 6653#(and (= 0 (mod main_~assert__arg~8 256)) (= main_~main__c1~0 ~__return_2082~0) (= main_~__tmp_9~0 main_~assert__arg~8) (not (<= (+ ~st3~0 ~st1~0 ~st2~0) 1)) (= ~__return_2082~0 main_~check__tmp~8) (= 0 main_~check__tmp~8) (= main_~__tmp_9~0 (ite (= main_~main__c1~0 0) 0 1)) (or (and (= ~nomsg~0 ~p1_new~0) (= ~nomsg~0 ~p2_new~0) (= ~p3_new~0 ~nomsg~0) (or (= ~mode3~0 0) (and (= ~mode3~0 0) (= ~st2~0 1) (= ~mode2~0 0) (= ~mode1~0 0) (= ~st1~0 1)))) (and (= ~nomsg~0 ~p1_new~0) (= ~nomsg~0 ~p2_new~0) (= ~nomsg~0 main_~node3__m3~5) (= 0 ~mode3~0) (not (= ~nomsg~0 main_~node2__m2~3)) (not (= main_~node1__m1~1 ~nomsg~0)) (= 0 ~mode1~0) (= main_~node2__m2~3 ~id2~0) (= main_~node1__m1~1 ~id1~0) (= ~st2~0 1) (not (< ~id1~0 main_~node1__m1~1)) (not (< ~id2~0 main_~node2__m2~3)) (= ~p3_new~0 ~nomsg~0) (= 0 ~mode2~0) (= ~st1~0 1)))) [2019-08-18 11:21:32,459 INFO L92 terpretationObserver]: ✘ Some locations of interest might be reachable, see reported results. [2019-08-18 11:21:32,459 INFO L132 PluginConnector]: ------------------------ END Symbolic Interpretation---------------------------- [2019-08-18 11:21:32,462 INFO L168 Benchmark]: Toolchain (without parser) took 7318.14 ms. Allocated memory was 139.5 MB in the beginning and 392.7 MB in the end (delta: 253.2 MB). Free memory was 86.3 MB in the beginning and 179.6 MB in the end (delta: -93.3 MB). Peak memory consumption was 263.0 MB. Max. memory is 7.1 GB. [2019-08-18 11:21:32,463 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 106.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-18 11:21:32,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.22 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 86.1 MB in the beginning and 168.2 MB in the end (delta: -82.1 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2019-08-18 11:21:32,468 INFO L168 Benchmark]: Boogie Preprocessor took 121.38 ms. Allocated memory is still 201.3 MB. Free memory was 168.2 MB in the beginning and 165.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-08-18 11:21:32,469 INFO L168 Benchmark]: RCFGBuilder took 1375.95 ms. Allocated memory is still 201.3 MB. Free memory was 165.0 MB in the beginning and 82.9 MB in the end (delta: 82.1 MB). Peak memory consumption was 82.1 MB. Max. memory is 7.1 GB. [2019-08-18 11:21:32,476 INFO L168 Benchmark]: Symbolic Interpretation took 5070.70 ms. Allocated memory was 201.3 MB in the beginning and 392.7 MB in the end (delta: 191.4 MB). Free memory was 82.9 MB in the beginning and 179.6 MB in the end (delta: -96.7 MB). Peak memory consumption was 197.7 MB. Max. memory is 7.1 GB. [2019-08-18 11:21:32,485 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.symbolicinterpretation: - UnprovableResult [Line: 867]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 4892#(and (= ~nomsg~0 ~p2_new~0) (= ~nomsg~0 ~p1_new~0) (= ~__return_1744~0 main_~check__tmp~6) (= (mod main_~assert__arg~6 256) 0) (not (<= 3 (mod ~r1~0 256))) (or (and (= ~nomsg~0 main_~node3__m3~4) (= 0 ~mode3~0) (or (and (= 0 ~mode2~0) (or (and (= 0 ~mode1~0) (= ~send2~0 main_~node2__m2~3) (= main_~node1__m1~1 ~id1~0) (not (< ~id1~0 main_~node1__m1~1)) (< ~id2~0 main_~node2__m2~3) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (not (= main_~node2__m2~3 ~id2~0)) (not (< ~id1~0 main_~node1__m1~1)) (not (< ~id2~0 main_~node2__m2~3)) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (= ~nomsg~0 main_~node2__m2~3) (not (< ~id1~0 main_~node1__m1~1)) (= 0 ~mode2~0) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))))) (and (or (and (not (= ~nomsg~0 main_~node3__m3~4)) (not (= ~id3~0 main_~node3__m3~4)) (not (< ~id3~0 main_~node3__m3~4)) (or (and (= 0 ~mode2~0) (or (and (= 0 ~mode1~0) (= ~send2~0 main_~node2__m2~3) (= main_~node1__m1~1 ~id1~0) (not (< ~id1~0 main_~node1__m1~1)) (< ~id2~0 main_~node2__m2~3) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (not (= main_~node2__m2~3 ~id2~0)) (not (< ~id1~0 main_~node1__m1~1)) (not (< ~id2~0 main_~node2__m2~3)) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (= ~nomsg~0 main_~node2__m2~3) (not (< ~id1~0 main_~node1__m1~1)) (= 0 ~mode2~0) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))))) (and (not (= ~nomsg~0 main_~node3__m3~4)) (= ~send3~0 main_~node3__m3~4) (< ~id3~0 main_~node3__m3~4) (or (and (= 0 ~mode2~0) (or (and (= 0 ~mode1~0) (= ~send2~0 main_~node2__m2~3) (= main_~node1__m1~1 ~id1~0) (not (< ~id1~0 main_~node1__m1~1)) (< ~id2~0 main_~node2__m2~3) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (not (= main_~node2__m2~3 ~id2~0)) (not (< ~id1~0 main_~node1__m1~1)) (not (< ~id2~0 main_~node2__m2~3)) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (= ~nomsg~0 main_~node2__m2~3) (not (< ~id1~0 main_~node1__m1~1)) (= 0 ~mode2~0) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0)))))) (= 0 ~mode3~0))) (not (= (+ ~st3~0 ~st1~0 ~st2~0) 0)) (= 0 main_~check__tmp~6) (= main_~__tmp_7~0 (ite (= main_~main__c1~0 0) 0 1)) (= main_~__tmp_7~0 main_~assert__arg~6) (= main_~main__c1~0 ~__return_1744~0) (<= (+ ~st3~0 ~st1~0 ~st2~0) 1) (= ~p3_new~0 ~nomsg~0)). Possible FailurePath: - UnprovableResult [Line: 376]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 7884#(and (= 0 (mod main_~assert__arg~2 256)) (or (and (= ~nomsg~0 ~p1_new~0) (= ~nomsg~0 ~p2_new~0) (not (<= (+ ~st3~0 ~st1~0 ~st2~0) 1)) (not (= ~nomsg~0 main_~node3__m3~5)) (= ~id3~0 main_~node3__m3~5) (= 0 ~mode3~0) (not (= ~nomsg~0 main_~node2__m2~3)) (not (= main_~node1__m1~1 ~nomsg~0)) (= 0 ~mode1~0) (= ~__return_2228~0 main_~check__tmp~9) (= main_~node2__m2~3 ~id2~0) (= main_~node1__m1~1 ~id1~0) (= ~st2~0 1) (= 0 main_~check__tmp~9) (= ~st3~0 1) (not (< ~id1~0 main_~node1__m1~1)) (not (< ~id2~0 main_~node2__m2~3)) (= ~p3_new~0 ~nomsg~0) (= main_~main__c1~0 ~__return_2228~0) (not (< ~id3~0 main_~node3__m3~5)) (= 0 ~mode2~0) (= ~st1~0 1)) (and (= main_~main__c1~0 ~__return_1594~0) (= ~__return_1594~0 main_~check__tmp~2))) (= main_~__tmp_3~0 main_~assert__arg~2) (= main_~__tmp_3~0 (ite (= main_~main__c1~0 0) 0 1))). Possible FailurePath: - UnprovableResult [Line: 617]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 6068#(and (= ~nomsg~0 ~p2_new~0) (= ~nomsg~0 ~p1_new~0) (= 0 (mod main_~assert__arg~3 256)) (not (<= 3 (mod ~r1~0 256))) (= main_~__tmp_4~0 main_~assert__arg~3) (not (< ~id3~0 main_~node3__m3~1)) (= ~id3~0 main_~node3__m3~1) (= ~__return_1827~0 main_~check__tmp~3) (not (= (+ ~st3~0 ~st1~0 ~st2~0) 0)) (= 0 ~mode3~0) (= main_~main__c1~0 ~__return_1827~0) (not (= ~nomsg~0 main_~node3__m3~1)) (= main_~__tmp_4~0 (ite (= main_~main__c1~0 0) 0 1)) (= ~st3~0 1) (or (and (= ~nomsg~0 main_~node2__m2~1) (= 0 ~mode2~0) (= ~mode1~0 0)) (and (or (and (= ~send2~0 main_~node2__m2~1) (< ~id2~0 main_~node2__m2~1) (not (= ~nomsg~0 main_~node2__m2~1)) (= ~mode1~0 0)) (and (not (= main_~node2__m2~1 ~id2~0)) (not (< ~id2~0 main_~node2__m2~1)) (not (= ~nomsg~0 main_~node2__m2~1)) (= ~mode1~0 0))) (= 0 ~mode2~0))) (<= (+ ~st3~0 ~st1~0 ~st2~0) 1) (= 0 main_~check__tmp~3) (= ~p3_new~0 ~nomsg~0)). Possible FailurePath: - UnprovableResult [Line: 705]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 6044#(and (= ~nomsg~0 ~p2_new~0) (= ~nomsg~0 ~p1_new~0) (= main_~__tmp_5~0 main_~assert__arg~4) (= ~__return_2004~0 main_~check__tmp~4) (= main_~__tmp_5~0 (ite (= main_~main__c1~0 0) 0 1)) (not (<= 3 (mod ~r1~0 256))) (= main_~main__c1~0 ~__return_2004~0) (not (= (+ ~st3~0 ~st1~0 ~st2~0) 0)) (= 0 (mod main_~assert__arg~4 256)) (or (and (= main_~node2__m2~1 ~id2~0) (= ~st2~0 1) (not (< ~id2~0 main_~node2__m2~1)) (not (= ~nomsg~0 main_~node2__m2~1)) (= 0 ~mode2~0) (= ~mode1~0 0) (= 0 ~mode3~0) (= ~nomsg~0 main_~node3__m3~3)) (and (or (and (= main_~node2__m2~1 ~id2~0) (= ~st2~0 1) (not (< ~id2~0 main_~node2__m2~1)) (not (= ~nomsg~0 main_~node2__m2~1)) (< ~id3~0 main_~node3__m3~3) (not (= ~nomsg~0 main_~node3__m3~3)) (= ~send3~0 main_~node3__m3~3) (= 0 ~mode2~0) (= ~mode1~0 0)) (and (= main_~node2__m2~1 ~id2~0) (not (= ~id3~0 main_~node3__m3~3)) (= ~st2~0 1) (not (< ~id2~0 main_~node2__m2~1)) (not (= ~nomsg~0 main_~node2__m2~1)) (not (= ~nomsg~0 main_~node3__m3~3)) (= 0 ~mode2~0) (= ~mode1~0 0) (not (< ~id3~0 main_~node3__m3~3)))) (= 0 ~mode3~0))) (= 0 main_~check__tmp~4) (<= (+ ~st3~0 ~st1~0 ~st2~0) 1) (= ~p3_new~0 ~nomsg~0)). Possible FailurePath: - UnprovableResult [Line: 914]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 4914#(and (= ~nomsg~0 ~p1_new~0) (= ~nomsg~0 ~p2_new~0) (not (<= (+ ~st3~0 ~st1~0 ~st2~0) 1)) (not (= ~nomsg~0 main_~node3__m3~4)) (= main_~__tmp_8~0 main_~assert__arg~7) (= main_~main__c1~0 ~__return_1893~0) (= ~id3~0 main_~node3__m3~4) (= 0 main_~check__tmp~7) (not (< ~id3~0 main_~node3__m3~4)) (= 0 ~mode3~0) (or (and (= 0 ~mode2~0) (or (and (= 0 ~mode1~0) (= ~send2~0 main_~node2__m2~3) (= main_~node1__m1~1 ~id1~0) (not (< ~id1~0 main_~node1__m1~1)) (< ~id2~0 main_~node2__m2~3) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (not (= main_~node2__m2~3 ~id2~0)) (not (< ~id1~0 main_~node1__m1~1)) (not (< ~id2~0 main_~node2__m2~3)) (not (= ~nomsg~0 main_~node2__m2~3)) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0))))) (and (= 0 ~mode1~0) (= main_~node1__m1~1 ~id1~0) (= ~nomsg~0 main_~node2__m2~3) (not (< ~id1~0 main_~node1__m1~1)) (= 0 ~mode2~0) (= ~st1~0 1) (not (= main_~node1__m1~1 ~nomsg~0)))) (= ~st3~0 1) (= (mod main_~assert__arg~7 256) 0) (= main_~__tmp_8~0 (ite (= main_~main__c1~0 0) 0 1)) (= ~__return_1893~0 main_~check__tmp~7) (= ~p3_new~0 ~nomsg~0)). Possible FailurePath: - UnprovableResult [Line: 752]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 6082#(and (= ~nomsg~0 ~p1_new~0) (= ~nomsg~0 ~p2_new~0) (= main_~node2__m2~1 ~id2~0) (not (<= (+ ~st3~0 ~st1~0 ~st2~0) 1)) (not (< ~id2~0 main_~node2__m2~1)) (= main_~main__c1~0 ~__return_2162~0) (= main_~__tmp_6~0 (ite (= main_~main__c1~0 0) 0 1)) (= 0 main_~check__tmp~5) (= ~mode1~0 0) (= (mod main_~assert__arg~5 256) 0) (= 0 ~mode3~0) (= main_~__tmp_6~0 main_~assert__arg~5) (= ~id3~0 main_~node3__m3~3) (= ~st2~0 1) (= ~st3~0 1) (not (= ~nomsg~0 main_~node2__m2~1)) (= ~__return_2162~0 main_~check__tmp~5) (= ~p3_new~0 ~nomsg~0) (not (= ~nomsg~0 main_~node3__m3~3)) (= 0 ~mode2~0) (not (< ~id3~0 main_~node3__m3~3))). Possible FailurePath: - UnprovableResult [Line: 988]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 6653#(and (= 0 (mod main_~assert__arg~8 256)) (= main_~main__c1~0 ~__return_2082~0) (= main_~__tmp_9~0 main_~assert__arg~8) (not (<= (+ ~st3~0 ~st1~0 ~st2~0) 1)) (= ~__return_2082~0 main_~check__tmp~8) (= 0 main_~check__tmp~8) (= main_~__tmp_9~0 (ite (= main_~main__c1~0 0) 0 1)) (or (and (= ~nomsg~0 ~p1_new~0) (= ~nomsg~0 ~p2_new~0) (= ~p3_new~0 ~nomsg~0) (or (= ~mode3~0 0) (and (= ~mode3~0 0) (= ~st2~0 1) (= ~mode2~0 0) (= ~mode1~0 0) (= ~st1~0 1)))) (and (= ~nomsg~0 ~p1_new~0) (= ~nomsg~0 ~p2_new~0) (= ~nomsg~0 main_~node3__m3~5) (= 0 ~mode3~0) (not (= ~nomsg~0 main_~node2__m2~3)) (not (= main_~node1__m1~1 ~nomsg~0)) (= 0 ~mode1~0) (= main_~node2__m2~3 ~id2~0) (= main_~node1__m1~1 ~id1~0) (= ~st2~0 1) (not (< ~id1~0 main_~node1__m1~1)) (not (< ~id2~0 main_~node2__m2~3)) (= ~p3_new~0 ~nomsg~0) (= 0 ~mode2~0) (= ~st1~0 1)))). Possible FailurePath: * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 106.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 745.22 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 86.1 MB in the beginning and 168.2 MB in the end (delta: -82.1 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.38 ms. Allocated memory is still 201.3 MB. Free memory was 168.2 MB in the beginning and 165.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1375.95 ms. Allocated memory is still 201.3 MB. Free memory was 165.0 MB in the beginning and 82.9 MB in the end (delta: 82.1 MB). Peak memory consumption was 82.1 MB. Max. memory is 7.1 GB. * Symbolic Interpretation took 5070.70 ms. Allocated memory was 201.3 MB in the beginning and 392.7 MB in the end (delta: 191.4 MB). Free memory was 82.9 MB in the beginning and 179.6 MB in the end (delta: -96.7 MB). Peak memory consumption was 197.7 MB. Max. memory is 7.1 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...