./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c8fcbd2e56fc6449811fd1acd07180118cd30cc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c8fcbd2e56fc6449811fd1acd07180118cd30cc ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArrayIndexOutOfBoundsException: 1 --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:34:41,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:34:41,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:34:41,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:34:41,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:34:41,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:34:41,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:34:41,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:34:41,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:34:41,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:34:41,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:34:41,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:34:41,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:34:41,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:34:41,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:34:41,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:34:41,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:34:41,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:34:41,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:34:41,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:34:41,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:34:41,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:34:41,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:34:41,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:34:41,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:34:41,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:34:41,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:34:41,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:34:41,893 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:34:41,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:34:41,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:34:41,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:34:41,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:34:41,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:34:41,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:34:41,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:34:41,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:34:41,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:34:41,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:34:41,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:34:41,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:34:41,898 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:34:41,907 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:34:41,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:34:41,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:34:41,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:34:41,908 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:34:41,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:34:41,908 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:34:41,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:34:41,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:34:41,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:34:41,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:34:41,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:34:41,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:34:41,909 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:34:41,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:34:41,909 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:34:41,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:34:41,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:34:41,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:34:41,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:34:41,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:34:41,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:34:41,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:34:41,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:34:41,911 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:34:41,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:34:41,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:34:41,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:34:41,911 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:34:41,911 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c8fcbd2e56fc6449811fd1acd07180118cd30cc [2019-12-07 10:34:42,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:34:42,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:34:42,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:34:42,024 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:34:42,024 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:34:42,025 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2019-12-07 10:34:42,067 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/data/e14a30af5/67749867a7db4ff2aeef1b36b5e83d63/FLAGed0dacac3 [2019-12-07 10:34:42,520 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:34:42,520 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/sv-benchmarks/c/pthread/queue_ok_longer.i [2019-12-07 10:34:42,531 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/data/e14a30af5/67749867a7db4ff2aeef1b36b5e83d63/FLAGed0dacac3 [2019-12-07 10:34:42,540 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/data/e14a30af5/67749867a7db4ff2aeef1b36b5e83d63 [2019-12-07 10:34:42,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:34:42,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:34:42,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:34:42,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:34:42,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:34:42,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:34:42" (1/1) ... [2019-12-07 10:34:42,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227d51b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:42, skipping insertion in model container [2019-12-07 10:34:42,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:34:42" (1/1) ... [2019-12-07 10:34:42,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:34:42,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:34:42,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:34:42,901 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:34:42,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:34:43,043 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:34:43,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:43 WrapperNode [2019-12-07 10:34:43,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:34:43,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:34:43,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:34:43,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:34:43,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:43" (1/1) ... [2019-12-07 10:34:43,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:43" (1/1) ... [2019-12-07 10:34:43,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:34:43,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:34:43,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:34:43,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:34:43,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:43" (1/1) ... [2019-12-07 10:34:43,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:43" (1/1) ... [2019-12-07 10:34:43,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:43" (1/1) ... [2019-12-07 10:34:43,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:43" (1/1) ... [2019-12-07 10:34:43,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:43" (1/1) ... [2019-12-07 10:34:43,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:43" (1/1) ... [2019-12-07 10:34:43,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:43" (1/1) ... [2019-12-07 10:34:43,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:34:43,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:34:43,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:34:43,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:34:43,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/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-12-07 10:34:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-07 10:34:43,153 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-07 10:34:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-07 10:34:43,153 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-07 10:34:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:34:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:34:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:34:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:34:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-07 10:34:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 10:34:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:34:43,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:34:43,155 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 10:34:43,469 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:34:43,469 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-07 10:34:43,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:34:43 BoogieIcfgContainer [2019-12-07 10:34:43,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:34:43,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:34:43,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:34:43,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:34:43,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:34:42" (1/3) ... [2019-12-07 10:34:43,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3f7149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:34:43, skipping insertion in model container [2019-12-07 10:34:43,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:43" (2/3) ... [2019-12-07 10:34:43,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3f7149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:34:43, skipping insertion in model container [2019-12-07 10:34:43,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:34:43" (3/3) ... [2019-12-07 10:34:43,474 INFO L109 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2019-12-07 10:34:43,481 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:34:43,481 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:34:43,486 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:34:43,486 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:34:43,509 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,510 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,510 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,510 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,510 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,510 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,510 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,511 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,511 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,511 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,511 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,511 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,511 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,511 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,512 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,512 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,512 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,512 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,512 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,512 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,512 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,512 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,513 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,513 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,513 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,513 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,513 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,513 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,513 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,513 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,513 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,513 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,514 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,514 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,514 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,514 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,514 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,514 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,514 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,514 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,515 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,515 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,515 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,515 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,515 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,515 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,515 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,515 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,515 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,516 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,516 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,516 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,516 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,516 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,516 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,516 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,516 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,517 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,517 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,517 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,518 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,518 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,518 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,518 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,518 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,518 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,518 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,519 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,519 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,519 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,519 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,519 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,519 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,519 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,519 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,520 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,520 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,520 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,520 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,520 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,520 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,520 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,520 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,520 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,521 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,521 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,522 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,522 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,522 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,522 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,522 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,522 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,522 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,523 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,523 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,523 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,523 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,523 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,523 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,523 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,523 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,524 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,524 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,524 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,524 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,524 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,524 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,524 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,524 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,524 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,525 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,525 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,525 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,525 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,525 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,525 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,525 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,525 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,525 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,526 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,526 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,526 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,526 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,526 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,526 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,526 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,526 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,526 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,527 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,527 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,527 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,527 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,527 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,527 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,527 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,527 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,528 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,528 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,528 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,528 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,528 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,528 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,528 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,528 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,528 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,528 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,529 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,529 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,529 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,529 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,529 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,529 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,529 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,529 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,529 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,529 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,530 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,530 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,530 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,530 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,530 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,530 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,530 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,530 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,530 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,531 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,531 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,531 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,531 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,531 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,531 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,531 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,531 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,531 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,531 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,532 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,532 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,532 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,532 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,532 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,532 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,532 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,532 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,532 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,533 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,533 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,533 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,533 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,533 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,533 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,533 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,533 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,534 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,534 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,534 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,534 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,534 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,534 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,534 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,534 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,534 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,534 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,535 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,535 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,535 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,535 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,535 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,535 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,535 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,535 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,535 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,536 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:43,552 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 10:34:43,564 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:34:43,564 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:34:43,565 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:34:43,565 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:34:43,565 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:34:43,565 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:34:43,565 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:34:43,565 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:34:43,576 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 204 transitions [2019-12-07 10:34:43,578 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 204 transitions [2019-12-07 10:34:43,631 INFO L134 PetriNetUnfolder]: 14/204 cut-off events. [2019-12-07 10:34:43,631 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:34:43,638 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 204 events. 14/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 438 event pairs. 19/208 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2019-12-07 10:34:43,648 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 204 transitions [2019-12-07 10:34:43,674 INFO L134 PetriNetUnfolder]: 14/204 cut-off events. [2019-12-07 10:34:43,674 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:34:43,677 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 204 events. 14/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 438 event pairs. 19/208 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2019-12-07 10:34:43,685 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 9440 [2019-12-07 10:34:43,686 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:34:46,149 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 10:34:46,258 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-12-07 10:34:46,806 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 122 [2019-12-07 10:34:47,244 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-12-07 10:34:49,505 WARN L192 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 155 DAG size of output: 147 [2019-12-07 10:34:50,313 WARN L192 SmtUtils]: Spent 806.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-12-07 10:34:50,328 INFO L206 etLargeBlockEncoding]: Checked pairs total: 17748 [2019-12-07 10:34:50,328 INFO L214 etLargeBlockEncoding]: Total number of compositions: 178 [2019-12-07 10:34:50,331 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 55 transitions [2019-12-07 10:34:50,360 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 716 states. [2019-12-07 10:34:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states. [2019-12-07 10:34:50,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-07 10:34:50,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:34:50,365 INFO L410 BasicCegarLoop]: trace histogram [1] [2019-12-07 10:34:50,365 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:34:50,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:34:50,369 INFO L82 PathProgramCache]: Analyzing trace with hash 810, now seen corresponding path program 1 times [2019-12-07 10:34:50,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:34:50,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549807213] [2019-12-07 10:34:50,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:34:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:34:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:34:50,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549807213] [2019-12-07 10:34:50,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:34:50,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-07 10:34:50,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484716156] [2019-12-07 10:34:50,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 10:34:50,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:34:50,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 10:34:50,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:34:50,466 INFO L87 Difference]: Start difference. First operand 716 states. Second operand 2 states. [2019-12-07 10:34:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:34:50,496 INFO L93 Difference]: Finished difference Result 715 states and 1901 transitions. [2019-12-07 10:34:50,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 10:34:50,497 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-07 10:34:50,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:34:50,510 INFO L225 Difference]: With dead ends: 715 [2019-12-07 10:34:50,510 INFO L226 Difference]: Without dead ends: 524 [2019-12-07 10:34:50,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:34:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-12-07 10:34:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2019-12-07 10:34:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-12-07 10:34:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1400 transitions. [2019-12-07 10:34:50,563 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1400 transitions. Word has length 1 [2019-12-07 10:34:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:34:50,563 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 1400 transitions. [2019-12-07 10:34:50,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 10:34:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1400 transitions. [2019-12-07 10:34:50,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:34:50,566 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:34:50,566 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:34:50,566 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:34:50,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:34:50,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1385599744, now seen corresponding path program 1 times [2019-12-07 10:34:50,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:34:50,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923005727] [2019-12-07 10:34:50,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:34:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:34:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:34:50,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923005727] [2019-12-07 10:34:50,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:34:50,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:34:50,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076623986] [2019-12-07 10:34:50,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:34:50,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:34:50,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:34:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:34:50,654 INFO L87 Difference]: Start difference. First operand 524 states and 1400 transitions. Second operand 3 states. [2019-12-07 10:34:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:34:50,662 INFO L93 Difference]: Finished difference Result 236 states and 509 transitions. [2019-12-07 10:34:50,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:34:50,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 10:34:50,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:34:50,664 INFO L225 Difference]: With dead ends: 236 [2019-12-07 10:34:50,664 INFO L226 Difference]: Without dead ends: 212 [2019-12-07 10:34:50,664 INFO L630 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 [2019-12-07 10:34:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-12-07 10:34:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-12-07 10:34:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-12-07 10:34:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 464 transitions. [2019-12-07 10:34:50,670 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 464 transitions. Word has length 15 [2019-12-07 10:34:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:34:50,670 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 464 transitions. [2019-12-07 10:34:50,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:34:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 464 transitions. [2019-12-07 10:34:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:34:50,672 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:34:50,672 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:34:50,672 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:34:50,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:34:50,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1061498615, now seen corresponding path program 1 times [2019-12-07 10:34:50,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:34:50,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6220722] [2019-12-07 10:34:50,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:34:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:34:50,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:34:50,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6220722] [2019-12-07 10:34:50,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:34:50,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:34:50,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470401554] [2019-12-07 10:34:50,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:34:50,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:34:50,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:34:50,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:34:50,707 INFO L87 Difference]: Start difference. First operand 212 states and 464 transitions. Second operand 3 states. [2019-12-07 10:34:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:34:50,719 INFO L93 Difference]: Finished difference Result 272 states and 590 transitions. [2019-12-07 10:34:50,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:34:50,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 10:34:50,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:34:50,721 INFO L225 Difference]: With dead ends: 272 [2019-12-07 10:34:50,721 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 10:34:50,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:34:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 10:34:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 218. [2019-12-07 10:34:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-12-07 10:34:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 476 transitions. [2019-12-07 10:34:50,728 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 476 transitions. Word has length 19 [2019-12-07 10:34:50,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:34:50,728 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 476 transitions. [2019-12-07 10:34:50,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:34:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 476 transitions. [2019-12-07 10:34:50,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:34:50,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:34:50,729 INFO L410 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] [2019-12-07 10:34:50,730 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:34:50,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:34:50,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1197878433, now seen corresponding path program 1 times [2019-12-07 10:34:50,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:34:50,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922730940] [2019-12-07 10:34:50,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:34:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:34:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:34:50,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922730940] [2019-12-07 10:34:50,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:34:50,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:34:50,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137142264] [2019-12-07 10:34:50,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:34:50,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:34:50,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:34:50,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:34:50,771 INFO L87 Difference]: Start difference. First operand 218 states and 476 transitions. Second operand 3 states. [2019-12-07 10:34:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:34:50,782 INFO L93 Difference]: Finished difference Result 166 states and 334 transitions. [2019-12-07 10:34:50,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:34:50,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 10:34:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:34:50,784 INFO L225 Difference]: With dead ends: 166 [2019-12-07 10:34:50,784 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 10:34:50,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:34:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 10:34:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-12-07 10:34:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 10:34:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 331 transitions. [2019-12-07 10:34:50,790 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 331 transitions. Word has length 26 [2019-12-07 10:34:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:34:50,790 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 331 transitions. [2019-12-07 10:34:50,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:34:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 331 transitions. [2019-12-07 10:34:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:34:50,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:34:50,792 INFO L410 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] [2019-12-07 10:34:50,792 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:34:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:34:50,792 INFO L82 PathProgramCache]: Analyzing trace with hash -969107883, now seen corresponding path program 1 times [2019-12-07 10:34:50,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:34:50,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903980512] [2019-12-07 10:34:50,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:34:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:34:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:34:51,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903980512] [2019-12-07 10:34:51,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:34:51,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:34:51,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065677520] [2019-12-07 10:34:51,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:34:51,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:34:51,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:34:51,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:34:51,037 INFO L87 Difference]: Start difference. First operand 164 states and 331 transitions. Second operand 8 states. [2019-12-07 10:34:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:34:51,231 INFO L93 Difference]: Finished difference Result 188 states and 373 transitions. [2019-12-07 10:34:51,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:34:51,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-07 10:34:51,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:34:51,232 INFO L225 Difference]: With dead ends: 188 [2019-12-07 10:34:51,232 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 10:34:51,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:34:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 10:34:51,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2019-12-07 10:34:51,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 10:34:51,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 359 transitions. [2019-12-07 10:34:51,237 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 359 transitions. Word has length 27 [2019-12-07 10:34:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:34:51,237 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 359 transitions. [2019-12-07 10:34:51,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:34:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 359 transitions. [2019-12-07 10:34:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:34:51,238 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:34:51,238 INFO L410 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] [2019-12-07 10:34:51,238 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:34:51,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:34:51,238 INFO L82 PathProgramCache]: Analyzing trace with hash -402131297, now seen corresponding path program 1 times [2019-12-07 10:34:51,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:34:51,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826259031] [2019-12-07 10:34:51,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:34:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:34:53,362 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (const Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1315) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1196) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.TermTransferrer.convertApplicationTerm(TermTransferrer.java:182) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:573) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:171) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:350) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 10:34:53,364 INFO L168 Benchmark]: Toolchain (without parser) took 10821.31 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.6 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -140.6 MB). Peak memory consumption was 327.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:34:53,364 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:34:53,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -115.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:34:53,365 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:34:53,366 INFO L168 Benchmark]: Boogie Preprocessor took 25.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:34:53,366 INFO L168 Benchmark]: RCFGBuilder took 357.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:34:53,367 INFO L168 Benchmark]: TraceAbstraction took 9892.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -76.2 MB). Peak memory consumption was 282.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:34:53,369 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 500.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -115.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 357.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9892.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -76.2 MB). Peak memory consumption was 282.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.7s, 196 ProgramPointsBefore, 52 ProgramPointsAfterwards, 204 TransitionsBefore, 55 TransitionsAfterwards, 9440 CoEnabledTransitionPairs, 8 FixpointIterations, 63 TrivialSequentialCompositions, 92 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 19 ConcurrentYvCompositions, 6 ChoiceCompositions, 4960 VarBasedMoverChecksPositive, 92 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 115 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 17748 CheckedPairsTotal, 178 TotalNumberOfCompositions - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (const Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (const Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 10:34:54,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:34:54,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:34:54,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:34:54,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:34:54,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:34:54,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:34:54,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:34:54,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:34:54,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:34:54,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:34:54,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:34:54,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:34:54,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:34:54,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:34:54,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:34:54,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:34:54,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:34:54,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:34:54,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:34:54,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:34:54,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:34:54,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:34:54,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:34:54,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:34:54,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:34:54,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:34:54,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:34:54,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:34:54,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:34:54,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:34:54,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:34:54,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:34:54,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:34:54,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:34:54,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:34:54,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:34:54,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:34:54,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:34:54,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:34:54,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:34:54,762 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 10:34:54,772 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:34:54,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:34:54,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:34:54,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:34:54,773 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:34:54,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:34:54,773 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:34:54,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:34:54,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:34:54,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:34:54,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:34:54,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:34:54,774 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 10:34:54,774 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 10:34:54,774 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:34:54,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:34:54,775 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:34:54,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:34:54,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:34:54,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:34:54,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:34:54,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:34:54,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:34:54,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:34:54,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:34:54,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:34:54,776 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 10:34:54,776 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 10:34:54,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:34:54,776 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:34:54,776 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:34:54,777 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c8fcbd2e56fc6449811fd1acd07180118cd30cc [2019-12-07 10:34:54,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:34:54,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:34:54,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:34:54,955 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:34:54,955 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:34:54,956 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2019-12-07 10:34:54,994 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/data/1c10bb3af/dfd3f634a41346918f694aae96000f48/FLAGb874104f5 [2019-12-07 10:34:55,482 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:34:55,482 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/sv-benchmarks/c/pthread/queue_ok_longer.i [2019-12-07 10:34:55,494 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/data/1c10bb3af/dfd3f634a41346918f694aae96000f48/FLAGb874104f5 [2019-12-07 10:34:55,981 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/data/1c10bb3af/dfd3f634a41346918f694aae96000f48 [2019-12-07 10:34:55,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:34:55,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:34:55,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:34:55,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:34:55,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:34:55,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:34:55" (1/1) ... [2019-12-07 10:34:55,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d666b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:55, skipping insertion in model container [2019-12-07 10:34:55,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:34:55" (1/1) ... [2019-12-07 10:34:56,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:34:56,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:34:56,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:34:56,335 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:34:56,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:34:56,454 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:34:56,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:56 WrapperNode [2019-12-07 10:34:56,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:34:56,455 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:34:56,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:34:56,455 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:34:56,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:56" (1/1) ... [2019-12-07 10:34:56,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:56" (1/1) ... [2019-12-07 10:34:56,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:34:56,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:34:56,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:34:56,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:34:56,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:56" (1/1) ... [2019-12-07 10:34:56,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:56" (1/1) ... [2019-12-07 10:34:56,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:56" (1/1) ... [2019-12-07 10:34:56,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:56" (1/1) ... [2019-12-07 10:34:56,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:56" (1/1) ... [2019-12-07 10:34:56,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:56" (1/1) ... [2019-12-07 10:34:56,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:56" (1/1) ... [2019-12-07 10:34:56,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:34:56,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:34:56,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:34:56,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:34:56,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/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-12-07 10:34:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 10:34:56,574 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-07 10:34:56,574 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-07 10:34:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-07 10:34:56,575 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-07 10:34:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:34:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:34:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 10:34:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-12-07 10:34:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-07 10:34:56,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:34:56,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:34:56,576 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 10:34:56,935 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:34:56,935 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-07 10:34:56,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:34:56 BoogieIcfgContainer [2019-12-07 10:34:56,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:34:56,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:34:56,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:34:56,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:34:56,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:34:55" (1/3) ... [2019-12-07 10:34:56,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595ff2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:34:56, skipping insertion in model container [2019-12-07 10:34:56,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:34:56" (2/3) ... [2019-12-07 10:34:56,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595ff2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:34:56, skipping insertion in model container [2019-12-07 10:34:56,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:34:56" (3/3) ... [2019-12-07 10:34:56,941 INFO L109 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2019-12-07 10:34:56,947 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:34:56,948 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:34:56,952 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:34:56,953 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:34:56,980 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,980 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,980 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,980 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,980 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,981 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,981 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,981 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,981 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,981 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,981 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,981 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,982 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,982 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,982 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,982 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,982 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,982 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,982 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,983 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,983 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,983 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,983 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,983 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,983 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,983 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,983 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,983 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,984 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,984 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,984 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,984 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,984 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,984 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,984 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,984 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,985 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,985 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,985 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,985 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,985 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,985 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,985 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,986 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,986 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,986 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,986 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,986 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,986 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,986 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,986 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,987 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,987 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,987 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,987 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,987 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,987 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,988 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,988 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,988 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,988 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,988 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,988 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,988 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,989 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,989 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,989 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,989 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,989 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,989 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,989 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,990 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,990 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,990 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,990 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,990 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,990 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,990 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,991 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,991 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,991 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,991 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,991 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,991 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,992 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,992 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,993 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,993 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,993 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,993 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,993 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,993 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,994 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,994 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,994 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,994 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,994 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,994 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,995 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,996 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,996 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,996 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,996 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,996 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,996 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,996 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,996 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,997 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,997 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,997 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,997 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,997 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,997 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,997 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,998 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,998 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,998 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,998 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,998 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,998 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,998 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,999 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,999 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,999 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,999 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,999 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,999 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:56,999 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,000 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,000 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,000 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,000 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,000 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,000 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,000 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,001 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,001 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,001 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,001 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,001 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,001 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,001 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,001 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,002 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,002 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,002 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,002 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,002 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,002 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,002 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,002 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,003 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,003 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,003 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,003 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,003 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,003 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,003 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,003 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,004 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,004 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,004 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,004 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,004 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,004 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,004 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,005 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,005 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,005 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,005 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,005 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,005 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,005 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,006 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,006 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,006 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,006 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,006 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,006 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,006 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,006 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,007 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,007 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,007 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,007 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,007 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,007 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,007 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,008 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,008 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,008 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,008 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,008 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,008 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,008 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,008 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,009 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,009 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,009 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,009 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,009 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,009 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,009 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,010 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,010 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,010 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,010 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,010 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:34:57,029 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 10:34:57,042 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:34:57,042 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:34:57,042 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:34:57,043 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:34:57,043 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:34:57,043 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:34:57,043 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:34:57,043 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:34:57,055 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 200 transitions [2019-12-07 10:34:57,056 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 192 places, 200 transitions [2019-12-07 10:34:57,108 INFO L134 PetriNetUnfolder]: 14/200 cut-off events. [2019-12-07 10:34:57,108 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:34:57,117 INFO L76 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 200 events. 14/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 432 event pairs. 19/204 useless extension candidates. Maximal degree in co-relation 135. Up to 3 conditions per place. [2019-12-07 10:34:57,127 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 192 places, 200 transitions [2019-12-07 10:34:57,155 INFO L134 PetriNetUnfolder]: 14/200 cut-off events. [2019-12-07 10:34:57,155 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:34:57,158 INFO L76 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 200 events. 14/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 432 event pairs. 19/204 useless extension candidates. Maximal degree in co-relation 135. Up to 3 conditions per place. [2019-12-07 10:34:57,167 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 8884 [2019-12-07 10:34:57,168 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:35:01,348 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 10:35:01,460 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-07 10:35:01,671 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-07 10:35:01,791 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 10:35:03,009 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 104 DAG size of output: 94 [2019-12-07 10:35:03,806 WARN L192 SmtUtils]: Spent 795.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-07 10:35:05,136 WARN L192 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 153 [2019-12-07 10:35:05,857 WARN L192 SmtUtils]: Spent 719.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-12-07 10:35:05,872 INFO L206 etLargeBlockEncoding]: Checked pairs total: 17779 [2019-12-07 10:35:05,872 INFO L214 etLargeBlockEncoding]: Total number of compositions: 170 [2019-12-07 10:35:05,874 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 55 transitions [2019-12-07 10:35:05,908 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 708 states. [2019-12-07 10:35:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states. [2019-12-07 10:35:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-07 10:35:05,913 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:05,914 INFO L410 BasicCegarLoop]: trace histogram [1] [2019-12-07 10:35:05,914 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:05,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:05,918 INFO L82 PathProgramCache]: Analyzing trace with hash 789, now seen corresponding path program 1 times [2019-12-07 10:35:05,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:35:05,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147486657] [2019-12-07 10:35:05,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 10:35:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:05,977 INFO L264 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 10:35:05,979 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:05,983 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:35:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:05,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147486657] [2019-12-07 10:35:05,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:05,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0, 0] imperfect sequences [] total 0 [2019-12-07 10:35:05,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584854346] [2019-12-07 10:35:05,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 10:35:05,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:35:05,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 10:35:05,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:35:05,998 INFO L87 Difference]: Start difference. First operand 708 states. Second operand 2 states. [2019-12-07 10:35:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:06,027 INFO L93 Difference]: Finished difference Result 707 states and 1880 transitions. [2019-12-07 10:35:06,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 10:35:06,028 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-07 10:35:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:06,041 INFO L225 Difference]: With dead ends: 707 [2019-12-07 10:35:06,041 INFO L226 Difference]: Without dead ends: 527 [2019-12-07 10:35:06,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:35:06,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-12-07 10:35:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-12-07 10:35:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-12-07 10:35:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 1407 transitions. [2019-12-07 10:35:06,101 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 1407 transitions. Word has length 1 [2019-12-07 10:35:06,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:06,101 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 1407 transitions. [2019-12-07 10:35:06,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 10:35:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1407 transitions. [2019-12-07 10:35:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:35:06,105 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:06,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:06,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 10:35:06,306 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:06,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:06,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1015764278, now seen corresponding path program 1 times [2019-12-07 10:35:06,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:35:06,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568336714] [2019-12-07 10:35:06,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 10:35:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:06,446 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:35:06,447 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:06,456 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:35:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:06,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568336714] [2019-12-07 10:35:06,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:06,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 10:35:06,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214022425] [2019-12-07 10:35:06,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:06,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:35:06,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:06,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:06,462 INFO L87 Difference]: Start difference. First operand 527 states and 1407 transitions. Second operand 3 states. [2019-12-07 10:35:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:06,470 INFO L93 Difference]: Finished difference Result 239 states and 516 transitions. [2019-12-07 10:35:06,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:06,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 10:35:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:06,472 INFO L225 Difference]: With dead ends: 239 [2019-12-07 10:35:06,472 INFO L226 Difference]: Without dead ends: 215 [2019-12-07 10:35:06,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:06,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-12-07 10:35:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-12-07 10:35:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-12-07 10:35:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 471 transitions. [2019-12-07 10:35:06,481 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 471 transitions. Word has length 16 [2019-12-07 10:35:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:06,482 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 471 transitions. [2019-12-07 10:35:06,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 471 transitions. [2019-12-07 10:35:06,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:35:06,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:06,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:06,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 10:35:06,685 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:06,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:06,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1520670292, now seen corresponding path program 1 times [2019-12-07 10:35:06,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:35:06,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984205692] [2019-12-07 10:35:06,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 10:35:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:06,824 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:35:06,825 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:06,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 10:35:06,854 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:06,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:06,856 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:06,856 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 10:35:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:06,863 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:35:06,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:06,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984205692] [2019-12-07 10:35:06,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:06,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 10:35:06,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470112847] [2019-12-07 10:35:06,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:06,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:35:06,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:06,869 INFO L87 Difference]: Start difference. First operand 215 states and 471 transitions. Second operand 3 states. [2019-12-07 10:35:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:06,903 INFO L93 Difference]: Finished difference Result 165 states and 334 transitions. [2019-12-07 10:35:06,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:06,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 10:35:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:06,905 INFO L225 Difference]: With dead ends: 165 [2019-12-07 10:35:06,905 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 10:35:06,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 10:35:06,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-12-07 10:35:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 10:35:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 331 transitions. [2019-12-07 10:35:06,910 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 331 transitions. Word has length 20 [2019-12-07 10:35:06,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:06,910 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 331 transitions. [2019-12-07 10:35:06,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 331 transitions. [2019-12-07 10:35:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:35:06,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:06,911 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:07,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 10:35:07,112 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:07,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:07,113 INFO L82 PathProgramCache]: Analyzing trace with hash 145552526, now seen corresponding path program 1 times [2019-12-07 10:35:07,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:35:07,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543011448] [2019-12-07 10:35:07,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 10:35:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:07,193 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:35:07,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:07,199 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:35:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:07,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543011448] [2019-12-07 10:35:07,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:07,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 10:35:07,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454611443] [2019-12-07 10:35:07,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:35:07,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:35:07,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:35:07,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:07,206 INFO L87 Difference]: Start difference. First operand 163 states and 331 transitions. Second operand 4 states. [2019-12-07 10:35:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:07,233 INFO L93 Difference]: Finished difference Result 203 states and 405 transitions. [2019-12-07 10:35:07,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:35:07,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 10:35:07,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:07,235 INFO L225 Difference]: With dead ends: 203 [2019-12-07 10:35:07,235 INFO L226 Difference]: Without dead ends: 203 [2019-12-07 10:35:07,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:07,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-12-07 10:35:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-12-07 10:35:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-12-07 10:35:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 405 transitions. [2019-12-07 10:35:07,240 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 405 transitions. Word has length 21 [2019-12-07 10:35:07,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:07,240 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 405 transitions. [2019-12-07 10:35:07,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:35:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 405 transitions. [2019-12-07 10:35:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 10:35:07,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:07,242 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:07,442 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 10:35:07,443 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:07,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:07,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1333944526, now seen corresponding path program 1 times [2019-12-07 10:35:07,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:35:07,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666561134] [2019-12-07 10:35:07,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 10:35:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:07,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 10:35:07,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:07,583 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:35:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:07,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666561134] [2019-12-07 10:35:07,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:35:07,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-12-07 10:35:07,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982867780] [2019-12-07 10:35:07,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:35:07,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:35:07,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:35:07,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:35:07,621 INFO L87 Difference]: Start difference. First operand 203 states and 405 transitions. Second operand 8 states. [2019-12-07 10:35:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:07,742 INFO L93 Difference]: Finished difference Result 347 states and 673 transitions. [2019-12-07 10:35:07,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:35:07,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 10:35:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:07,744 INFO L225 Difference]: With dead ends: 347 [2019-12-07 10:35:07,744 INFO L226 Difference]: Without dead ends: 347 [2019-12-07 10:35:07,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:35:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-12-07 10:35:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2019-12-07 10:35:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-07 10:35:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 673 transitions. [2019-12-07 10:35:07,751 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 673 transitions. Word has length 35 [2019-12-07 10:35:07,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:07,751 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 673 transitions. [2019-12-07 10:35:07,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:35:07,752 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 673 transitions. [2019-12-07 10:35:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 10:35:07,753 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:07,753 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:07,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 10:35:07,954 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:07,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:07,955 INFO L82 PathProgramCache]: Analyzing trace with hash -218502834, now seen corresponding path program 2 times [2019-12-07 10:35:07,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:35:07,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965168354] [2019-12-07 10:35:07,956 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 10:35:08,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 10:35:08,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:35:08,160 INFO L264 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 10:35:08,162 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:08,206 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:35:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:08,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965168354] [2019-12-07 10:35:08,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 10:35:08,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-12-07 10:35:08,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98518011] [2019-12-07 10:35:08,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 10:35:08,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:35:08,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 10:35:08,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-07 10:35:08,396 INFO L87 Difference]: Start difference. First operand 347 states and 673 transitions. Second operand 16 states. [2019-12-07 10:35:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:09,018 INFO L93 Difference]: Finished difference Result 635 states and 1209 transitions. [2019-12-07 10:35:09,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 10:35:09,019 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2019-12-07 10:35:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:09,022 INFO L225 Difference]: With dead ends: 635 [2019-12-07 10:35:09,022 INFO L226 Difference]: Without dead ends: 635 [2019-12-07 10:35:09,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:35:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-12-07 10:35:09,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-12-07 10:35:09,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-12-07 10:35:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1209 transitions. [2019-12-07 10:35:09,034 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1209 transitions. Word has length 63 [2019-12-07 10:35:09,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:09,034 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 1209 transitions. [2019-12-07 10:35:09,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 10:35:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1209 transitions. [2019-12-07 10:35:09,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 10:35:09,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:09,036 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:09,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 10:35:09,236 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:09,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:09,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1467237810, now seen corresponding path program 3 times [2019-12-07 10:35:09,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:35:09,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982907681] [2019-12-07 10:35:09,238 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 10:35:09,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 10:35:09,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:35:09,535 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 10:35:09,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:09,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 134 [2019-12-07 10:35:09,553 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:09,603 INFO L614 ElimStorePlain]: treesize reduction 111, result has 13.3 percent of original size [2019-12-07 10:35:09,604 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:09,604 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:4 [2019-12-07 10:35:09,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 10:35:09,629 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:09,638 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:09,638 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:09,638 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-12-07 10:35:09,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-07 10:35:09,659 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:09,673 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:09,674 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:09,674 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:9 [2019-12-07 10:35:09,719 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:09,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 51 [2019-12-07 10:35:09,720 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:09,738 INFO L614 ElimStorePlain]: treesize reduction 26, result has 42.2 percent of original size [2019-12-07 10:35:09,739 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:09,739 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:9 [2019-12-07 10:35:09,763 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-07 10:35:09,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-12-07 10:35:09,764 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 10:35:09,775 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:09,776 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 10:35:09,776 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:11 [2019-12-07 10:35:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 112 proven. 65 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2019-12-07 10:35:09,800 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:35:38,507 WARN L192 SmtUtils]: Spent 26.54 s on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 10:35:38,508 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:38,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 286 treesize of output 312 [2019-12-07 10:35:38,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 10:35:38,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 312 treesize of output 316 [2019-12-07 10:35:38,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 10:35:38,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 10:35:38,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:38,950 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_8, v_arrayElimCell_7], 4=[v_arrayElimCell_6]} [2019-12-07 10:35:38,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982907681] [2019-12-07 10:35:38,957 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@862fc7 [2019-12-07 10:35:38,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1497260595] [2019-12-07 10:35:38,958 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 10:35:39,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 10:35:39,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:35:39,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 10:35:39,645 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:39,647 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@862fc7 [2019-12-07 10:35:39,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182113964] [2019-12-07 10:35:39,647 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cbf5a2fe-ff5f-4796-98e8-fd48b004005c/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:42,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 10:35:42,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 10:35:42,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 10:35:42,257 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:42,257 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@862fc7 [2019-12-07 10:35:42,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:42,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 10:35:42,258 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 10:35:42,258 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:35:42,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 mathsat -unsat_core_generation=3,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:42,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] ULTIMATE.startENTRY-->L1033-1: Formula: (let ((.cse5 (store |v_#valid_83| (_ bv0 32) (_ bv0 1)))) (let ((.cse8 (store .cse5 |v_#t~string33.base_7| (_ bv1 1)))) (let ((.cse7 (store .cse8 |v_#t~string36.base_8| (_ bv1 1)))) (let ((.cse3 (store .cse7 |v_~#m~0.base_71| (_ bv1 1)))) (let ((.cse10 (store .cse3 |v_~#stored_elements~0.base_37| (_ bv1 1)))) (let ((.cse9 (store .cse10 |v_~#queue~0.base_42| (_ bv1 1)))) (let ((.cse4 (select |v_#memory_int_510| |v_~#m~0.base_71|)) (.cse6 (store .cse9 |v_ULTIMATE.start_main_~#id1~0.base_54| (_ bv1 1)))) (and (bvult |v_#StackHeapBarrier_31| |v_~#queue~0.base_42|) (= (let ((.cse0 (let ((.cse1 (let ((.cse2 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (store (store |v_#memory_int_510| |v_~#stored_elements~0.base_37| .cse2) |v_~#queue~0.base_42| .cse2)))) (store .cse1 v_ULTIMATE.start_init_~q.base_17 (store (store (store (select .cse1 v_ULTIMATE.start_init_~q.base_17) (bvadd v_ULTIMATE.start_init_~q.offset_17 (_ bv1600 32)) (_ bv0 32)) (bvadd v_ULTIMATE.start_init_~q.offset_17 (_ bv1604 32)) (_ bv0 32)) (bvadd v_ULTIMATE.start_init_~q.offset_17 (_ bv1608 32)) (_ bv0 32)))))) (store .cse0 |v_ULTIMATE.start_main_~#id1~0.base_54| (store (select .cse0 |v_ULTIMATE.start_main_~#id1~0.base_54|) |v_ULTIMATE.start_main_~#id1~0.offset_51| (_ bv0 32)))) |v_#memory_int_509|) (= (_ bv0 1) (select .cse3 |v_~#stored_elements~0.base_37|)) (= roundNearestTiesToEven v_currentRoundingMode_7) (= (select .cse4 (bvadd |v_~#m~0.offset_71| (_ bv4 32))) (_ bv0 32)) (= v_ULTIMATE.start_init_~q.base_17 |v_ULTIMATE.start_init_#in~q.base_12|) (= (select .cse4 |v_~#m~0.offset_71|) (_ bv0 32)) (= |v_~#queue~0.offset_41| (_ bv0 32)) (= (_ bv0 32) |v_#NULL.offset_5|) (bvult (_ bv0 32) |v_#StackHeapBarrier_31|) (= |v_ULTIMATE.start_init_#in~q.offset_12| v_ULTIMATE.start_init_~q.offset_17) (= |v_#NULL.base_5| (_ bv0 32)) (= |v_ULTIMATE.start_empty_#in~q.base_17| |v_~#queue~0.base_42|) (bvult |v_#StackHeapBarrier_31| |v_ULTIMATE.start_main_~#id1~0.base_54|) (= (select .cse4 (bvadd |v_~#m~0.offset_71| (_ bv16 32))) (_ bv0 32)) (= |v_~#queue~0.offset_41| |v_ULTIMATE.start_empty_#in~q.offset_17|) (= (select .cse5 |v_#t~string33.base_7|) (_ bv0 1)) (= (_ bv0 32) |v_#t~string33.offset_7|) (= (store .cse6 |v_ULTIMATE.start_main_~#id2~0.base_42| (_ bv1 1)) |v_#valid_81|) (= |v_ULTIMATE.start_init_#in~q.offset_12| |v_~#queue~0.offset_41|) (= |v_ULTIMATE.start_main_~#id2~0.offset_39| (_ bv0 32)) (= |v_ULTIMATE.start_init_#in~q.base_12| |v_~#queue~0.base_42|) (= v_~enqueue_flag~0_50 (_ bv1 8)) (= |v_ULTIMATE.start_main_~#id1~0.offset_51| (_ bv0 32)) (= (store |v_#pthreadsMutex_148| |v_~#m~0.base_71| (store (select |v_#pthreadsMutex_148| |v_~#m~0.base_71|) |v_~#m~0.offset_71| (_ bv0 1))) |v_#pthreadsMutex_147|) (bvult |v_#StackHeapBarrier_31| |v_~#stored_elements~0.base_37|) (= (_ bv0 32) |v_~#m~0.offset_71|) (= (_ bv0 32) (select .cse4 (bvadd |v_~#m~0.offset_71| (_ bv8 32)))) (= (_ bv0 32) |v_#t~string36.offset_8|) (= (_ bv0 1) (select .cse7 |v_~#m~0.base_71|)) (= (_ bv0 1) (select .cse8 |v_#t~string36.base_8|)) (= (_ bv0 1) (select .cse9 |v_ULTIMATE.start_main_~#id1~0.base_54|)) (= |v_ULTIMATE.start_empty_#res_22| (_ bv4294967295 32)) (bvult |v_#StackHeapBarrier_31| |v_#t~string33.base_7|) (= |v_ULTIMATE.start_empty_#in~q.base_17| v_ULTIMATE.start_empty_~q.base_20) (= (_ bv0 32) (select .cse4 (bvadd |v_~#m~0.offset_71| (_ bv12 32)))) (= |v_#length_63| (store (store (store (store (store (store (store |v_#length_65| |v_#t~string33.base_7| (_ bv16 32)) |v_#t~string36.base_8| (_ bv15 32)) |v_~#m~0.base_71| (_ bv24 32)) |v_~#stored_elements~0.base_37| (_ bv1600 32)) |v_~#queue~0.base_42| (_ bv1612 32)) |v_ULTIMATE.start_main_~#id1~0.base_54| (_ bv4 32)) |v_ULTIMATE.start_main_~#id2~0.base_42| (_ bv4 32))) (= |v_~#stored_elements~0.offset_30| (_ bv0 32)) (= (select .cse6 |v_ULTIMATE.start_main_~#id2~0.base_42|) (_ bv0 1)) (= |v_ULTIMATE.start_empty_#in~q.offset_17| v_ULTIMATE.start_empty_~q.offset_20) (bvult |v_#StackHeapBarrier_31| |v_ULTIMATE.start_main_~#id2~0.base_42|) (bvult |v_#StackHeapBarrier_31| |v_#t~string36.base_8|) (= (select .cse10 |v_~#queue~0.base_42|) (_ bv0 1)) (bvult |v_#StackHeapBarrier_31| |v_~#m~0.base_71|) (= (_ bv0 8) v_~dequeue_flag~0_59))))))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_148|, #StackHeapBarrier=|v_#StackHeapBarrier_31|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_510|, #length=|v_#length_65|} OutVars{#t~string33.offset=|v_#t~string33.offset_7|, ULTIMATE.start_main_#t~mem63=|v_ULTIMATE.start_main_#t~mem63_29|, ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_54|, ULTIMATE.start_empty_~q.offset=v_ULTIMATE.start_empty_~q.offset_20, ULTIMATE.start_main_#t~mem62=|v_ULTIMATE.start_main_#t~mem62_44|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_empty_#t~mem30=|v_ULTIMATE.start_empty_#t~mem30_29|, ULTIMATE.start_empty_#t~mem31=|v_ULTIMATE.start_empty_#t~mem31_29|, ULTIMATE.start_empty_~q.base=v_ULTIMATE.start_empty_~q.base_20, #t~string36.offset=|v_#t~string36.offset_8|, #t~string36.base=|v_#t~string36.base_8|, ULTIMATE.start_main_#t~ret59=|v_ULTIMATE.start_main_#t~ret59_32|, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_42|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_39|, ~#queue~0.base=|v_~#queue~0.base_42|, ULTIMATE.start_init_~q.base=v_ULTIMATE.start_init_~q.base_17, ULTIMATE.start_empty_#t~nondet32=|v_ULTIMATE.start_empty_#t~nondet32_18|, ~#queue~0.offset=|v_~#queue~0.offset_41|, #length=|v_#length_63|, ULTIMATE.start_empty_#res=|v_ULTIMATE.start_empty_#res_22|, ~#stored_elements~0.offset=|v_~#stored_elements~0.offset_30|, #t~string33.base=|v_#t~string33.base_7|, #pthreadsMutex=|v_#pthreadsMutex_147|, ~dequeue_flag~0=v_~dequeue_flag~0_59, ULTIMATE.start_empty_#in~q.base=|v_ULTIMATE.start_empty_#in~q.base_17|, ULTIMATE.start_main_#t~nondet60=|v_ULTIMATE.start_main_#t~nondet60_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_27|, ULTIMATE.start_empty_#in~q.offset=|v_ULTIMATE.start_empty_#in~q.offset_17|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_init_#in~q.base=|v_ULTIMATE.start_init_#in~q.base_12|, ~#m~0.base=|v_~#m~0.base_71|, #StackHeapBarrier=|v_#StackHeapBarrier_31|, ~#stored_elements~0.base=|v_~#stored_elements~0.base_37|, ~#m~0.offset=|v_~#m~0.offset_71|, ~enqueue_flag~0=v_~enqueue_flag~0_50, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_81|, #memory_int=|v_#memory_int_509|, ULTIMATE.start_init_#in~q.offset=|v_ULTIMATE.start_init_#in~q.offset_12|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_51|, ULTIMATE.start_init_~q.offset=v_ULTIMATE.start_init_~q.offset_17, currentRoundingMode=v_currentRoundingMode_7} AuxVars[] AssignedVars[#t~string33.offset, ULTIMATE.start_main_#t~mem63, ULTIMATE.start_main_~#id1~0.base, ULTIMATE.start_empty_~q.offset, ULTIMATE.start_main_#t~mem62, #NULL.offset, ULTIMATE.start_empty_#t~mem30, ULTIMATE.start_empty_#t~mem31, ULTIMATE.start_empty_~q.base, #t~string36.offset, #t~string36.base, ULTIMATE.start_main_#t~ret59, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, ~#queue~0.base, ULTIMATE.start_init_~q.base, ULTIMATE.start_empty_#t~nondet32, ~#queue~0.offset, #length, ULTIMATE.start_empty_#res, ~#stored_elements~0.offset, #t~string33.base, #pthreadsMutex, ~dequeue_flag~0, ULTIMATE.start_empty_#in~q.base, ULTIMATE.start_main_#t~nondet60, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_empty_#in~q.offset, #NULL.base, ULTIMATE.start_init_#in~q.base, ~#m~0.base, ~#stored_elements~0.base, ~#m~0.offset, ~enqueue_flag~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_init_#in~q.offset, ULTIMATE.start_main_~#id1~0.offset, ULTIMATE.start_init_~q.offset, currentRoundingMode] because there is no mapped edge [2019-12-07 10:35:42,868 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArrayIndexOutOfBoundsException: 1 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transformations.BlockEncodingBacktranslator.translateProgramExecution(BlockEncodingBacktranslator.java:138) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:126) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportUnproveableResult(TraceAbstractionStarter.java:671) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResults(TraceAbstractionStarter.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 10:35:42,870 INFO L168 Benchmark]: Toolchain (without parser) took 46884.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 947.0 MB in the beginning and 880.2 MB in the end (delta: 66.8 MB). Peak memory consumption was 370.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:35:42,870 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:35:42,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -105.1 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:35:42,871 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:35:42,871 INFO L168 Benchmark]: Boogie Preprocessor took 30.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:35:42,872 INFO L168 Benchmark]: RCFGBuilder took 406.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:35:42,872 INFO L168 Benchmark]: TraceAbstraction took 45932.22 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 191.9 MB). Free memory was 1.0 GB in the beginning and 880.2 MB in the end (delta: 120.6 MB). Peak memory consumption was 312.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:35:42,875 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 467.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -105.1 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.19 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 406.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45932.22 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 191.9 MB). Free memory was 1.0 GB in the beginning and 880.2 MB in the end (delta: 120.6 MB). Peak memory consumption was 312.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.8s, 192 ProgramPointsBefore, 52 ProgramPointsAfterwards, 200 TransitionsBefore, 55 TransitionsAfterwards, 8884 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 91 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 14 ConcurrentYvCompositions, 6 ChoiceCompositions, 4670 VarBasedMoverChecksPositive, 86 VarBasedMoverChecksNegative, 14 SemBasedMoverChecksPositive, 104 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 17779 CheckedPairsTotal, 170 TotalNumberOfCompositions - ExceptionOrErrorResult: ArrayIndexOutOfBoundsException: 1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArrayIndexOutOfBoundsException: 1: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transformations.BlockEncodingBacktranslator.translateProgramExecution(BlockEncodingBacktranslator.java:138) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...