/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:35:44,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:35:44,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:35:44,826 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:35:44,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:35:44,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:35:44,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:35:44,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:35:44,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:35:44,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:35:44,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:35:44,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:35:44,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:35:44,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:35:44,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:35:44,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:35:44,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:35:44,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:35:44,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:35:44,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:35:44,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:35:44,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:35:44,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:35:44,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:35:44,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:35:44,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:35:44,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:35:44,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:35:44,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:35:44,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:35:44,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:35:44,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:35:44,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:35:44,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:35:44,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:35:44,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:35:44,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:35:44,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:35:44,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:35:44,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:35:44,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:35:44,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-18 23:35:44,892 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:35:44,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:35:44,894 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:35:44,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:35:44,894 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:35:44,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:35:44,895 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:35:44,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:35:44,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:35:44,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:35:44,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:35:44,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:35:44,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:35:44,896 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:35:44,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:35:44,896 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:35:44,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:35:44,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:35:44,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:35:44,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:35:44,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:35:44,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:35:44,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:35:44,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:35:44,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:35:44,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:35:44,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:35:44,898 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-18 23:35:44,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:35:44,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:35:45,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:35:45,179 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:35:45,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:35:45,186 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:35:45,186 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:35:45,187 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2019-12-18 23:35:45,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e481e4b93/16dd80b604ca4637bf1d0bb343e9e8c8/FLAGb865bd8ce [2019-12-18 23:35:45,823 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:35:45,824 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2019-12-18 23:35:45,844 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e481e4b93/16dd80b604ca4637bf1d0bb343e9e8c8/FLAGb865bd8ce [2019-12-18 23:35:46,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e481e4b93/16dd80b604ca4637bf1d0bb343e9e8c8 [2019-12-18 23:35:46,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:35:46,114 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:35:46,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:35:46,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:35:46,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:35:46,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:35:46" (1/1) ... [2019-12-18 23:35:46,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317ba546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:35:46, skipping insertion in model container [2019-12-18 23:35:46,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:35:46" (1/1) ... [2019-12-18 23:35:46,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:35:46,181 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:35:46,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:35:46,781 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:35:46,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:35:47,083 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:35:47,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:35:47 WrapperNode [2019-12-18 23:35:47,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:35:47,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:35:47,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:35:47,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:35:47,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:35:47" (1/1) ... [2019-12-18 23:35:47,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:35:47" (1/1) ... [2019-12-18 23:35:47,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:35:47,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:35:47,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:35:47,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:35:47,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:35:47" (1/1) ... [2019-12-18 23:35:47,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:35:47" (1/1) ... [2019-12-18 23:35:47,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:35:47" (1/1) ... [2019-12-18 23:35:47,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:35:47" (1/1) ... [2019-12-18 23:35:47,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:35:47" (1/1) ... [2019-12-18 23:35:47,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:35:47" (1/1) ... [2019-12-18 23:35:47,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:35:47" (1/1) ... [2019-12-18 23:35:47,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:35:47,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:35:47,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:35:47,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:35:47,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:35:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:35:47,307 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-18 23:35:47,307 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-18 23:35:47,307 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-18 23:35:47,308 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-18 23:35:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:35:47,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:35:47,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 23:35:47,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:35:47,309 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-18 23:35:47,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 23:35:47,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:35:47,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:35:47,312 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:35:48,024 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:35:48,024 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-18 23:35:48,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:35:48 BoogieIcfgContainer [2019-12-18 23:35:48,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:35:48,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:35:48,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:35:48,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:35:48,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:35:46" (1/3) ... [2019-12-18 23:35:48,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df9d499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:35:48, skipping insertion in model container [2019-12-18 23:35:48,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:35:47" (2/3) ... [2019-12-18 23:35:48,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df9d499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:35:48, skipping insertion in model container [2019-12-18 23:35:48,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:35:48" (3/3) ... [2019-12-18 23:35:48,035 INFO L109 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2019-12-18 23:35:48,046 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:35:48,046 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:35:48,054 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:35:48,055 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:35:48,098 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,099 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,099 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,099 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,100 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,100 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,100 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,100 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,102 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,102 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,103 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,104 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,105 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,105 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,105 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,105 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,106 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,106 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,106 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,106 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,106 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,107 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,107 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,107 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,107 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,108 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,108 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,108 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,108 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,108 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,109 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,109 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,109 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,109 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,109 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,109 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,110 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,111 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,111 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,111 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,112 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,112 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,112 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,113 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,113 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,113 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,113 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,114 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,114 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,115 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,115 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,115 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,115 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,115 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,116 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,116 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,116 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,116 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,116 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,117 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,117 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,117 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,117 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,117 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,118 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,118 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,118 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,118 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,118 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,119 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,119 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,119 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,119 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,119 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,119 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,119 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,120 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,120 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,120 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,120 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,120 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,121 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,121 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,121 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,121 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,121 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,128 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,128 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,129 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,129 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,129 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,129 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,129 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,130 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,131 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,132 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,132 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,132 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,132 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,133 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,133 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,133 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,134 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,137 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,137 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,137 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,138 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,145 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,145 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,146 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,146 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,147 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,147 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,147 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,147 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,147 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,147 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,147 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,147 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,148 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,148 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,148 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,148 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,148 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,148 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,149 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,150 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,150 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,150 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,151 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,151 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,151 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,151 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,151 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,152 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,152 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,152 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,152 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,152 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,152 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,153 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,153 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,153 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,153 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,153 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,153 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,153 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,154 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,154 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,154 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,154 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,154 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,154 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,154 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,155 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,155 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,155 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,156 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,156 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,156 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,156 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,156 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,156 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,156 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,157 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,157 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,157 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,157 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,157 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,157 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,158 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,159 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,159 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,160 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,164 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,164 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,164 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,165 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,165 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,165 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,165 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,165 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,165 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,165 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,166 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,166 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,166 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,166 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,166 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,166 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,167 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,167 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,167 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,167 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,167 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,168 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,168 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,168 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,168 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,168 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,168 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,169 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,169 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,169 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,169 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,169 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,170 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,170 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,170 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,170 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,170 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,171 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,174 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,174 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,175 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,175 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,175 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,175 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,175 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,175 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,176 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,176 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,176 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,176 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,176 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,177 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,177 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,177 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,177 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,177 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,177 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,178 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,178 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,178 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,178 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,183 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,184 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,184 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,184 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,184 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,185 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,185 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,185 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,185 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,185 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,185 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,186 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,186 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,186 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,186 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,186 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,186 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,187 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,187 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,187 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,187 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,187 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,188 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,188 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,188 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,188 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,188 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,188 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,189 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,189 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,189 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:35:48,210 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 23:35:48,230 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:35:48,230 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:35:48,230 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:35:48,230 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:35:48,230 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:35:48,230 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:35:48,230 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:35:48,230 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:35:48,244 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 196 places, 204 transitions [2019-12-18 23:35:48,726 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 10787 states. [2019-12-18 23:35:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 10787 states. [2019-12-18 23:35:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 23:35:48,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:35:48,743 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:35:48,743 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:35:48,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:35:48,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1929394428, now seen corresponding path program 1 times [2019-12-18 23:35:48,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:35:48,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230154631] [2019-12-18 23:35:48,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:35:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:35:49,194 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-18 23:35:49,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230154631] [2019-12-18 23:35:49,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:35:49,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:35:49,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195305936] [2019-12-18 23:35:49,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-18 23:35:49,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:35:49,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-18 23:35:49,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 23:35:49,223 INFO L87 Difference]: Start difference. First operand 10787 states. Second operand 2 states. [2019-12-18 23:35:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:35:49,371 INFO L93 Difference]: Finished difference Result 10784 states and 29353 transitions. [2019-12-18 23:35:49,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 23:35:49,373 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 44 [2019-12-18 23:35:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:35:49,464 INFO L225 Difference]: With dead ends: 10784 [2019-12-18 23:35:49,464 INFO L226 Difference]: Without dead ends: 9749 [2019-12-18 23:35:49,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-18 23:35:49,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9749 states. [2019-12-18 23:35:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9749 to 9749. [2019-12-18 23:35:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9749 states. [2019-12-18 23:35:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9749 states to 9749 states and 26526 transitions. [2019-12-18 23:35:49,998 INFO L78 Accepts]: Start accepts. Automaton has 9749 states and 26526 transitions. Word has length 44 [2019-12-18 23:35:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:35:49,999 INFO L462 AbstractCegarLoop]: Abstraction has 9749 states and 26526 transitions. [2019-12-18 23:35:49,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-18 23:35:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 9749 states and 26526 transitions. [2019-12-18 23:35:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 23:35:50,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:35:50,020 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:35:50,021 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:35:50,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:35:50,021 INFO L82 PathProgramCache]: Analyzing trace with hash -593181059, now seen corresponding path program 1 times [2019-12-18 23:35:50,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:35:50,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502206913] [2019-12-18 23:35:50,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:35:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:35:50,420 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-18 23:35:50,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502206913] [2019-12-18 23:35:50,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:35:50,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:35:50,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474718979] [2019-12-18 23:35:50,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:35:50,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:35:50,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:35:50,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:35:50,424 INFO L87 Difference]: Start difference. First operand 9749 states and 26526 transitions. Second operand 12 states. [2019-12-18 23:35:50,947 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-12-18 23:35:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:35:51,246 INFO L93 Difference]: Finished difference Result 9780 states and 26590 transitions. [2019-12-18 23:35:51,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:35:51,248 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-18 23:35:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:35:51,313 INFO L225 Difference]: With dead ends: 9780 [2019-12-18 23:35:51,313 INFO L226 Difference]: Without dead ends: 9780 [2019-12-18 23:35:51,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2019-12-18 23:35:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9780 states. [2019-12-18 23:35:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9780 to 9746. [2019-12-18 23:35:51,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9746 states. [2019-12-18 23:35:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 26522 transitions. [2019-12-18 23:35:51,631 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 26522 transitions. Word has length 97 [2019-12-18 23:35:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:35:51,632 INFO L462 AbstractCegarLoop]: Abstraction has 9746 states and 26522 transitions. [2019-12-18 23:35:51,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:35:51,632 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 26522 transitions. [2019-12-18 23:35:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 23:35:51,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:35:51,647 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:35:51,648 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:35:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:35:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1482308150, now seen corresponding path program 1 times [2019-12-18 23:35:51,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:35:51,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085133057] [2019-12-18 23:35:51,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:35:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:35:52,753 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-18 23:35:52,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085133057] [2019-12-18 23:35:52,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:35:52,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 23:35:52,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535923276] [2019-12-18 23:35:52,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 23:35:52,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:35:52,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 23:35:52,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:35:52,758 INFO L87 Difference]: Start difference. First operand 9746 states and 26522 transitions. Second operand 18 states. [2019-12-18 23:35:53,801 WARN L192 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-18 23:35:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:35:55,165 INFO L93 Difference]: Finished difference Result 13022 states and 35325 transitions. [2019-12-18 23:35:55,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 23:35:55,166 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-12-18 23:35:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:35:55,199 INFO L225 Difference]: With dead ends: 13022 [2019-12-18 23:35:55,199 INFO L226 Difference]: Without dead ends: 13022 [2019-12-18 23:35:55,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 23:35:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13022 states. [2019-12-18 23:35:55,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13022 to 11672. [2019-12-18 23:35:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11672 states. [2019-12-18 23:35:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11672 states to 11672 states and 31707 transitions. [2019-12-18 23:35:55,638 INFO L78 Accepts]: Start accepts. Automaton has 11672 states and 31707 transitions. Word has length 98 [2019-12-18 23:35:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:35:55,639 INFO L462 AbstractCegarLoop]: Abstraction has 11672 states and 31707 transitions. [2019-12-18 23:35:55,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 23:35:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 11672 states and 31707 transitions. [2019-12-18 23:35:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-18 23:35:55,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:35:55,658 INFO L411 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:35:55,658 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:35:55,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:35:55,658 INFO L82 PathProgramCache]: Analyzing trace with hash 921844576, now seen corresponding path program 1 times [2019-12-18 23:35:55,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:35:55,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133829286] [2019-12-18 23:35:55,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:35:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:35:55,745 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-18 23:35:55,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133829286] [2019-12-18 23:35:55,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:35:55,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:35:55,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22087113] [2019-12-18 23:35:55,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:35:55,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:35:55,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:35:55,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:35:55,748 INFO L87 Difference]: Start difference. First operand 11672 states and 31707 transitions. Second operand 4 states. [2019-12-18 23:35:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:35:55,824 INFO L93 Difference]: Finished difference Result 11918 states and 32061 transitions. [2019-12-18 23:35:55,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:35:55,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-18 23:35:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:35:55,856 INFO L225 Difference]: With dead ends: 11918 [2019-12-18 23:35:55,857 INFO L226 Difference]: Without dead ends: 11312 [2019-12-18 23:35:55,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:35:55,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11312 states. [2019-12-18 23:35:56,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11312 to 10268. [2019-12-18 23:35:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10268 states. [2019-12-18 23:35:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 27635 transitions. [2019-12-18 23:35:56,220 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 27635 transitions. Word has length 99 [2019-12-18 23:35:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:35:56,220 INFO L462 AbstractCegarLoop]: Abstraction has 10268 states and 27635 transitions. [2019-12-18 23:35:56,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:35:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 27635 transitions. [2019-12-18 23:35:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-18 23:35:56,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:35:56,246 INFO L411 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, 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, 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, 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, 1, 1, 1, 1] [2019-12-18 23:35:56,246 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:35:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:35:56,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1815021150, now seen corresponding path program 1 times [2019-12-18 23:35:56,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:35:56,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110216052] [2019-12-18 23:35:56,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:35:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:35:56,359 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-18 23:35:56,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110216052] [2019-12-18 23:35:56,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:35:56,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:35:56,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586867925] [2019-12-18 23:35:56,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:35:56,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:35:56,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:35:56,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:35:56,362 INFO L87 Difference]: Start difference. First operand 10268 states and 27635 transitions. Second operand 3 states. [2019-12-18 23:35:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:35:56,381 INFO L93 Difference]: Finished difference Result 1808 states and 4120 transitions. [2019-12-18 23:35:56,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:35:56,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-12-18 23:35:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:35:56,386 INFO L225 Difference]: With dead ends: 1808 [2019-12-18 23:35:56,387 INFO L226 Difference]: Without dead ends: 1544 [2019-12-18 23:35:56,387 INFO L631 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-18 23:35:56,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2019-12-18 23:35:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1424. [2019-12-18 23:35:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1424 states. [2019-12-18 23:35:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 3200 transitions. [2019-12-18 23:35:56,412 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 3200 transitions. Word has length 116 [2019-12-18 23:35:56,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:35:56,413 INFO L462 AbstractCegarLoop]: Abstraction has 1424 states and 3200 transitions. [2019-12-18 23:35:56,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:35:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 3200 transitions. [2019-12-18 23:35:56,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-18 23:35:56,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:35:56,417 INFO L411 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, 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, 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, 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, 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-18 23:35:56,418 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:35:56,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:35:56,418 INFO L82 PathProgramCache]: Analyzing trace with hash -206631209, now seen corresponding path program 1 times [2019-12-18 23:35:56,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:35:56,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359719794] [2019-12-18 23:35:56,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:35:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:35:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:35:56,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359719794] [2019-12-18 23:35:56,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915225359] [2019-12-18 23:35:56,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:35:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:35:56,638 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-18 23:35:56,648 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:35:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:35:56,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:35:56,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 23:35:56,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643520799] [2019-12-18 23:35:56,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:35:56,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:35:56,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:35:56,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:35:56,718 INFO L87 Difference]: Start difference. First operand 1424 states and 3200 transitions. Second operand 7 states. [2019-12-18 23:35:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:35:56,796 INFO L93 Difference]: Finished difference Result 2240 states and 5060 transitions. [2019-12-18 23:35:56,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:35:56,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-12-18 23:35:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:35:56,804 INFO L225 Difference]: With dead ends: 2240 [2019-12-18 23:35:56,804 INFO L226 Difference]: Without dead ends: 2240 [2019-12-18 23:35:56,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:35:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-18 23:35:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1844. [2019-12-18 23:35:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2019-12-18 23:35:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 4157 transitions. [2019-12-18 23:35:56,860 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 4157 transitions. Word has length 138 [2019-12-18 23:35:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:35:56,861 INFO L462 AbstractCegarLoop]: Abstraction has 1844 states and 4157 transitions. [2019-12-18 23:35:56,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:35:56,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 4157 transitions. [2019-12-18 23:35:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-18 23:35:56,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:35:56,866 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1] [2019-12-18 23:35:57,069 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:35:57,070 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:35:57,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:35:57,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1577960977, now seen corresponding path program 2 times [2019-12-18 23:35:57,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:35:57,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252982058] [2019-12-18 23:35:57,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:35:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:35:57,206 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:35:57,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252982058] [2019-12-18 23:35:57,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835194715] [2019-12-18 23:35:57,207 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:35:57,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:35:57,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:35:57,368 INFO L264 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:35:57,374 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:35:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:35:57,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:35:57,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 23:35:57,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912694584] [2019-12-18 23:35:57,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:35:57,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:35:57,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:35:57,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:35:57,467 INFO L87 Difference]: Start difference. First operand 1844 states and 4157 transitions. Second operand 9 states. [2019-12-18 23:35:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:35:57,551 INFO L93 Difference]: Finished difference Result 2660 states and 6017 transitions. [2019-12-18 23:35:57,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:35:57,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-12-18 23:35:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:35:57,558 INFO L225 Difference]: With dead ends: 2660 [2019-12-18 23:35:57,558 INFO L226 Difference]: Without dead ends: 2660 [2019-12-18 23:35:57,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:35:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2019-12-18 23:35:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2264. [2019-12-18 23:35:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-12-18 23:35:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 5114 transitions. [2019-12-18 23:35:57,604 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 5114 transitions. Word has length 167 [2019-12-18 23:35:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:35:57,604 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 5114 transitions. [2019-12-18 23:35:57,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:35:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 5114 transitions. [2019-12-18 23:35:57,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-12-18 23:35:57,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:35:57,611 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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-18 23:35:57,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:35:57,815 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:35:57,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:35:57,815 INFO L82 PathProgramCache]: Analyzing trace with hash -834842345, now seen corresponding path program 3 times [2019-12-18 23:35:57,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:35:57,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862373293] [2019-12-18 23:35:57,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:35:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:35:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:35:57,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862373293] [2019-12-18 23:35:57,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028023497] [2019-12-18 23:35:57,954 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:35:58,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 23:35:58,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:35:58,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 66 conjunts are in the unsatisfiable core [2019-12-18 23:35:58,118 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:35:58,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-12-18 23:35:58,165 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:58,171 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:58,172 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:58,172 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-18 23:35:58,199 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:58,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-18 23:35:58,201 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:58,205 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:58,205 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:58,206 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-18 23:35:58,304 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-18 23:35:58,305 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:58,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:58,312 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:58,312 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-18 23:35:58,341 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-18 23:35:58,342 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:58,351 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:58,352 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:58,352 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-18 23:35:58,458 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:35:58,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:58,474 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:35:58,475 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:58,514 INFO L614 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2019-12-18 23:35:58,515 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:58,516 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-18 23:35:58,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:58,550 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 23:35:58,550 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:58,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:58,563 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-18 23:35:58,564 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-18 23:35:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-18 23:35:58,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-18 23:35:58,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2019-12-18 23:35:58,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133442636] [2019-12-18 23:35:58,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:35:58,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:35:58,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:35:58,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:35:58,725 INFO L87 Difference]: Start difference. First operand 2264 states and 5114 transitions. Second operand 13 states. [2019-12-18 23:35:59,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:35:59,351 INFO L93 Difference]: Finished difference Result 3701 states and 8378 transitions. [2019-12-18 23:35:59,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:35:59,352 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 196 [2019-12-18 23:35:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:35:59,361 INFO L225 Difference]: With dead ends: 3701 [2019-12-18 23:35:59,361 INFO L226 Difference]: Without dead ends: 3701 [2019-12-18 23:35:59,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:35:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2019-12-18 23:35:59,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 3020. [2019-12-18 23:35:59,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3020 states. [2019-12-18 23:35:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 6827 transitions. [2019-12-18 23:35:59,421 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 6827 transitions. Word has length 196 [2019-12-18 23:35:59,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:35:59,422 INFO L462 AbstractCegarLoop]: Abstraction has 3020 states and 6827 transitions. [2019-12-18 23:35:59,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:35:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 6827 transitions. [2019-12-18 23:35:59,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-12-18 23:35:59,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:35:59,429 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1] [2019-12-18 23:35:59,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:35:59,634 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:35:59,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:35:59,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1197311036, now seen corresponding path program 1 times [2019-12-18 23:35:59,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:35:59,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612945928] [2019-12-18 23:35:59,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:35:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:35:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:35:59,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612945928] [2019-12-18 23:35:59,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641340961] [2019-12-18 23:35:59,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:35:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:35:59,900 INFO L264 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:35:59,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:35:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:35:59,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:35:59,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-12-18 23:35:59,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523401972] [2019-12-18 23:35:59,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 23:35:59,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:35:59,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 23:35:59,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:35:59,963 INFO L87 Difference]: Start difference. First operand 3020 states and 6827 transitions. Second operand 11 states. [2019-12-18 23:36:00,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:36:00,107 INFO L93 Difference]: Finished difference Result 4460 states and 10091 transitions. [2019-12-18 23:36:00,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:36:00,107 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 200 [2019-12-18 23:36:00,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:36:00,117 INFO L225 Difference]: With dead ends: 4460 [2019-12-18 23:36:00,117 INFO L226 Difference]: Without dead ends: 4460 [2019-12-18 23:36:00,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:36:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2019-12-18 23:36:00,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 3764. [2019-12-18 23:36:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3764 states. [2019-12-18 23:36:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 8513 transitions. [2019-12-18 23:36:00,205 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 8513 transitions. Word has length 200 [2019-12-18 23:36:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:36:00,206 INFO L462 AbstractCegarLoop]: Abstraction has 3764 states and 8513 transitions. [2019-12-18 23:36:00,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 23:36:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 8513 transitions. [2019-12-18 23:36:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-12-18 23:36:00,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:36:00,218 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 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, 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, 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, 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, 1, 1, 1, 1] [2019-12-18 23:36:00,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:36:00,430 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:36:00,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:36:00,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1476674553, now seen corresponding path program 2 times [2019-12-18 23:36:00,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:36:00,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630440900] [2019-12-18 23:36:00,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:36:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:36:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:36:00,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630440900] [2019-12-18 23:36:00,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702228266] [2019-12-18 23:36:00,669 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:36:00,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:36:00,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:36:00,868 INFO L264 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 23:36:00,873 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:36:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:36:00,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:36:00,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-12-18 23:36:00,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83526144] [2019-12-18 23:36:00,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:36:00,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:36:00,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:36:00,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:36:00,951 INFO L87 Difference]: Start difference. First operand 3764 states and 8513 transitions. Second operand 13 states. [2019-12-18 23:36:01,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:36:01,105 INFO L93 Difference]: Finished difference Result 5204 states and 11777 transitions. [2019-12-18 23:36:01,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 23:36:01,105 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 233 [2019-12-18 23:36:01,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:36:01,116 INFO L225 Difference]: With dead ends: 5204 [2019-12-18 23:36:01,117 INFO L226 Difference]: Without dead ends: 5204 [2019-12-18 23:36:01,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-12-18 23:36:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2019-12-18 23:36:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4508. [2019-12-18 23:36:01,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4508 states. [2019-12-18 23:36:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 10199 transitions. [2019-12-18 23:36:01,191 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 10199 transitions. Word has length 233 [2019-12-18 23:36:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:36:01,192 INFO L462 AbstractCegarLoop]: Abstraction has 4508 states and 10199 transitions. [2019-12-18 23:36:01,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:36:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 10199 transitions. [2019-12-18 23:36:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-12-18 23:36:01,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:36:01,202 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1] [2019-12-18 23:36:01,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:36:01,407 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:36:01,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:36:01,407 INFO L82 PathProgramCache]: Analyzing trace with hash -308517151, now seen corresponding path program 3 times [2019-12-18 23:36:01,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:36:01,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141771923] [2019-12-18 23:36:01,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:36:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:36:01,648 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:36:01,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141771923] [2019-12-18 23:36:01,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952504935] [2019-12-18 23:36:01,649 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:36:02,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-18 23:36:02,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:36:02,195 INFO L264 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 70 conjunts are in the unsatisfiable core [2019-12-18 23:36:02,201 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:36:02,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-12-18 23:36:02,207 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:02,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:02,209 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:36:02,209 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-18 23:36:02,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:02,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-18 23:36:02,232 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:02,236 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:02,237 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:36:02,237 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-18 23:36:02,359 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-18 23:36:02,360 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:02,366 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:02,366 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:36:02,367 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-18 23:36:02,399 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-18 23:36:02,399 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:02,412 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:02,413 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:36:02,413 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-18 23:36:02,521 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:36:02,539 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:02,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:36:02,540 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:02,572 INFO L614 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2019-12-18 23:36:02,573 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:36:02,573 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-18 23:36:02,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:36:02,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 23:36:02,611 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:02,623 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:02,623 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-18 23:36:02,624 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-18 23:36:02,725 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 34 treesize of output 18 [2019-12-18 23:36:02,726 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:02,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:02,735 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-18 23:36:02,736 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:17 [2019-12-18 23:36:02,773 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-18 23:36:02,774 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:02,782 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:02,783 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:36:02,783 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-18 23:36:02,897 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:36:02,910 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:02,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:36:02,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:02,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:02,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:02,919 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:36:02,965 INFO L614 ElimStorePlain]: treesize reduction 50, result has 44.4 percent of original size [2019-12-18 23:36:02,966 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-18 23:36:02,966 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:23 [2019-12-18 23:36:02,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:36:02,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 23:36:02,998 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:03,011 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:03,012 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-18 23:36:03,012 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-18 23:36:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 223 proven. 27 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-18 23:36:03,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:36:03,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 30 [2019-12-18 23:36:03,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570105354] [2019-12-18 23:36:03,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-18 23:36:03,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:36:03,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-18 23:36:03,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2019-12-18 23:36:03,188 INFO L87 Difference]: Start difference. First operand 4508 states and 10199 transitions. Second operand 30 states. [2019-12-18 23:36:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:36:10,638 INFO L93 Difference]: Finished difference Result 9782 states and 22241 transitions. [2019-12-18 23:36:10,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-12-18 23:36:10,639 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 262 [2019-12-18 23:36:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:36:10,653 INFO L225 Difference]: With dead ends: 9782 [2019-12-18 23:36:10,654 INFO L226 Difference]: Without dead ends: 9782 [2019-12-18 23:36:10,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 334 SyntacticMatches, 3 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6912 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4096, Invalid=14810, Unknown=0, NotChecked=0, Total=18906 [2019-12-18 23:36:10,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9782 states. [2019-12-18 23:36:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9782 to 6982. [2019-12-18 23:36:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6982 states. [2019-12-18 23:36:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6982 states to 6982 states and 15823 transitions. [2019-12-18 23:36:10,802 INFO L78 Accepts]: Start accepts. Automaton has 6982 states and 15823 transitions. Word has length 262 [2019-12-18 23:36:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:36:10,802 INFO L462 AbstractCegarLoop]: Abstraction has 6982 states and 15823 transitions. [2019-12-18 23:36:10,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-18 23:36:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 6982 states and 15823 transitions. [2019-12-18 23:36:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-12-18 23:36:10,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:36:10,819 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 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, 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, 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, 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-18 23:36:11,026 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:36:11,027 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:36:11,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:36:11,027 INFO L82 PathProgramCache]: Analyzing trace with hash -640241455, now seen corresponding path program 4 times [2019-12-18 23:36:11,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:36:11,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878987956] [2019-12-18 23:36:11,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:36:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:36:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:36:11,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878987956] [2019-12-18 23:36:11,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382169116] [2019-12-18 23:36:11,428 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:36:11,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:36:11,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:36:11,855 INFO L264 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-18 23:36:11,860 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:36:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:36:11,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:36:11,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-12-18 23:36:11,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707970400] [2019-12-18 23:36:11,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:36:11,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:36:11,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:36:11,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:36:11,951 INFO L87 Difference]: Start difference. First operand 6982 states and 15823 transitions. Second operand 17 states. [2019-12-18 23:36:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:36:12,176 INFO L93 Difference]: Finished difference Result 9190 states and 20815 transitions. [2019-12-18 23:36:12,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 23:36:12,176 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 299 [2019-12-18 23:36:12,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:36:12,188 INFO L225 Difference]: With dead ends: 9190 [2019-12-18 23:36:12,188 INFO L226 Difference]: Without dead ends: 9190 [2019-12-18 23:36:12,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:36:12,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9190 states. [2019-12-18 23:36:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9190 to 8122. [2019-12-18 23:36:12,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8122 states. [2019-12-18 23:36:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8122 states to 8122 states and 18400 transitions. [2019-12-18 23:36:12,345 INFO L78 Accepts]: Start accepts. Automaton has 8122 states and 18400 transitions. Word has length 299 [2019-12-18 23:36:12,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:36:12,345 INFO L462 AbstractCegarLoop]: Abstraction has 8122 states and 18400 transitions. [2019-12-18 23:36:12,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:36:12,346 INFO L276 IsEmpty]: Start isEmpty. Operand 8122 states and 18400 transitions. [2019-12-18 23:36:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-12-18 23:36:12,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:36:12,365 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 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, 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-18 23:36:12,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:36:12,570 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:36:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:36:12,571 INFO L82 PathProgramCache]: Analyzing trace with hash 728736089, now seen corresponding path program 5 times [2019-12-18 23:36:12,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:36:12,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784708457] [2019-12-18 23:36:12,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:36:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:36:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:36:12,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784708457] [2019-12-18 23:36:12,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288631895] [2019-12-18 23:36:12,881 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:36:13,248 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-18 23:36:13,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:36:13,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 116 conjunts are in the unsatisfiable core [2019-12-18 23:36:13,261 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:36:13,313 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 13 treesize of output 9 [2019-12-18 23:36:13,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:13,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:13,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:36:13,316 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-18 23:36:13,358 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:13,359 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 25 treesize of output 62 [2019-12-18 23:36:13,360 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:13,392 INFO L614 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2019-12-18 23:36:13,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:36:13,394 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2019-12-18 23:36:13,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:13,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:13,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:13,670 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:36:13,671 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:36:13,689 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:13,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:36:13,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:13,714 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:13,714 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 25 treesize of output 54 [2019-12-18 23:36:13,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:13,716 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:13,815 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-18 23:36:13,817 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:36:13,817 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-18 23:36:13,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:13,857 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 15 treesize of output 11 [2019-12-18 23:36:13,858 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:13,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:36:13,866 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-18 23:36:13,866 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:13,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:13,900 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:36:13,900 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-18 23:36:14,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:14,052 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 0 case distinctions, treesize of input 25 treesize of output 15 [2019-12-18 23:36:14,053 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:14,062 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 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 23:36:14,063 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:14,081 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:14,082 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:36:14,083 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:34 [2019-12-18 23:36:14,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:14,165 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:14,165 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 25 treesize of output 62 [2019-12-18 23:36:14,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:14,166 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:14,172 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 15 treesize of output 11 [2019-12-18 23:36:14,173 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:14,235 INFO L614 ElimStorePlain]: treesize reduction 23, result has 75.8 percent of original size [2019-12-18 23:36:14,236 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 23:36:14,237 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:48 [2019-12-18 23:36:14,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-18 23:36:14,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:14,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:14,553 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:36:14,575 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:36:14,591 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:14,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:36:14,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:14,592 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:14,612 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:14,613 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 25 treesize of output 54 [2019-12-18 23:36:14,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:14,614 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:14,712 INFO L614 ElimStorePlain]: treesize reduction 54, result has 64.5 percent of original size [2019-12-18 23:36:14,713 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:36:14,713 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-18 23:36:14,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:14,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:36:14,758 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-18 23:36:14,759 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:14,764 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 15 treesize of output 11 [2019-12-18 23:36:14,765 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:14,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:14,800 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:36:14,800 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-18 23:36:14,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:14,947 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 0 case distinctions, treesize of input 25 treesize of output 15 [2019-12-18 23:36:14,948 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:14,956 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 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 23:36:14,957 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:14,976 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:14,977 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:36:14,978 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:34 [2019-12-18 23:36:15,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:15,056 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:15,057 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 25 treesize of output 62 [2019-12-18 23:36:15,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:15,059 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:15,065 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 15 treesize of output 11 [2019-12-18 23:36:15,066 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:15,126 INFO L614 ElimStorePlain]: treesize reduction 23, result has 75.8 percent of original size [2019-12-18 23:36:15,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 23:36:15,127 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:48 [2019-12-18 23:36:15,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-18 23:36:15,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:15,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:15,489 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:15,489 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 25 treesize of output 54 [2019-12-18 23:36:15,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:15,491 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:15,498 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:36:15,516 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:15,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:36:15,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:15,518 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:15,626 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-12-18 23:36:15,627 INFO L614 ElimStorePlain]: treesize reduction 54, result has 64.5 percent of original size [2019-12-18 23:36:15,628 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:36:15,628 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-18 23:36:15,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:15,675 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 15 treesize of output 11 [2019-12-18 23:36:15,675 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:15,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:36:15,684 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-18 23:36:15,685 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:15,721 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:15,721 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:36:15,722 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-18 23:36:15,887 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 0 case distinctions, treesize of input 23 treesize of output 13 [2019-12-18 23:36:15,887 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:15,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:15,902 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:36:15,903 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-18 23:36:15,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:36:15,955 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-18 23:36:15,955 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:15,968 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:15,968 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-18 23:36:15,969 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-18 23:36:16,209 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:36:16,224 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:16,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:36:16,225 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:16,269 INFO L614 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2019-12-18 23:36:16,269 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:36:16,270 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 23:36:16,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:36:16,315 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-18 23:36:16,316 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:16,330 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:16,331 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-18 23:36:16,331 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 23:36:16,472 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 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 23:36:16,472 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:16,486 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:16,487 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-18 23:36:16,487 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 23:36:16,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:36:16,535 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-18 23:36:16,536 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:16,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:16,551 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-18 23:36:16,552 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-18 23:36:16,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:36:16,873 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:16,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:36:16,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:16,875 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:16,924 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-18 23:36:16,924 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:36:16,924 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 23:36:16,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:36:16,989 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-18 23:36:16,989 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:17,006 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:17,007 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-18 23:36:17,007 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 23:36:17,173 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 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 23:36:17,173 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:17,195 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:17,195 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-18 23:36:17,196 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 23:36:17,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:36:17,251 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-18 23:36:17,252 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:17,266 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:17,267 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:36:17,268 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-18 23:36:17,512 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:17,513 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 34 treesize of output 57 [2019-12-18 23:36:17,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:36:17,515 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:17,541 INFO L614 ElimStorePlain]: treesize reduction 35, result has 46.2 percent of original size [2019-12-18 23:36:17,542 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:36:17,542 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-12-18 23:36:17,558 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-18 23:36:17,558 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 25 treesize of output 24 [2019-12-18 23:36:17,559 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:17,566 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:17,567 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-18 23:36:17,567 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-12-18 23:36:17,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2019-12-18 23:36:17,571 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:36:17,577 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:36:17,577 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:36:17,577 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-18 23:36:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 357 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:36:18,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:36:18,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 51] total 66 [2019-12-18 23:36:18,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338532104] [2019-12-18 23:36:18,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-12-18 23:36:18,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:36:18,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-12-18 23:36:18,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=3715, Unknown=0, NotChecked=0, Total=4290 [2019-12-18 23:36:18,093 INFO L87 Difference]: Start difference. First operand 8122 states and 18400 transitions. Second operand 66 states. [2019-12-18 23:36:31,650 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-18 23:36:43,636 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-12-18 23:36:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:36:57,506 INFO L93 Difference]: Finished difference Result 27512 states and 62813 transitions. [2019-12-18 23:36:57,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 386 states. [2019-12-18 23:36:57,508 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 328 [2019-12-18 23:36:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:36:57,529 INFO L225 Difference]: With dead ends: 27512 [2019-12-18 23:36:57,530 INFO L226 Difference]: Without dead ends: 27512 [2019-12-18 23:36:57,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 582 SyntacticMatches, 11 SemanticMatches, 441 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88883 ImplicationChecksByTransitivity, 33.4s TimeCoverageRelationStatistics Valid=22127, Invalid=173679, Unknown=0, NotChecked=0, Total=195806 [2019-12-18 23:36:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27512 states. [2019-12-18 23:36:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27512 to 18146. [2019-12-18 23:36:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18146 states. [2019-12-18 23:36:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18146 states to 18146 states and 41376 transitions. [2019-12-18 23:36:57,954 INFO L78 Accepts]: Start accepts. Automaton has 18146 states and 41376 transitions. Word has length 328 [2019-12-18 23:36:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:36:57,954 INFO L462 AbstractCegarLoop]: Abstraction has 18146 states and 41376 transitions. [2019-12-18 23:36:57,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-12-18 23:36:57,954 INFO L276 IsEmpty]: Start isEmpty. Operand 18146 states and 41376 transitions. [2019-12-18 23:36:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-12-18 23:36:57,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:36:57,983 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 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, 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, 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, 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-18 23:36:58,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:36:58,188 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:36:58,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:36:58,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1616371930, now seen corresponding path program 6 times [2019-12-18 23:36:58,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:36:58,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932576950] [2019-12-18 23:36:58,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:36:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:36:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:36:58,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932576950] [2019-12-18 23:36:58,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057978459] [2019-12-18 23:36:58,553 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-18 23:37:00,991 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-18 23:37:00,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:37:00,996 INFO L264 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-18 23:37:01,001 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:37:01,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-12-18 23:37:01,006 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:37:01,007 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:37:01,007 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:37:01,007 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-18 23:37:01,033 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:37:01,034 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-18 23:37:01,034 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:37:01,051 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-18 23:37:01,051 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:37:01,052 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-12-18 23:37:01,082 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:37:01,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-18 23:37:01,083 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:37:01,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:37:01,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:37:01,088 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2019-12-18 23:37:01,150 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 13 treesize of output 9 [2019-12-18 23:37:01,150 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:37:01,162 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:37:01,162 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:37:01,162 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-12-18 23:37:01,202 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-18 23:37:01,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-18 23:37:01,203 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:37:01,213 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:37:01,214 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:37:01,214 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-12-18 23:37:01,294 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-18 23:37:01,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-12-18 23:37:01,294 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:37:01,308 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:37:01,308 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:37:01,309 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-12-18 23:37:01,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:37:01,505 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:37:01,535 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:37:01,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 109 [2019-12-18 23:37:01,536 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:37:01,598 INFO L614 ElimStorePlain]: treesize reduction 60, result has 49.2 percent of original size [2019-12-18 23:37:01,598 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:37:01,599 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:44 [2019-12-18 23:37:01,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:37:01,642 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:37:01,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-12-18 23:37:01,644 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:37:01,674 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:37:01,675 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:37:01,676 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:35 [2019-12-18 23:37:01,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2019-12-18 23:37:01,842 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:37:01,854 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:37:01,855 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:37:01,855 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:29 [2019-12-18 23:37:02,040 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-18 23:37:02,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-12-18 23:37:02,064 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:37:02,075 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:37:02,077 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:37:02,077 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:44, output treesize:21 [2019-12-18 23:37:02,321 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:37:02,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 67 [2019-12-18 23:37:02,322 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:37:02,350 INFO L614 ElimStorePlain]: treesize reduction 30, result has 53.8 percent of original size [2019-12-18 23:37:02,351 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:37:02,352 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:21 [2019-12-18 23:37:02,369 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-18 23:37:02,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-12-18 23:37:02,371 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:37:02,381 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:37:02,381 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:37:02,382 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:21 [2019-12-18 23:37:02,389 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-12-18 23:37:02,390 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:37:02,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:37:02,395 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-18 23:37:02,395 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2019-12-18 23:37:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 310 proven. 19 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2019-12-18 23:37:02,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:37:02,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2019-12-18 23:37:02,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077094604] [2019-12-18 23:37:02,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-18 23:37:02,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:37:02,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-18 23:37:02,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1401, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 23:37:02,802 INFO L87 Difference]: Start difference. First operand 18146 states and 41376 transitions. Second operand 40 states. [2019-12-18 23:37:04,365 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-12-18 23:37:04,753 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-18 23:37:06,870 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-12-18 23:37:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:37:07,758 INFO L93 Difference]: Finished difference Result 24136 states and 55084 transitions. [2019-12-18 23:37:07,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-18 23:37:07,759 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 361 [2019-12-18 23:37:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:37:07,779 INFO L225 Difference]: With dead ends: 24136 [2019-12-18 23:37:07,780 INFO L226 Difference]: Without dead ends: 24136 [2019-12-18 23:37:07,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2119 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1592, Invalid=6598, Unknown=0, NotChecked=0, Total=8190 [2019-12-18 23:37:07,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24136 states. [2019-12-18 23:37:08,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24136 to 20782. [2019-12-18 23:37:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20782 states. [2019-12-18 23:37:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20782 states to 20782 states and 47449 transitions. [2019-12-18 23:37:08,078 INFO L78 Accepts]: Start accepts. Automaton has 20782 states and 47449 transitions. Word has length 361 [2019-12-18 23:37:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:37:08,079 INFO L462 AbstractCegarLoop]: Abstraction has 20782 states and 47449 transitions. [2019-12-18 23:37:08,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-18 23:37:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 20782 states and 47449 transitions. [2019-12-18 23:37:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-12-18 23:37:08,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:37:08,105 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 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, 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, 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, 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-18 23:37:08,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:37:08,306 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:37:08,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:37:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2042829257, now seen corresponding path program 7 times [2019-12-18 23:37:08,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:37:08,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675291768] [2019-12-18 23:37:08,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:37:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:37:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:37:08,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675291768] [2019-12-18 23:37:08,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910299166] [2019-12-18 23:37:08,733 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:37:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:37:08,912 INFO L264 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-18 23:37:08,918 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:37:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:37:09,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:37:09,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-12-18 23:37:09,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968812116] [2019-12-18 23:37:09,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:37:09,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:37:09,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:37:09,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:37:09,110 INFO L87 Difference]: Start difference. First operand 20782 states and 47449 transitions. Second operand 23 states. [2019-12-18 23:37:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:37:09,938 INFO L93 Difference]: Finished difference Result 27718 states and 63225 transitions. [2019-12-18 23:37:09,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 23:37:09,939 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 394 [2019-12-18 23:37:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:37:09,975 INFO L225 Difference]: With dead ends: 27718 [2019-12-18 23:37:09,975 INFO L226 Difference]: Without dead ends: 27718 [2019-12-18 23:37:09,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 23:37:10,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27718 states. [2019-12-18 23:37:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27718 to 24338. [2019-12-18 23:37:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24338 states. [2019-12-18 23:37:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24338 states to 24338 states and 55539 transitions. [2019-12-18 23:37:10,329 INFO L78 Accepts]: Start accepts. Automaton has 24338 states and 55539 transitions. Word has length 394 [2019-12-18 23:37:10,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:37:10,329 INFO L462 AbstractCegarLoop]: Abstraction has 24338 states and 55539 transitions. [2019-12-18 23:37:10,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:37:10,329 INFO L276 IsEmpty]: Start isEmpty. Operand 24338 states and 55539 transitions. [2019-12-18 23:37:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-12-18 23:37:10,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:37:10,360 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 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, 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, 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, 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-18 23:37:10,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:37:10,564 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:37:10,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:37:10,565 INFO L82 PathProgramCache]: Analyzing trace with hash -126761620, now seen corresponding path program 8 times [2019-12-18 23:37:10,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:37:10,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231578340] [2019-12-18 23:37:10,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:37:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:37:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:37:11,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231578340] [2019-12-18 23:37:11,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008245154] [2019-12-18 23:37:11,000 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:37:11,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:37:11,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:37:11,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-18 23:37:11,198 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:37:12,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:37:12,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:37:12,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-12-18 23:37:12,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158341471] [2019-12-18 23:37:12,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-18 23:37:12,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:37:12,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-18 23:37:12,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:37:12,134 INFO L87 Difference]: Start difference. First operand 24338 states and 55539 transitions. Second operand 25 states. [2019-12-18 23:37:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:37:12,608 INFO L93 Difference]: Finished difference Result 31310 states and 71389 transitions. [2019-12-18 23:37:12,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 23:37:12,609 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 427 [2019-12-18 23:37:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:37:12,637 INFO L225 Difference]: With dead ends: 31310 [2019-12-18 23:37:12,638 INFO L226 Difference]: Without dead ends: 31310 [2019-12-18 23:37:12,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=631, Invalid=1349, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 23:37:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31310 states. [2019-12-18 23:37:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31310 to 27930. [2019-12-18 23:37:12,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27930 states. [2019-12-18 23:37:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27930 states to 27930 states and 63703 transitions. [2019-12-18 23:37:12,999 INFO L78 Accepts]: Start accepts. Automaton has 27930 states and 63703 transitions. Word has length 427 [2019-12-18 23:37:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:37:13,000 INFO L462 AbstractCegarLoop]: Abstraction has 27930 states and 63703 transitions. [2019-12-18 23:37:13,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-18 23:37:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 27930 states and 63703 transitions. [2019-12-18 23:37:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-12-18 23:37:13,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:37:13,035 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 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, 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, 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, 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-18 23:37:13,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:37:13,239 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:37:13,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:37:13,240 INFO L82 PathProgramCache]: Analyzing trace with hash -265789225, now seen corresponding path program 9 times [2019-12-18 23:37:13,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:37:13,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463042013] [2019-12-18 23:37:13,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:37:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:37:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 0 proven. 1670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:37:13,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463042013] [2019-12-18 23:37:13,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580202884] [2019-12-18 23:37:13,962 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:38:16,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-18 23:38:16,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:38:16,428 INFO L264 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 124 conjunts are in the unsatisfiable core [2019-12-18 23:38:16,436 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:38:16,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-12-18 23:38:16,453 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:16,456 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:16,456 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:38:16,456 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-18 23:38:16,478 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:16,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-18 23:38:16,479 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:16,483 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:16,483 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:38:16,484 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-18 23:38:16,644 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-18 23:38:16,644 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:16,651 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:16,651 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:38:16,652 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-18 23:38:16,711 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-18 23:38:16,711 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:16,722 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:16,723 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:38:16,723 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-18 23:38:16,908 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:38:16,924 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:16,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:38:16,926 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:16,969 INFO L614 ElimStorePlain]: treesize reduction 26, result has 55.2 percent of original size [2019-12-18 23:38:16,970 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-18 23:38:16,970 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:23 [2019-12-18 23:38:17,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:38:17,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 23:38:17,025 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:17,045 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:17,046 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-18 23:38:17,046 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-18 23:38:17,154 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 31 treesize of output 15 [2019-12-18 23:38:17,155 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:17,161 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:17,161 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:38:17,161 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2019-12-18 23:38:17,201 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-18 23:38:17,202 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:17,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:17,211 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:38:17,211 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-18 23:38:17,342 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:38:17,355 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:17,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:38:17,356 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:17,393 INFO L614 ElimStorePlain]: treesize reduction 26, result has 55.2 percent of original size [2019-12-18 23:38:17,394 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-18 23:38:17,394 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:23 [2019-12-18 23:38:17,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:38:17,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 23:38:17,429 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:17,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:17,443 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-18 23:38:17,444 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-18 23:38:17,673 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-12-18 23:38:17,680 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 31 treesize of output 15 [2019-12-18 23:38:17,681 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:17,688 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:17,688 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:38:17,689 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2019-12-18 23:38:17,728 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-18 23:38:17,728 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:17,736 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:17,737 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:38:17,737 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-18 23:38:17,873 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:38:17,887 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:17,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:38:17,888 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:17,917 INFO L614 ElimStorePlain]: treesize reduction 26, result has 55.2 percent of original size [2019-12-18 23:38:17,918 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-18 23:38:17,918 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:23 [2019-12-18 23:38:17,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:38:17,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-18 23:38:17,964 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:17,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:17,979 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-18 23:38:17,980 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-18 23:38:18,169 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 31 treesize of output 15 [2019-12-18 23:38:18,169 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:18,175 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:18,176 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:38:18,176 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2019-12-18 23:38:18,218 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-18 23:38:18,219 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:18,228 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:18,229 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-18 23:38:18,229 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:13 [2019-12-18 23:38:18,412 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:38:18,426 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:18,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:38:18,427 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:18,453 INFO L614 ElimStorePlain]: treesize reduction 26, result has 51.9 percent of original size [2019-12-18 23:38:18,453 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-18 23:38:18,454 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2019-12-18 23:38:18,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:38:18,500 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-18 23:38:18,500 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:18,513 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:18,513 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-18 23:38:18,513 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2019-12-18 23:38:18,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2019-12-18 23:38:18,521 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:38:18,525 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:38:18,526 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:38:18,526 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2019-12-18 23:38:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 1132 proven. 287 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-12-18 23:38:18,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:38:18,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2019-12-18 23:38:18,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901650950] [2019-12-18 23:38:18,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-12-18 23:38:18,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:38:18,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-12-18 23:38:18,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=2779, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 23:38:18,917 INFO L87 Difference]: Start difference. First operand 27930 states and 63703 transitions. Second operand 56 states. [2019-12-18 23:38:37,832 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-12-18 23:38:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:38:47,818 INFO L93 Difference]: Finished difference Result 45194 states and 103337 transitions. [2019-12-18 23:38:47,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 353 states. [2019-12-18 23:38:47,819 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 460 [2019-12-18 23:38:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:38:47,853 INFO L225 Difference]: With dead ends: 45194 [2019-12-18 23:38:47,853 INFO L226 Difference]: Without dead ends: 45194 [2019-12-18 23:38:47,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1126 GetRequests, 717 SyntacticMatches, 5 SemanticMatches, 404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70339 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=17303, Invalid=147127, Unknown=0, NotChecked=0, Total=164430 [2019-12-18 23:38:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45194 states. [2019-12-18 23:38:48,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45194 to 20536. [2019-12-18 23:38:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20536 states. [2019-12-18 23:38:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20536 states to 20536 states and 46511 transitions. [2019-12-18 23:38:48,167 INFO L78 Accepts]: Start accepts. Automaton has 20536 states and 46511 transitions. Word has length 460 [2019-12-18 23:38:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:38:48,168 INFO L462 AbstractCegarLoop]: Abstraction has 20536 states and 46511 transitions. [2019-12-18 23:38:48,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-12-18 23:38:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 20536 states and 46511 transitions. [2019-12-18 23:38:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-12-18 23:38:48,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:38:48,188 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 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, 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, 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, 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-18 23:38:48,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:38:48,389 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:38:48,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:38:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash -415367242, now seen corresponding path program 10 times [2019-12-18 23:38:48,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:38:48,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842057696] [2019-12-18 23:38:48,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:38:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:38:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:38:49,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842057696] [2019-12-18 23:38:49,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76240138] [2019-12-18 23:38:49,057 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:38:53,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:38:53,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:38:53,207 INFO L264 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-18 23:38:53,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:38:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:38:53,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:38:53,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-12-18 23:38:53,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426893794] [2019-12-18 23:38:53,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-18 23:38:53,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:38:53,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-18 23:38:53,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:38:53,369 INFO L87 Difference]: Start difference. First operand 20536 states and 46511 transitions. Second operand 29 states. [2019-12-18 23:38:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:38:54,061 INFO L93 Difference]: Finished difference Result 24280 states and 54959 transitions. [2019-12-18 23:38:54,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 23:38:54,062 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 493 [2019-12-18 23:38:54,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:38:54,085 INFO L225 Difference]: With dead ends: 24280 [2019-12-18 23:38:54,085 INFO L226 Difference]: Without dead ends: 24280 [2019-12-18 23:38:54,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1881, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 23:38:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24280 states. [2019-12-18 23:38:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24280 to 22468. [2019-12-18 23:38:54,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22468 states. [2019-12-18 23:38:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22468 states to 22468 states and 50870 transitions. [2019-12-18 23:38:54,349 INFO L78 Accepts]: Start accepts. Automaton has 22468 states and 50870 transitions. Word has length 493 [2019-12-18 23:38:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:38:54,350 INFO L462 AbstractCegarLoop]: Abstraction has 22468 states and 50870 transitions. [2019-12-18 23:38:54,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-18 23:38:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 22468 states and 50870 transitions. [2019-12-18 23:38:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-12-18 23:38:54,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:38:54,372 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 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, 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, 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, 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-18 23:38:54,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:38:54,572 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:38:54,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:38:54,573 INFO L82 PathProgramCache]: Analyzing trace with hash -394651699, now seen corresponding path program 11 times [2019-12-18 23:38:54,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:38:54,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659982093] [2019-12-18 23:38:54,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:38:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:38:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 0 proven. 2395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:38:55,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659982093] [2019-12-18 23:38:55,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940668413] [2019-12-18 23:38:55,313 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:39:01,718 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-12-18 23:39:01,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:39:01,735 INFO L264 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 212 conjunts are in the unsatisfiable core [2019-12-18 23:39:01,743 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:39:01,840 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 13 treesize of output 9 [2019-12-18 23:39:01,840 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:01,843 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:01,843 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:39:01,844 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-18 23:39:01,889 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:01,889 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 25 treesize of output 62 [2019-12-18 23:39:01,890 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:01,917 INFO L614 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2019-12-18 23:39:01,918 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:01,918 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2019-12-18 23:39:01,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:01,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:02,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:02,206 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:39:02,208 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:39:02,227 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:02,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:39:02,228 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:02,252 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:02,252 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 25 treesize of output 54 [2019-12-18 23:39:02,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:02,253 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:02,348 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-18 23:39:02,349 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:02,350 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-18 23:39:02,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:02,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:02,396 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-18 23:39:02,397 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:02,403 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 15 treesize of output 11 [2019-12-18 23:39:02,403 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:02,436 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:02,437 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:02,437 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-18 23:39:02,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:02,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:02,743 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 32 treesize of output 16 [2019-12-18 23:39:02,744 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:02,749 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 0 case distinctions, treesize of input 41 treesize of output 19 [2019-12-18 23:39:02,749 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:02,765 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:02,766 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:02,766 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:44 [2019-12-18 23:39:02,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:02,852 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:02,853 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 25 treesize of output 62 [2019-12-18 23:39:02,853 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:02,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:02,861 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 26 treesize of output 25 [2019-12-18 23:39:02,861 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:02,929 INFO L614 ElimStorePlain]: treesize reduction 23, result has 78.1 percent of original size [2019-12-18 23:39:02,930 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 23:39:02,930 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:58 [2019-12-18 23:39:02,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-18 23:39:03,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:03,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:03,347 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:03,348 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 21 treesize of output 46 [2019-12-18 23:39:03,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:03,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:03,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:03,350 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:39:03,359 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:39:03,373 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:03,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:39:03,374 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:03,457 INFO L614 ElimStorePlain]: treesize reduction 67, result has 55.6 percent of original size [2019-12-18 23:39:03,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:03,457 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-18 23:39:03,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:03,522 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 15 treesize of output 11 [2019-12-18 23:39:03,522 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:03,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:03,534 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-18 23:39:03,535 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:03,575 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:03,575 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:03,575 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 23:39:03,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:03,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:03,941 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 32 treesize of output 16 [2019-12-18 23:39:03,941 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:03,951 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 0 case distinctions, treesize of input 41 treesize of output 19 [2019-12-18 23:39:03,951 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:03,984 INFO L614 ElimStorePlain]: treesize reduction 11, result has 80.4 percent of original size [2019-12-18 23:39:03,984 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:03,984 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:45 [2019-12-18 23:39:04,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:04,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:04,088 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 25 treesize of output 62 [2019-12-18 23:39:04,089 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:04,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:04,098 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 26 treesize of output 25 [2019-12-18 23:39:04,099 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:04,168 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-18 23:39:04,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 23:39:04,169 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2019-12-18 23:39:04,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-18 23:39:04,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:04,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:04,679 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:04,679 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 21 treesize of output 46 [2019-12-18 23:39:04,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:04,681 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:39:04,688 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:39:04,704 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:04,705 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:39:04,705 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:04,782 INFO L614 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2019-12-18 23:39:04,783 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:04,784 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-18 23:39:04,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:04,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:04,864 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-18 23:39:04,865 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:04,872 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 15 treesize of output 11 [2019-12-18 23:39:04,872 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:04,906 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:04,907 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:04,907 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 23:39:05,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:05,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:05,335 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 41 treesize of output 19 [2019-12-18 23:39:05,335 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:05,341 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 0 case distinctions, treesize of input 32 treesize of output 16 [2019-12-18 23:39:05,342 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:05,376 INFO L614 ElimStorePlain]: treesize reduction 11, result has 80.4 percent of original size [2019-12-18 23:39:05,377 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:05,377 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:45 [2019-12-18 23:39:05,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:05,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:05,471 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 26 treesize of output 25 [2019-12-18 23:39:05,472 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:05,503 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:05,503 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 25 treesize of output 62 [2019-12-18 23:39:05,504 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:05,571 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-18 23:39:05,571 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 23:39:05,572 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2019-12-18 23:39:05,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-18 23:39:05,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:06,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:06,227 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:39:06,229 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:39:06,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:06,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:39:06,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:06,268 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:06,268 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 21 treesize of output 46 [2019-12-18 23:39:06,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:06,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:06,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:06,270 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-18 23:39:06,356 INFO L614 ElimStorePlain]: treesize reduction 67, result has 55.6 percent of original size [2019-12-18 23:39:06,356 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:06,356 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-18 23:39:06,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:06,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:06,445 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-18 23:39:06,446 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:06,453 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 15 treesize of output 11 [2019-12-18 23:39:06,453 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:06,488 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:06,488 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:06,489 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 23:39:06,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:06,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:06,977 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 41 treesize of output 19 [2019-12-18 23:39:06,977 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:06,981 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 0 case distinctions, treesize of input 32 treesize of output 16 [2019-12-18 23:39:06,982 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:06,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:06,997 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:06,998 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:45 [2019-12-18 23:39:07,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:07,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:07,124 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 25 treesize of output 62 [2019-12-18 23:39:07,125 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:07,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:07,135 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 26 treesize of output 25 [2019-12-18 23:39:07,136 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:07,203 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-18 23:39:07,204 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 23:39:07,204 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2019-12-18 23:39:07,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-18 23:39:07,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:07,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:07,807 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:39:07,809 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:39:07,825 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:07,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:39:07,826 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:07,846 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:07,847 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 21 treesize of output 46 [2019-12-18 23:39:07,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:07,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:07,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:07,849 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-18 23:39:07,936 INFO L614 ElimStorePlain]: treesize reduction 67, result has 55.6 percent of original size [2019-12-18 23:39:07,937 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:07,937 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-18 23:39:08,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:08,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:08,036 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-18 23:39:08,037 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:08,042 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 15 treesize of output 11 [2019-12-18 23:39:08,043 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:08,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:08,077 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:39:08,078 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 23:39:08,391 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 0 case distinctions, treesize of input 23 treesize of output 13 [2019-12-18 23:39:08,392 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:08,402 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:08,403 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:39:08,403 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-18 23:39:08,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:08,491 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-18 23:39:08,492 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:08,511 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:08,511 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-18 23:39:08,511 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-18 23:39:09,208 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:39:09,223 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:09,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:39:09,224 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:09,275 INFO L614 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2019-12-18 23:39:09,276 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:39:09,276 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 23:39:09,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:09,392 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-18 23:39:09,393 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:09,409 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:09,410 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-18 23:39:09,410 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 23:39:09,690 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 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 23:39:09,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:09,704 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:09,705 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-18 23:39:09,705 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 23:39:09,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:09,793 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-18 23:39:09,793 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:09,806 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:09,806 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-18 23:39:09,807 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-18 23:39:10,380 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:39:10,392 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:10,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:39:10,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:10,394 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:10,448 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-18 23:39:10,448 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:39:10,449 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 23:39:10,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:10,584 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-18 23:39:10,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:10,602 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:10,602 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-18 23:39:10,603 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 23:39:11,647 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 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 23:39:11,648 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:11,663 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:11,663 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-18 23:39:11,663 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 23:39:11,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:11,765 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-18 23:39:11,765 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:11,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:11,778 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-18 23:39:11,779 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-18 23:39:12,391 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:39:12,405 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:12,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:39:12,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:12,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:12,454 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-18 23:39:12,455 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:39:12,455 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 23:39:12,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:12,584 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-18 23:39:12,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:12,603 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:12,603 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-18 23:39:12,604 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 23:39:13,198 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 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 23:39:13,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:13,211 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:13,212 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-18 23:39:13,212 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 23:39:13,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:13,324 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-18 23:39:13,324 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:13,336 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:13,337 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-18 23:39:13,337 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-18 23:39:14,014 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:39:14,028 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:14,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:39:14,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:14,029 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:14,076 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-18 23:39:14,076 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:39:14,076 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 23:39:14,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:14,220 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-18 23:39:14,220 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:14,238 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:14,238 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-18 23:39:14,238 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 23:39:14,577 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 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 23:39:14,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:14,591 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:14,592 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-18 23:39:14,592 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 23:39:14,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:39:14,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, 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-18 23:39:14,720 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:14,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:14,735 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:39:14,735 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-18 23:39:15,151 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:15,152 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 34 treesize of output 57 [2019-12-18 23:39:15,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:39:15,153 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:15,177 INFO L614 ElimStorePlain]: treesize reduction 35, result has 46.2 percent of original size [2019-12-18 23:39:15,178 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:39:15,178 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-12-18 23:39:15,201 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-18 23:39:15,202 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 25 treesize of output 24 [2019-12-18 23:39:15,202 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:15,208 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:15,208 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-18 23:39:15,209 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-12-18 23:39:15,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2019-12-18 23:39:15,214 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:39:15,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:39:15,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:39:15,220 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-18 23:39:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 1564 proven. 817 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-18 23:39:16,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:39:16,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 97] total 124 [2019-12-18 23:39:16,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094656502] [2019-12-18 23:39:16,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-12-18 23:39:16,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:39:16,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-12-18 23:39:16,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1356, Invalid=13896, Unknown=0, NotChecked=0, Total=15252 [2019-12-18 23:39:16,657 INFO L87 Difference]: Start difference. First operand 22468 states and 50870 transitions. Second operand 124 states. [2019-12-18 23:39:21,870 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-18 23:39:25,739 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-18 23:39:29,341 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-12-18 23:39:30,671 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-18 23:39:36,112 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-12-18 23:39:42,711 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-12-18 23:39:47,656 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-18 23:39:50,497 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-12-18 23:39:51,524 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-12-18 23:39:52,278 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-12-18 23:39:53,285 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-12-18 23:39:55,957 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 Received shutdown request... [2019-12-18 23:40:00,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 327 states. [2019-12-18 23:40:00,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:40:00,789 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 23:40:00,796 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 23:40:00,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:40:00 BasicIcfg [2019-12-18 23:40:00,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:40:00,799 INFO L168 Benchmark]: Toolchain (without parser) took 254685.05 ms. Allocated memory was 144.7 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 100.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 23:40:00,799 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 23:40:00,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 969.67 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.4 MB in the beginning and 130.4 MB in the end (delta: -30.0 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2019-12-18 23:40:00,800 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.15 ms. Allocated memory is still 202.4 MB. Free memory was 130.4 MB in the beginning and 127.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:40:00,800 INFO L168 Benchmark]: Boogie Preprocessor took 44.34 ms. Allocated memory is still 202.4 MB. Free memory was 127.6 MB in the beginning and 125.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 23:40:00,801 INFO L168 Benchmark]: RCFGBuilder took 787.28 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 125.5 MB in the beginning and 200.6 MB in the end (delta: -75.1 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-18 23:40:00,801 INFO L168 Benchmark]: TraceAbstraction took 252769.34 ms. Allocated memory was 234.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 200.6 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 23:40:00,803 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 969.67 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.4 MB in the beginning and 130.4 MB in the end (delta: -30.0 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 109.15 ms. Allocated memory is still 202.4 MB. Free memory was 130.4 MB in the beginning and 127.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.34 ms. Allocated memory is still 202.4 MB. Free memory was 127.6 MB in the beginning and 125.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 787.28 ms. Allocated memory was 202.4 MB in the beginning and 234.4 MB in the end (delta: 32.0 MB). Free memory was 125.5 MB in the beginning and 200.6 MB in the end (delta: -75.1 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252769.34 ms. Allocated memory was 234.4 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 200.6 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (22468states) and FLOYD_HOARE automaton (currently 327 states, 124 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 448 known predicates. - TimeoutResultAtElement [Line: 1014]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (22468states) and FLOYD_HOARE automaton (currently 327 states, 124 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 448 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 190 locations, 2 error locations. Result: TIMEOUT, OverallTime: 252.5s, OverallIterations: 19, TraceHistogramMax: 13, AutomataDifference: 131.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4272 SDtfs, 56893 SDslu, 54592 SDs, 0 SdLazy, 26029 SolverSat, 6201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7235 GetRequests, 5382 SyntacticMatches, 41 SemanticMatches, 1811 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252123 ImplicationChecksByTransitivity, 113.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27930occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 55231 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 77.2s SatisfiabilityAnalysisTime, 32.1s InterpolantComputationTime, 9422 NumberOfCodeBlocks, 8953 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 9389 ConstructedInterpolants, 60 QuantifiedInterpolants, 18813176 SizeOfPredicates, 449 NumberOfNonLiveVariables, 7534 ConjunctsInSsa, 755 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 4479/22158 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown