/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:38:09,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:38:09,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:38:10,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:38:10,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:38:10,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:38:10,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:38:10,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:38:10,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:38:10,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:38:10,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:38:10,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:38:10,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:38:10,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:38:10,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:38:10,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:38:10,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:38:10,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:38:10,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:38:10,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:38:10,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:38:10,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:38:10,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:38:10,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:38:10,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:38:10,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:38:10,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:38:10,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:38:10,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:38:10,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:38:10,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:38:10,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:38:10,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:38:10,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:38:10,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:38:10,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:38:10,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:38:10,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:38:10,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:38:10,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:38:10,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:38:10,041 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-VariableLbe.epf [2019-12-18 19:38:10,064 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:38:10,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:38:10,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:38:10,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:38:10,069 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:38:10,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:38:10,069 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:38:10,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:38:10,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:38:10,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:38:10,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:38:10,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:38:10,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:38:10,070 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:38:10,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:38:10,071 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:38:10,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:38:10,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:38:10,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:38:10,072 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:38:10,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:38:10,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:38:10,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:38:10,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:38:10,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:38:10,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:38:10,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:38:10,073 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 19:38:10,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:38:10,074 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:38:10,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:38:10,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:38:10,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:38:10,350 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:38:10,350 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:38:10,351 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 19:38:10,431 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae3cda71/93573ff07ae04f1c8c4248ac7f8cc907/FLAG78d5b059f [2019-12-18 19:38:11,044 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:38:11,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2019-12-18 19:38:11,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae3cda71/93573ff07ae04f1c8c4248ac7f8cc907/FLAG78d5b059f [2019-12-18 19:38:11,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae3cda71/93573ff07ae04f1c8c4248ac7f8cc907 [2019-12-18 19:38:11,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:38:11,327 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:38:11,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:38:11,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:38:11,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:38:11,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:38:11" (1/1) ... [2019-12-18 19:38:11,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@255ab7a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:11, skipping insertion in model container [2019-12-18 19:38:11,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:38:11" (1/1) ... [2019-12-18 19:38:11,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:38:11,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:38:11,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:38:11,964 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:38:12,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:38:12,275 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:38:12,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:12 WrapperNode [2019-12-18 19:38:12,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:38:12,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:38:12,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:38:12,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:38:12,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:12" (1/1) ... [2019-12-18 19:38:12,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:12" (1/1) ... [2019-12-18 19:38:12,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:38:12,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:38:12,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:38:12,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:38:12,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:12" (1/1) ... [2019-12-18 19:38:12,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:12" (1/1) ... [2019-12-18 19:38:12,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:12" (1/1) ... [2019-12-18 19:38:12,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:12" (1/1) ... [2019-12-18 19:38:12,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:12" (1/1) ... [2019-12-18 19:38:12,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:12" (1/1) ... [2019-12-18 19:38:12,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:12" (1/1) ... [2019-12-18 19:38:12,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:38:12,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:38:12,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:38:12,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:38:12,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:12" (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 19:38:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-18 19:38:12,513 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-18 19:38:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-18 19:38:12,513 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-18 19:38:12,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:38:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:38:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 19:38:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:38:12,514 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-18 19:38:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 19:38:12,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:38:12,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:38:12,517 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 19:38:13,164 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:38:13,165 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-18 19:38:13,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:38:13 BoogieIcfgContainer [2019-12-18 19:38:13,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:38:13,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:38:13,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:38:13,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:38:13,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:38:11" (1/3) ... [2019-12-18 19:38:13,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ca4b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:38:13, skipping insertion in model container [2019-12-18 19:38:13,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:38:12" (2/3) ... [2019-12-18 19:38:13,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ca4b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:38:13, skipping insertion in model container [2019-12-18 19:38:13,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:38:13" (3/3) ... [2019-12-18 19:38:13,175 INFO L109 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2019-12-18 19:38:13,185 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:38:13,185 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:38:13,192 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:38:13,193 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:38:13,230 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,230 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,231 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,231 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,231 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,232 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,232 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,232 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,232 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,233 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,233 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,233 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,233 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,234 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,234 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,234 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,234 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,234 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,235 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,235 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,235 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,235 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,235 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,235 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,236 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,236 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,236 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,236 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,236 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,236 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,237 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,237 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,237 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,237 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,237 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,238 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,238 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,238 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,238 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,238 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,239 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,239 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,239 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,239 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,239 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,240 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,240 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,240 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,240 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,240 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,241 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,241 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,241 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,241 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,241 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,242 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,242 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,242 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,242 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,242 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,243 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,243 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,243 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,243 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,243 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,244 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,244 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,244 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,244 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,244 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,245 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,245 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,245 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,245 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,245 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,246 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,246 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,246 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,246 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,246 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,247 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,247 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,247 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,247 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,247 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,248 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,249 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,249 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,249 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,249 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,250 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,250 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,250 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,250 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,251 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,251 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,251 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,251 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,252 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,252 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,252 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,252 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,252 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,252 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,253 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,253 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,253 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,253 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,253 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,254 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,254 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,254 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,254 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,254 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,255 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,255 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,255 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,255 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,255 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,256 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,256 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,256 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,256 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,256 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,256 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,257 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,257 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,257 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,257 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,257 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,258 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,258 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,258 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,258 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,258 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,259 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,259 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,259 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,259 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,259 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,259 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,260 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,260 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,260 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,260 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,260 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,260 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,261 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,261 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,261 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,261 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,261 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,261 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,261 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,262 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,262 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,262 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,262 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,262 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,262 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,263 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,263 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,263 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,263 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,263 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,264 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,264 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,264 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,264 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,264 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,264 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,265 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,265 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,265 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,265 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,265 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,266 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,266 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,266 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,266 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,266 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,266 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,267 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,267 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,267 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,267 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,267 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,268 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,268 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,268 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,268 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,268 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,268 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,269 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,269 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,269 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,269 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,269 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,269 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,270 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,270 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,270 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,270 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,271 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,271 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,271 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,271 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,271 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,271 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,272 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,272 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,272 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,276 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,276 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,276 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,276 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,277 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,277 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,277 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,277 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,277 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,277 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,278 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,278 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,278 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,278 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,278 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,279 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,279 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,279 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,279 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,279 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,279 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,280 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,280 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,285 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,286 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,286 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,286 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,286 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,286 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,287 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,287 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,287 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,287 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,287 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,287 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,288 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,288 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,288 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,288 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,288 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,289 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,289 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,289 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,289 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,289 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,290 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,290 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,290 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,290 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,290 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,291 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,291 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,291 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,291 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:38:13,315 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 19:38:13,335 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:38:13,336 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:38:13,336 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:38:13,336 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:38:13,336 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:38:13,336 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:38:13,336 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:38:13,336 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:38:13,353 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 204 transitions [2019-12-18 19:38:13,355 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 204 transitions [2019-12-18 19:38:13,440 INFO L126 PetriNetUnfolder]: 14/204 cut-off events. [2019-12-18 19:38:13,440 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:38:13,461 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 204 events. 14/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs. 19/208 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2019-12-18 19:38:13,479 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 204 transitions [2019-12-18 19:38:13,563 INFO L126 PetriNetUnfolder]: 14/204 cut-off events. [2019-12-18 19:38:13,564 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:38:13,571 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 204 events. 14/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs. 19/208 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2019-12-18 19:38:13,584 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 9440 [2019-12-18 19:38:13,585 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 19:38:16,340 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-18 19:38:16,977 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-12-18 19:38:17,280 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 79 [2019-12-18 19:38:17,741 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-12-18 19:38:17,956 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-12-18 19:38:18,853 WARN L192 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 149 [2019-12-18 19:38:19,649 WARN L192 SmtUtils]: Spent 793.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-12-18 19:38:19,669 INFO L206 etLargeBlockEncoding]: Checked pairs total: 18406 [2019-12-18 19:38:19,670 INFO L214 etLargeBlockEncoding]: Total number of compositions: 174 [2019-12-18 19:38:19,673 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 55 transitions [2019-12-18 19:38:19,723 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 716 states. [2019-12-18 19:38:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states. [2019-12-18 19:38:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-18 19:38:19,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:19,732 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-18 19:38:19,732 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:38:19,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:19,739 INFO L82 PathProgramCache]: Analyzing trace with hash 805, now seen corresponding path program 1 times [2019-12-18 19:38:19,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:19,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246774389] [2019-12-18 19:38:19,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:19,861 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 19:38:19,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246774389] [2019-12-18 19:38:19,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:19,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-18 19:38:19,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482389207] [2019-12-18 19:38:19,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-18 19:38:19,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:19,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-18 19:38:19,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 19:38:19,886 INFO L87 Difference]: Start difference. First operand 716 states. Second operand 2 states. [2019-12-18 19:38:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:19,936 INFO L93 Difference]: Finished difference Result 715 states and 1901 transitions. [2019-12-18 19:38:19,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 19:38:19,937 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-18 19:38:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:19,966 INFO L225 Difference]: With dead ends: 715 [2019-12-18 19:38:19,966 INFO L226 Difference]: Without dead ends: 524 [2019-12-18 19:38:19,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 19:38:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-12-18 19:38:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2019-12-18 19:38:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-12-18 19:38:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1400 transitions. [2019-12-18 19:38:20,080 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1400 transitions. Word has length 1 [2019-12-18 19:38:20,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:20,080 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 1400 transitions. [2019-12-18 19:38:20,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-18 19:38:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1400 transitions. [2019-12-18 19:38:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:38:20,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:20,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:20,085 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:38:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:20,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1723444997, now seen corresponding path program 1 times [2019-12-18 19:38:20,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:20,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027515309] [2019-12-18 19:38:20,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:20,235 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 19:38:20,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027515309] [2019-12-18 19:38:20,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:20,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:38:20,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800765734] [2019-12-18 19:38:20,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:38:20,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:20,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:38:20,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:38:20,239 INFO L87 Difference]: Start difference. First operand 524 states and 1400 transitions. Second operand 3 states. [2019-12-18 19:38:20,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:20,254 INFO L93 Difference]: Finished difference Result 236 states and 509 transitions. [2019-12-18 19:38:20,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:38:20,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 19:38:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:20,279 INFO L225 Difference]: With dead ends: 236 [2019-12-18 19:38:20,279 INFO L226 Difference]: Without dead ends: 212 [2019-12-18 19:38:20,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:38:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-12-18 19:38:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2019-12-18 19:38:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-12-18 19:38:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 464 transitions. [2019-12-18 19:38:20,302 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 464 transitions. Word has length 15 [2019-12-18 19:38:20,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:20,302 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 464 transitions. [2019-12-18 19:38:20,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:38:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 464 transitions. [2019-12-18 19:38:20,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:38:20,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:20,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:20,307 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:38:20,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:20,311 INFO L82 PathProgramCache]: Analyzing trace with hash -934045596, now seen corresponding path program 1 times [2019-12-18 19:38:20,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:20,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891381725] [2019-12-18 19:38:20,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:20,416 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 19:38:20,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891381725] [2019-12-18 19:38:20,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:20,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:38:20,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920200528] [2019-12-18 19:38:20,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:38:20,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:20,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:38:20,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:38:20,418 INFO L87 Difference]: Start difference. First operand 212 states and 464 transitions. Second operand 3 states. [2019-12-18 19:38:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:20,437 INFO L93 Difference]: Finished difference Result 272 states and 590 transitions. [2019-12-18 19:38:20,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:38:20,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 19:38:20,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:20,440 INFO L225 Difference]: With dead ends: 272 [2019-12-18 19:38:20,440 INFO L226 Difference]: Without dead ends: 272 [2019-12-18 19:38:20,441 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 19:38:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-18 19:38:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 218. [2019-12-18 19:38:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-12-18 19:38:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 476 transitions. [2019-12-18 19:38:20,455 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 476 transitions. Word has length 19 [2019-12-18 19:38:20,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:20,455 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 476 transitions. [2019-12-18 19:38:20,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:38:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 476 transitions. [2019-12-18 19:38:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 19:38:20,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:20,457 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] [2019-12-18 19:38:20,458 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:38:20,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:20,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1942532503, now seen corresponding path program 1 times [2019-12-18 19:38:20,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:20,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797575225] [2019-12-18 19:38:20,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:20,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 19:38:20,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797575225] [2019-12-18 19:38:20,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:38:20,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:38:20,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867854011] [2019-12-18 19:38:20,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:38:20,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:20,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:38:20,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:38:20,546 INFO L87 Difference]: Start difference. First operand 218 states and 476 transitions. Second operand 3 states. [2019-12-18 19:38:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:20,588 INFO L93 Difference]: Finished difference Result 166 states and 334 transitions. [2019-12-18 19:38:20,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:38:20,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 19:38:20,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:20,591 INFO L225 Difference]: With dead ends: 166 [2019-12-18 19:38:20,591 INFO L226 Difference]: Without dead ends: 164 [2019-12-18 19:38:20,591 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 19:38:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-18 19:38:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-12-18 19:38:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-18 19:38:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 331 transitions. [2019-12-18 19:38:20,597 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 331 transitions. Word has length 26 [2019-12-18 19:38:20,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:20,598 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 331 transitions. [2019-12-18 19:38:20,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:38:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 331 transitions. [2019-12-18 19:38:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 19:38:20,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:20,599 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] [2019-12-18 19:38:20,599 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:38:20,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:20,600 INFO L82 PathProgramCache]: Analyzing trace with hash 725656941, now seen corresponding path program 1 times [2019-12-18 19:38:20,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:20,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255856297] [2019-12-18 19:38:20,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:20,699 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 19:38:20,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255856297] [2019-12-18 19:38:20,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74902335] [2019-12-18 19:38:20,700 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 19:38:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:20,827 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-18 19:38:20,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:38:20,858 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 19:38:20,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:38:20,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-18 19:38:20,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844008595] [2019-12-18 19:38:20,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:38:20,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:20,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:38:20,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:38:20,863 INFO L87 Difference]: Start difference. First operand 164 states and 331 transitions. Second operand 5 states. [2019-12-18 19:38:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:20,905 INFO L93 Difference]: Finished difference Result 240 states and 472 transitions. [2019-12-18 19:38:20,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:38:20,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 19:38:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:20,909 INFO L225 Difference]: With dead ends: 240 [2019-12-18 19:38:20,909 INFO L226 Difference]: Without dead ends: 240 [2019-12-18 19:38:20,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:38:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-12-18 19:38:20,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 204. [2019-12-18 19:38:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-12-18 19:38:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 405 transitions. [2019-12-18 19:38:20,917 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 405 transitions. Word has length 27 [2019-12-18 19:38:20,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:20,918 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 405 transitions. [2019-12-18 19:38:20,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:38:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 405 transitions. [2019-12-18 19:38:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 19:38:20,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:20,919 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:21,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:38:21,123 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:38:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:21,124 INFO L82 PathProgramCache]: Analyzing trace with hash -396065166, now seen corresponding path program 2 times [2019-12-18 19:38:21,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:21,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768005654] [2019-12-18 19:38:21,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:21,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768005654] [2019-12-18 19:38:21,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458681785] [2019-12-18 19:38:21,231 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 19:38:21,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:38:21,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:38:21,368 INFO L264 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-18 19:38:21,371 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:38:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:21,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:38:21,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-18 19:38:21,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038132] [2019-12-18 19:38:21,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:38:21,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:21,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:38:21,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:38:21,388 INFO L87 Difference]: Start difference. First operand 204 states and 405 transitions. Second operand 6 states. [2019-12-18 19:38:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:21,440 INFO L93 Difference]: Finished difference Result 280 states and 546 transitions. [2019-12-18 19:38:21,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:38:21,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 19:38:21,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:21,444 INFO L225 Difference]: With dead ends: 280 [2019-12-18 19:38:21,444 INFO L226 Difference]: Without dead ends: 280 [2019-12-18 19:38:21,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:38:21,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-18 19:38:21,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 244. [2019-12-18 19:38:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-12-18 19:38:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 479 transitions. [2019-12-18 19:38:21,455 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 479 transitions. Word has length 34 [2019-12-18 19:38:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:21,456 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 479 transitions. [2019-12-18 19:38:21,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:38:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 479 transitions. [2019-12-18 19:38:21,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 19:38:21,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:21,460 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-12-18 19:38:21,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:38:21,664 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:38:21,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1648925235, now seen corresponding path program 3 times [2019-12-18 19:38:21,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:21,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575139342] [2019-12-18 19:38:21,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:21,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575139342] [2019-12-18 19:38:21,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531601355] [2019-12-18 19:38:21,781 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 19:38:22,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-18 19:38:22,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:38:22,155 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-18 19:38:22,157 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:38:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:22,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:38:22,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-18 19:38:22,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102849401] [2019-12-18 19:38:22,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:38:22,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:22,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:38:22,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:38:22,178 INFO L87 Difference]: Start difference. First operand 244 states and 479 transitions. Second operand 7 states. [2019-12-18 19:38:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:22,238 INFO L93 Difference]: Finished difference Result 320 states and 620 transitions. [2019-12-18 19:38:22,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:38:22,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 19:38:22,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:22,241 INFO L225 Difference]: With dead ends: 320 [2019-12-18 19:38:22,241 INFO L226 Difference]: Without dead ends: 320 [2019-12-18 19:38:22,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:38:22,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-18 19:38:22,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 284. [2019-12-18 19:38:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-12-18 19:38:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 553 transitions. [2019-12-18 19:38:22,251 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 553 transitions. Word has length 41 [2019-12-18 19:38:22,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:22,251 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 553 transitions. [2019-12-18 19:38:22,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:38:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 553 transitions. [2019-12-18 19:38:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 19:38:22,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:22,252 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:22,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:38:22,460 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:38:22,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:22,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1153000942, now seen corresponding path program 4 times [2019-12-18 19:38:22,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:22,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304533294] [2019-12-18 19:38:22,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:22,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304533294] [2019-12-18 19:38:22,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800266257] [2019-12-18 19:38:22,587 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 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 19:38:22,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:38:22,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:38:22,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:38:22,786 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:38:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:22,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:38:22,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-18 19:38:22,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009371556] [2019-12-18 19:38:22,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:38:22,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:22,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:38:22,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:38:22,804 INFO L87 Difference]: Start difference. First operand 284 states and 553 transitions. Second operand 8 states. [2019-12-18 19:38:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:22,861 INFO L93 Difference]: Finished difference Result 360 states and 694 transitions. [2019-12-18 19:38:22,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:38:22,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-12-18 19:38:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:22,864 INFO L225 Difference]: With dead ends: 360 [2019-12-18 19:38:22,864 INFO L226 Difference]: Without dead ends: 360 [2019-12-18 19:38:22,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:38:22,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-12-18 19:38:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 324. [2019-12-18 19:38:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-12-18 19:38:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 627 transitions. [2019-12-18 19:38:22,875 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 627 transitions. Word has length 48 [2019-12-18 19:38:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:22,875 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 627 transitions. [2019-12-18 19:38:22,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:38:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 627 transitions. [2019-12-18 19:38:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 19:38:22,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:22,877 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:23,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:38:23,090 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:38:23,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:23,090 INFO L82 PathProgramCache]: Analyzing trace with hash -878313939, now seen corresponding path program 5 times [2019-12-18 19:38:23,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:23,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126942449] [2019-12-18 19:38:23,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:23,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126942449] [2019-12-18 19:38:23,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788188925] [2019-12-18 19:38:23,227 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 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 19:38:23,354 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-18 19:38:23,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:38:23,356 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-18 19:38:23,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:38:23,439 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 19:38:23,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:23,442 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:23,443 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:38:23,443 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:9 [2019-12-18 19:38:23,480 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:23,481 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 19:38:23,481 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:23,514 INFO L614 ElimStorePlain]: treesize reduction 24, result has 62.5 percent of original size [2019-12-18 19:38:23,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:23,522 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 19:38:23,522 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:34 [2019-12-18 19:38:23,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:23,617 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:38:23,620 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:38:23,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:23,665 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 19:38:23,666 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:23,686 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:23,687 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 19:38:23,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:23,688 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:23,799 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-18 19:38:23,800 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-18 19:38:23,801 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 19:38:23,801 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-18 19:38:23,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:23,862 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 19:38:23,863 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:23,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:23,873 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 19:38:23,874 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:23,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:23,902 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 19:38:23,903 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 19:38:23,975 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 19:38:23,976 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:23,985 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:23,986 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:38:23,986 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-18 19:38:24,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:24,039 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 19:38:24,040 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:24,051 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:24,052 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 19:38:24,053 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-18 19:38:24,114 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:24,115 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 19:38:24,116 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:24,134 INFO L614 ElimStorePlain]: treesize reduction 30, result has 44.4 percent of original size [2019-12-18 19:38:24,135 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 19:38:24,135 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-12-18 19:38:24,165 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-18 19:38:24,166 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 19:38:24,167 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:24,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:24,173 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 19:38:24,173 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-12-18 19:38:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 63 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 19:38:24,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:38:24,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2019-12-18 19:38:24,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808477495] [2019-12-18 19:38:24,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 19:38:24,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:24,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 19:38:24,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-12-18 19:38:24,224 INFO L87 Difference]: Start difference. First operand 324 states and 627 transitions. Second operand 18 states. [2019-12-18 19:38:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:27,471 INFO L93 Difference]: Finished difference Result 1011 states and 1922 transitions. [2019-12-18 19:38:27,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-18 19:38:27,473 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2019-12-18 19:38:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:27,481 INFO L225 Difference]: With dead ends: 1011 [2019-12-18 19:38:27,481 INFO L226 Difference]: Without dead ends: 1011 [2019-12-18 19:38:27,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=843, Invalid=3063, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 19:38:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-12-18 19:38:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 640. [2019-12-18 19:38:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-18 19:38:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1212 transitions. [2019-12-18 19:38:27,506 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1212 transitions. Word has length 55 [2019-12-18 19:38:27,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:27,506 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1212 transitions. [2019-12-18 19:38:27,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 19:38:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1212 transitions. [2019-12-18 19:38:27,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 19:38:27,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:27,509 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:27,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:38:27,713 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:38:27,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:27,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1464768238, now seen corresponding path program 1 times [2019-12-18 19:38:27,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:27,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823641584] [2019-12-18 19:38:27,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:27,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823641584] [2019-12-18 19:38:27,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339448303] [2019-12-18 19:38:27,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 19:38:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:28,069 INFO L264 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:38:28,081 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:38:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:28,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:38:28,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-18 19:38:28,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496709931] [2019-12-18 19:38:28,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:38:28,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:28,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:38:28,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:38:28,102 INFO L87 Difference]: Start difference. First operand 640 states and 1212 transitions. Second operand 10 states. [2019-12-18 19:38:28,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:28,167 INFO L93 Difference]: Finished difference Result 828 states and 1557 transitions. [2019-12-18 19:38:28,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:38:28,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-18 19:38:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:28,172 INFO L225 Difference]: With dead ends: 828 [2019-12-18 19:38:28,172 INFO L226 Difference]: Without dead ends: 828 [2019-12-18 19:38:28,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:38:28,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-18 19:38:28,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 740. [2019-12-18 19:38:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-12-18 19:38:28,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1395 transitions. [2019-12-18 19:38:28,191 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1395 transitions. Word has length 64 [2019-12-18 19:38:28,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:28,191 INFO L462 AbstractCegarLoop]: Abstraction has 740 states and 1395 transitions. [2019-12-18 19:38:28,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:38:28,191 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1395 transitions. [2019-12-18 19:38:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 19:38:28,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:28,193 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:28,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:38:28,398 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:38:28,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash 319080191, now seen corresponding path program 2 times [2019-12-18 19:38:28,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:28,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880810891] [2019-12-18 19:38:28,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:28,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880810891] [2019-12-18 19:38:28,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082991279] [2019-12-18 19:38:28,528 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 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 19:38:28,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:38:28,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:38:28,737 INFO L264 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:38:28,741 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:38:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:28,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:38:28,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-18 19:38:28,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742809903] [2019-12-18 19:38:28,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:38:28,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:28,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:38:28,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:38:28,775 INFO L87 Difference]: Start difference. First operand 740 states and 1395 transitions. Second operand 11 states. [2019-12-18 19:38:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:28,857 INFO L93 Difference]: Finished difference Result 928 states and 1740 transitions. [2019-12-18 19:38:28,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 19:38:28,858 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2019-12-18 19:38:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:28,866 INFO L225 Difference]: With dead ends: 928 [2019-12-18 19:38:28,866 INFO L226 Difference]: Without dead ends: 928 [2019-12-18 19:38:28,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:38:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-12-18 19:38:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 840. [2019-12-18 19:38:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-18 19:38:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1578 transitions. [2019-12-18 19:38:28,899 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1578 transitions. Word has length 71 [2019-12-18 19:38:28,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:28,899 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1578 transitions. [2019-12-18 19:38:28,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:38:28,900 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1578 transitions. [2019-12-18 19:38:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-18 19:38:28,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:28,903 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:29,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:38:29,106 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:38:29,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1147405811, now seen corresponding path program 3 times [2019-12-18 19:38:29,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:29,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936024048] [2019-12-18 19:38:29,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:29,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936024048] [2019-12-18 19:38:29,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84096781] [2019-12-18 19:38:29,286 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 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 19:38:30,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-18 19:38:30,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:38:30,532 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 71 conjunts are in the unsatisfiable core [2019-12-18 19:38:30,536 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:38:30,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 181 [2019-12-18 19:38:30,553 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:30,620 INFO L614 ElimStorePlain]: treesize reduction 130, result has 15.0 percent of original size [2019-12-18 19:38:30,621 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:38:30,621 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2019-12-18 19:38:30,672 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 19:38:30,673 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:30,680 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:30,681 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:38:30,681 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-12-18 19:38:30,706 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 19:38:30,706 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:30,717 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:30,719 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 19:38:30,719 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:20 [2019-12-18 19:38:30,779 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:38:30,801 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:30,801 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 19:38:30,802 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:30,839 INFO L614 ElimStorePlain]: treesize reduction 30, result has 57.1 percent of original size [2019-12-18 19:38:30,839 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 19:38:30,840 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:26 [2019-12-18 19:38:30,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:30,915 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 19:38:30,916 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:30,932 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:30,933 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 19:38:30,933 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2019-12-18 19:38:30,982 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 19:38:30,983 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:30,990 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:30,990 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:38:30,990 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:20 [2019-12-18 19:38:31,025 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 23 treesize of output 22 [2019-12-18 19:38:31,026 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:31,035 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:31,036 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:38:31,036 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:13 [2019-12-18 19:38:31,092 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:38:31,109 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:31,110 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 19:38:31,111 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:31,140 INFO L614 ElimStorePlain]: treesize reduction 26, result has 54.4 percent of original size [2019-12-18 19:38:31,141 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 19:38:31,141 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:22 [2019-12-18 19:38:31,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:31,172 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 19:38:31,173 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:31,189 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:31,190 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 19:38:31,190 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2019-12-18 19:38:31,195 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 19:38:31,195 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:31,196 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:31,197 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:38:31,197 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:1 [2019-12-18 19:38:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 78 proven. 35 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-18 19:38:31,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:38:31,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-18 19:38:31,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257868517] [2019-12-18 19:38:31,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 19:38:31,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:31,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 19:38:31,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-12-18 19:38:31,219 INFO L87 Difference]: Start difference. First operand 840 states and 1578 transitions. Second operand 21 states. [2019-12-18 19:38:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:34,213 INFO L93 Difference]: Finished difference Result 1280 states and 2359 transitions. [2019-12-18 19:38:34,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-18 19:38:34,213 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 79 [2019-12-18 19:38:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:34,220 INFO L225 Difference]: With dead ends: 1280 [2019-12-18 19:38:34,221 INFO L226 Difference]: Without dead ends: 1280 [2019-12-18 19:38:34,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1166, Invalid=4236, Unknown=0, NotChecked=0, Total=5402 [2019-12-18 19:38:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2019-12-18 19:38:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 887. [2019-12-18 19:38:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-12-18 19:38:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1639 transitions. [2019-12-18 19:38:34,246 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1639 transitions. Word has length 79 [2019-12-18 19:38:34,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:34,247 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1639 transitions. [2019-12-18 19:38:34,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 19:38:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1639 transitions. [2019-12-18 19:38:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-18 19:38:34,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:34,250 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:34,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:38:34,455 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:38:34,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:34,456 INFO L82 PathProgramCache]: Analyzing trace with hash -732971920, now seen corresponding path program 4 times [2019-12-18 19:38:34,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:34,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334354778] [2019-12-18 19:38:34,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:34,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334354778] [2019-12-18 19:38:34,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428530287] [2019-12-18 19:38:34,609 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 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 19:38:36,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:38:36,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:38:36,025 INFO L264 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-18 19:38:36,028 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:38:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:36,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:38:36,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-18 19:38:36,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723732964] [2019-12-18 19:38:36,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:38:36,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:36,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:38:36,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:38:36,062 INFO L87 Difference]: Start difference. First operand 887 states and 1639 transitions. Second operand 13 states. [2019-12-18 19:38:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:38:36,143 INFO L93 Difference]: Finished difference Result 1060 states and 1947 transitions. [2019-12-18 19:38:36,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:38:36,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2019-12-18 19:38:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:38:36,149 INFO L225 Difference]: With dead ends: 1060 [2019-12-18 19:38:36,149 INFO L226 Difference]: Without dead ends: 1060 [2019-12-18 19:38:36,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:38:36,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-12-18 19:38:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 980. [2019-12-18 19:38:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-12-18 19:38:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1803 transitions. [2019-12-18 19:38:36,172 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1803 transitions. Word has length 88 [2019-12-18 19:38:36,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:38:36,172 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 1803 transitions. [2019-12-18 19:38:36,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:38:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1803 transitions. [2019-12-18 19:38:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 19:38:36,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:38:36,176 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 6, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:38:36,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:38:36,381 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:38:36,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:38:36,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1394193362, now seen corresponding path program 5 times [2019-12-18 19:38:36,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:38:36,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599690930] [2019-12-18 19:38:36,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:38:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:38:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:38:36,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599690930] [2019-12-18 19:38:36,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373722311] [2019-12-18 19:38:36,547 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 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 19:38:39,415 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-12-18 19:38:39,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:38:39,425 INFO L264 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 141 conjunts are in the unsatisfiable core [2019-12-18 19:38:39,428 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:38:39,451 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 19:38:39,451 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:39,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:39,454 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:38:39,454 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-18 19:38:39,488 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:39,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 62 [2019-12-18 19:38:39,490 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:39,525 INFO L614 ElimStorePlain]: treesize reduction 24, result has 62.5 percent of original size [2019-12-18 19:38:39,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:39,527 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 19:38:39,527 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:34 [2019-12-18 19:38:39,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:39,616 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:39,617 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 19:38:39,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:39,619 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:39,626 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:38:39,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:39,645 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 19:38:39,646 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:39,741 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-18 19:38:39,742 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 19:38:39,742 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-18 19:38:39,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:39,791 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 19:38:39,791 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:39,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:39,799 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 19:38:39,800 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:39,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:39,833 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 19:38:39,833 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 19:38:39,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:39,957 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 19:38:39,958 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:39,982 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:39,986 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 19:38:39,987 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:39,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:40,000 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 19:38:40,000 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:45 [2019-12-18 19:38:40,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:40,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:40,070 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 19:38:40,070 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:40,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:40,080 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 19:38:40,080 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:40,175 INFO L614 ElimStorePlain]: treesize reduction 24, result has 79.3 percent of original size [2019-12-18 19:38:40,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:40,177 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 19:38:40,177 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:69 [2019-12-18 19:38:40,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:40,319 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:38:40,321 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:38:40,340 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:40,341 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 19:38:40,342 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:40,364 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:40,365 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 19:38:40,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:40,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:40,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:40,368 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-18 19:38:40,449 INFO L614 ElimStorePlain]: treesize reduction 67, result has 55.6 percent of original size [2019-12-18 19:38:40,449 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 19:38:40,450 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-18 19:38:40,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:40,521 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 19:38:40,521 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:40,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:40,530 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 19:38:40,531 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:40,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:40,563 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 19:38:40,563 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 19:38:40,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:40,713 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 19:38:40,714 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:40,790 INFO L614 ElimStorePlain]: treesize reduction 10, result has 87.0 percent of original size [2019-12-18 19:38:40,794 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 31 treesize of output 15 [2019-12-18 19:38:40,794 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:40,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:40,809 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 19:38:40,809 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:98, output treesize:45 [2019-12-18 19:38:40,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:40,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:40,867 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 19:38:40,868 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:40,901 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:40,901 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 19:38:40,902 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:40,984 INFO L614 ElimStorePlain]: treesize reduction 24, result has 79.3 percent of original size [2019-12-18 19:38:40,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:40,987 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 19:38:40,988 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:69 [2019-12-18 19:38:41,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:41,102 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:38:41,105 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:38:41,124 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:41,124 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 19:38:41,125 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:41,145 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:41,145 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 19:38:41,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:41,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:41,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:41,148 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-18 19:38:41,231 INFO L614 ElimStorePlain]: treesize reduction 67, result has 55.6 percent of original size [2019-12-18 19:38:41,232 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 19:38:41,232 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-18 19:38:41,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:38:41,331 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 19:38:41,332 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:41,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:41,363 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 19:38:41,364 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:41,404 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:41,404 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 19:38:41,405 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 19:38:41,495 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 19:38:41,496 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:41,507 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:41,508 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:38:41,508 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-18 19:38:41,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:41,557 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 19:38:41,558 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:41,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:41,571 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 19:38:41,571 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:34 [2019-12-18 19:38:41,674 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:38:41,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:41,689 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 19:38:41,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:41,732 INFO L614 ElimStorePlain]: treesize reduction 26, result has 65.3 percent of original size [2019-12-18 19:38:41,732 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 19:38:41,733 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:40 [2019-12-18 19:38:41,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:41,799 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 19:38:41,800 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:41,816 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:41,817 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 19:38:41,817 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 19:38:41,935 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 31 treesize of output 15 [2019-12-18 19:38:41,936 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:41,946 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:41,947 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:38:41,947 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:34 [2019-12-18 19:38:41,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:41,994 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 19:38:41,995 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:42,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:42,012 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 19:38:42,013 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:34 [2019-12-18 19:38:42,147 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:38:42,162 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:42,162 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 19:38:42,163 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:42,201 INFO L614 ElimStorePlain]: treesize reduction 26, result has 65.3 percent of original size [2019-12-18 19:38:42,202 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 19:38:42,202 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:40 [2019-12-18 19:38:42,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:42,276 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 19:38:42,276 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:42,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:42,297 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 19:38:42,297 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 19:38:42,416 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 31 treesize of output 15 [2019-12-18 19:38:42,416 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:42,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:42,426 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:38:42,427 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:34 [2019-12-18 19:38:42,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:42,485 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 19:38:42,486 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:42,496 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:42,497 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 19:38:42,498 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-18 19:38:42,602 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:38:42,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:42,616 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 19:38:42,617 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:42,637 INFO L614 ElimStorePlain]: treesize reduction 26, result has 49.0 percent of original size [2019-12-18 19:38:42,638 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 19:38:42,638 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:16 [2019-12-18 19:38:42,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:38:42,698 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 19:38:42,699 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:42,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:42,709 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 19:38:42,710 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-12-18 19:38:42,714 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 19:38:42,714 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:38:42,715 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:38:42,715 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:38:42,715 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:1 [2019-12-18 19:38:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 223 proven. 46 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-18 19:38:42,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:38:42,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 34] total 45 [2019-12-18 19:38:42,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722878578] [2019-12-18 19:38:42,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-12-18 19:38:42,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:38:42,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-18 19:38:42,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1658, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 19:38:42,761 INFO L87 Difference]: Start difference. First operand 980 states and 1803 transitions. Second operand 45 states. [2019-12-18 19:38:45,333 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2019-12-18 19:38:47,219 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2019-12-18 19:38:47,817 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-12-18 19:38:48,390 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-12-18 19:38:48,879 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2019-12-18 19:38:49,996 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-12-18 19:38:50,676 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2019-12-18 19:38:51,719 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2019-12-18 19:38:52,061 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-12-18 19:38:52,801 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2019-12-18 19:38:54,189 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-12-18 19:38:54,985 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-12-18 19:38:55,596 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2019-12-18 19:38:55,764 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2019-12-18 19:38:57,108 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-12-18 19:38:58,709 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2019-12-18 19:38:59,081 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-12-18 19:38:59,946 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2019-12-18 19:39:01,072 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-12-18 19:39:02,258 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-12-18 19:39:02,771 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2019-12-18 19:39:03,159 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2019-12-18 19:39:04,703 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-12-18 19:39:06,225 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 36 [2019-12-18 19:39:06,599 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-12-18 19:39:07,568 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45 [2019-12-18 19:39:08,894 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-12-18 19:39:11,449 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-12-18 19:39:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:13,162 INFO L93 Difference]: Finished difference Result 3932 states and 7219 transitions. [2019-12-18 19:39:13,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 304 states. [2019-12-18 19:39:13,163 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 96 [2019-12-18 19:39:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:13,177 INFO L225 Difference]: With dead ends: 3932 [2019-12-18 19:39:13,177 INFO L226 Difference]: Without dead ends: 3932 [2019-12-18 19:39:13,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50134 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=14241, Invalid=93015, Unknown=0, NotChecked=0, Total=107256 [2019-12-18 19:39:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2019-12-18 19:39:13,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 2636. [2019-12-18 19:39:13,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2636 states. [2019-12-18 19:39:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 4748 transitions. [2019-12-18 19:39:13,271 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 4748 transitions. Word has length 96 [2019-12-18 19:39:13,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:13,271 INFO L462 AbstractCegarLoop]: Abstraction has 2636 states and 4748 transitions. [2019-12-18 19:39:13,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-12-18 19:39:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 4748 transitions. [2019-12-18 19:39:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-18 19:39:13,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:13,281 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 7, 7, 7, 7, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:13,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:13,496 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:13,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:13,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1603357744, now seen corresponding path program 6 times [2019-12-18 19:39:13,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:13,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9248948] [2019-12-18 19:39:13,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:39:13,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9248948] [2019-12-18 19:39:13,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635872653] [2019-12-18 19:39:13,703 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 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 19:39:27,753 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-12-18 19:39:27,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:27,764 INFO L264 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 80 conjunts are in the unsatisfiable core [2019-12-18 19:39:27,768 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:27,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:39:27,784 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 396 treesize of output 392 [2019-12-18 19:39:27,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:39:27,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:39:27,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:39:27,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:39:27,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:39:27,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:39:27,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:39:27,797 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:39:27,956 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 36 [2019-12-18 19:39:27,957 INFO L614 ElimStorePlain]: treesize reduction 1733, result has 2.6 percent of original size [2019-12-18 19:39:27,957 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:39:27,958 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:19 [2019-12-18 19:39:28,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 19:39:28,012 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:39:28,025 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:39:28,025 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:39:28,025 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-12-18 19:39:28,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 19:39:28,071 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:39:28,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:39:28,088 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 19:39:28,088 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:31 [2019-12-18 19:39:28,143 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:39:28,158 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:39:28,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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 19:39:28,160 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:39:28,204 INFO L614 ElimStorePlain]: treesize reduction 26, result has 63.9 percent of original size [2019-12-18 19:39:28,204 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 19:39:28,205 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:37 [2019-12-18 19:39:28,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:39:28,240 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 19:39:28,241 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:39:28,263 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:39:28,264 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 19:39:28,264 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:37 [2019-12-18 19:39:28,314 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 31 treesize of output 15 [2019-12-18 19:39:28,315 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:39:28,354 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:39:28,355 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:39:28,355 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:31 [2019-12-18 19:39:28,389 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-18 19:39:28,389 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:39:28,400 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:39:28,401 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 19:39:28,401 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:17 [2019-12-18 19:39:28,480 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:39:28,495 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:39:28,495 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 19:39:28,496 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:39:28,527 INFO L614 ElimStorePlain]: treesize reduction 26, result has 55.2 percent of original size [2019-12-18 19:39:28,528 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 19:39:28,528 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:23 [2019-12-18 19:39:28,572 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 21 treesize of output 20 [2019-12-18 19:39:28,573 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:39:28,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:39:28,586 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 19:39:28,586 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2019-12-18 19:39:28,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:39:28,641 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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 19:39:28,642 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:39:28,655 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:39:28,656 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 19:39:28,656 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:30 [2019-12-18 19:39:28,664 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 19:39:28,664 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:39:28,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:39:28,666 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 19:39:28,666 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:1 [2019-12-18 19:39:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 147 proven. 15 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-12-18 19:39:28,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:28,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2019-12-18 19:39:28,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372220723] [2019-12-18 19:39:28,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-18 19:39:28,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:28,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-18 19:39:28,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2019-12-18 19:39:28,697 INFO L87 Difference]: Start difference. First operand 2636 states and 4748 transitions. Second operand 27 states. [2019-12-18 19:39:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:29,881 INFO L93 Difference]: Finished difference Result 3274 states and 5879 transitions. [2019-12-18 19:39:29,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 19:39:29,882 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 104 [2019-12-18 19:39:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:29,894 INFO L225 Difference]: With dead ends: 3274 [2019-12-18 19:39:29,894 INFO L226 Difference]: Without dead ends: 3274 [2019-12-18 19:39:29,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=668, Invalid=1312, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 19:39:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2019-12-18 19:39:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 2952. [2019-12-18 19:39:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-12-18 19:39:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 5310 transitions. [2019-12-18 19:39:29,956 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 5310 transitions. Word has length 104 [2019-12-18 19:39:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:29,956 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 5310 transitions. [2019-12-18 19:39:29,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-18 19:39:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 5310 transitions. [2019-12-18 19:39:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-18 19:39:29,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:29,964 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 8, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:30,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:30,174 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:30,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:30,174 INFO L82 PathProgramCache]: Analyzing trace with hash -565568814, now seen corresponding path program 7 times [2019-12-18 19:39:30,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:30,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817641924] [2019-12-18 19:39:30,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:39:30,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817641924] [2019-12-18 19:39:30,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102062842] [2019-12-18 19:39:30,460 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 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 19:39:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:30,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-18 19:39:30,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:39:30,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:30,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-18 19:39:30,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714170499] [2019-12-18 19:39:30,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 19:39:30,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:30,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 19:39:30,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:39:30,685 INFO L87 Difference]: Start difference. First operand 2952 states and 5310 transitions. Second operand 16 states. [2019-12-18 19:39:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:30,796 INFO L93 Difference]: Finished difference Result 3545 states and 6366 transitions. [2019-12-18 19:39:30,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 19:39:30,797 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 112 [2019-12-18 19:39:30,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:30,812 INFO L225 Difference]: With dead ends: 3545 [2019-12-18 19:39:30,812 INFO L226 Difference]: Without dead ends: 3545 [2019-12-18 19:39:30,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-12-18 19:39:30,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2019-12-18 19:39:30,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 3268. [2019-12-18 19:39:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3268 states. [2019-12-18 19:39:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 5872 transitions. [2019-12-18 19:39:30,880 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 5872 transitions. Word has length 112 [2019-12-18 19:39:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:30,881 INFO L462 AbstractCegarLoop]: Abstraction has 3268 states and 5872 transitions. [2019-12-18 19:39:30,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 19:39:30,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 5872 transitions. [2019-12-18 19:39:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-18 19:39:30,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:30,891 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:31,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:31,096 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:31,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:31,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1311509874, now seen corresponding path program 8 times [2019-12-18 19:39:31,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:31,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427846397] [2019-12-18 19:39:31,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 0 proven. 523 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:39:31,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427846397] [2019-12-18 19:39:31,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944801669] [2019-12-18 19:39:31,417 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 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 19:39:31,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:39:31,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:31,686 INFO L264 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-18 19:39:31,689 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 0 proven. 523 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:39:31,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:31,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-18 19:39:31,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884109010] [2019-12-18 19:39:31,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 19:39:31,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:31,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 19:39:31,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:39:31,715 INFO L87 Difference]: Start difference. First operand 3268 states and 5872 transitions. Second operand 17 states. [2019-12-18 19:39:31,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:31,825 INFO L93 Difference]: Finished difference Result 3861 states and 6928 transitions. [2019-12-18 19:39:31,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 19:39:31,826 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 120 [2019-12-18 19:39:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:31,849 INFO L225 Difference]: With dead ends: 3861 [2019-12-18 19:39:31,850 INFO L226 Difference]: Without dead ends: 3861 [2019-12-18 19:39:31,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:39:31,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2019-12-18 19:39:31,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3584. [2019-12-18 19:39:31,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3584 states. [2019-12-18 19:39:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 6434 transitions. [2019-12-18 19:39:31,914 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 6434 transitions. Word has length 120 [2019-12-18 19:39:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:31,915 INFO L462 AbstractCegarLoop]: Abstraction has 3584 states and 6434 transitions. [2019-12-18 19:39:31,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 19:39:31,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 6434 transitions. [2019-12-18 19:39:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-18 19:39:31,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:31,923 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 9, 9, 9, 9, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:32,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:32,133 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:32,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:32,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1413194801, now seen corresponding path program 9 times [2019-12-18 19:39:32,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:32,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500884198] [2019-12-18 19:39:32,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2019-12-18 19:39:32,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500884198] [2019-12-18 19:39:32,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:39:32,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:39:32,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248097236] [2019-12-18 19:39:32,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:39:32,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:32,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:39:32,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:39:32,343 INFO L87 Difference]: Start difference. First operand 3584 states and 6434 transitions. Second operand 5 states. [2019-12-18 19:39:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:32,476 INFO L93 Difference]: Finished difference Result 3444 states and 6174 transitions. [2019-12-18 19:39:32,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:39:32,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-12-18 19:39:32,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:32,485 INFO L225 Difference]: With dead ends: 3444 [2019-12-18 19:39:32,485 INFO L226 Difference]: Without dead ends: 3444 [2019-12-18 19:39:32,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:39:32,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2019-12-18 19:39:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 3444. [2019-12-18 19:39:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3444 states. [2019-12-18 19:39:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 6174 transitions. [2019-12-18 19:39:32,565 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 6174 transitions. Word has length 127 [2019-12-18 19:39:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:32,565 INFO L462 AbstractCegarLoop]: Abstraction has 3444 states and 6174 transitions. [2019-12-18 19:39:32,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:39:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 6174 transitions. [2019-12-18 19:39:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-12-18 19:39:32,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:32,572 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 10, 10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:32,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 19:39:32,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:32,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1712975406, now seen corresponding path program 10 times [2019-12-18 19:39:32,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:32,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910998207] [2019-12-18 19:39:32,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:33,972 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 269 proven. 22 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-12-18 19:39:33,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910998207] [2019-12-18 19:39:33,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767992793] [2019-12-18 19:39:33,973 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 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 19:39:50,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:39:50,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:50,923 INFO L264 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-18 19:39:50,927 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:51,108 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 19:39:51,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:51,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2019-12-18 19:39:51,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785241436] [2019-12-18 19:39:51,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-18 19:39:51,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:51,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-18 19:39:51,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=714, Unknown=0, NotChecked=0, Total=930 [2019-12-18 19:39:51,110 INFO L87 Difference]: Start difference. First operand 3444 states and 6174 transitions. Second operand 31 states. [2019-12-18 19:39:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:59,920 INFO L93 Difference]: Finished difference Result 3340 states and 5921 transitions. [2019-12-18 19:39:59,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-12-18 19:39:59,921 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 128 [2019-12-18 19:39:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:59,927 INFO L225 Difference]: With dead ends: 3340 [2019-12-18 19:39:59,927 INFO L226 Difference]: Without dead ends: 3340 [2019-12-18 19:39:59,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 234 SyntacticMatches, 14 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16189 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=7941, Invalid=28731, Unknown=0, NotChecked=0, Total=36672 [2019-12-18 19:39:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3340 states. [2019-12-18 19:39:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3340 to 1830. [2019-12-18 19:39:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1830 states. [2019-12-18 19:39:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 3298 transitions. [2019-12-18 19:39:59,967 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 3298 transitions. Word has length 128 [2019-12-18 19:39:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:59,967 INFO L462 AbstractCegarLoop]: Abstraction has 1830 states and 3298 transitions. [2019-12-18 19:39:59,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-18 19:39:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 3298 transitions. [2019-12-18 19:39:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-18 19:39:59,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:59,972 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 11, 11, 11, 11, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:40:00,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:40:00,180 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:40:00,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:40:00,181 INFO L82 PathProgramCache]: Analyzing trace with hash -174116110, now seen corresponding path program 11 times [2019-12-18 19:40:00,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:40:00,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605364566] [2019-12-18 19:40:00,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:40:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:40:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 0 proven. 717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 19:40:00,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605364566] [2019-12-18 19:40:00,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710702570] [2019-12-18 19:40:00,526 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:40:02,910 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-12-18 19:40:02,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:40:02,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 172 conjunts are in the unsatisfiable core [2019-12-18 19:40:02,924 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:40:02,992 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 19:40:02,992 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:02,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:02,997 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:40:02,997 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:10 [2019-12-18 19:40:03,036 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:03,037 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 26 treesize of output 63 [2019-12-18 19:40:03,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:03,038 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:03,099 INFO L614 ElimStorePlain]: treesize reduction 24, result has 63.1 percent of original size [2019-12-18 19:40:03,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:03,101 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 19:40:03,101 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:35 [2019-12-18 19:40:03,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:03,249 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:03,250 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 19:40:03,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:03,252 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 19:40:03,258 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:40:03,279 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:03,280 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 32 treesize of output 50 [2019-12-18 19:40:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:03,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:03,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:03,283 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-18 19:40:03,377 INFO L614 ElimStorePlain]: treesize reduction 95, result has 44.1 percent of original size [2019-12-18 19:40:03,378 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 19:40:03,378 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:49 [2019-12-18 19:40:03,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:03,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:40:03,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 19:40:03,472 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:03,481 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 19:40:03,482 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:03,523 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:03,524 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 19:40:03,524 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:49 [2019-12-18 19:40:03,599 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 19:40:03,600 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:03,602 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:03,603 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:40:03,603 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:9 [2019-12-18 19:40:03,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:03,645 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 26 treesize of output 65 [2019-12-18 19:40:03,645 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:03,672 INFO L614 ElimStorePlain]: treesize reduction 25, result has 59.7 percent of original size [2019-12-18 19:40:03,672 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 19:40:03,673 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:24 [2019-12-18 19:40:03,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:03,758 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:40:03,761 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:40:03,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:03,783 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 19:40:03,784 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:03,802 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:03,803 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 19:40:03,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:03,804 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:03,883 INFO L614 ElimStorePlain]: treesize reduction 50, result has 61.5 percent of original size [2019-12-18 19:40:03,884 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 19:40:03,885 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:36 [2019-12-18 19:40:03,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:03,938 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 19:40:03,938 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:03,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:40:03,946 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 19:40:03,947 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:03,972 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:03,973 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 19:40:03,973 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:36 [2019-12-18 19:40:04,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:04,039 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 19:40:04,039 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:04,044 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 19:40:04,044 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:04,058 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:04,059 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 19:40:04,059 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:23 [2019-12-18 19:40:04,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:04,109 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 21 treesize of output 17 [2019-12-18 19:40:04,109 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:04,137 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:04,138 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 19:40:04,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:04,139 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:04,198 INFO L614 ElimStorePlain]: treesize reduction 22, result has 79.2 percent of original size [2019-12-18 19:40:04,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:04,200 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 19:40:04,200 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:59 [2019-12-18 19:40:04,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:04,317 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:40:04,320 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:40:04,339 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:04,339 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 19:40:04,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:04,340 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:04,362 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:04,363 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 19:40:04,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:04,364 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:04,465 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-12-18 19:40:04,466 INFO L614 ElimStorePlain]: treesize reduction 55, result has 64.1 percent of original size [2019-12-18 19:40:04,467 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 19:40:04,467 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:48 [2019-12-18 19:40:04,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:04,547 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 19:40:04,547 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:04,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:40:04,555 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 19:40:04,556 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:04,589 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:04,590 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 19:40:04,590 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 19:40:04,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:04,739 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 44 treesize of output 22 [2019-12-18 19:40:04,740 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:04,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 35 treesize of output 19 [2019-12-18 19:40:04,750 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:04,792 INFO L614 ElimStorePlain]: treesize reduction 3, result has 94.5 percent of original size [2019-12-18 19:40:04,793 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 19:40:04,793 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:35 [2019-12-18 19:40:04,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:04,847 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 19:40:04,847 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:04,876 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:04,876 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 19:40:04,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:04,878 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:04,951 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-18 19:40:04,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:04,953 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 19:40:04,953 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:59 [2019-12-18 19:40:05,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:05,053 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:40:05,055 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:40:05,076 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:05,077 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 19:40:05,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:05,078 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:05,099 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:05,100 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 19:40:05,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:05,101 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:05,200 INFO L614 ElimStorePlain]: treesize reduction 55, result has 64.1 percent of original size [2019-12-18 19:40:05,201 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 19:40:05,201 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:48 [2019-12-18 19:40:05,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:05,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:40:05,288 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 19:40:05,288 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:05,295 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 19:40:05,296 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:05,335 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:05,336 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 19:40:05,336 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 19:40:05,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:05,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 0 case distinctions, treesize of input 44 treesize of output 22 [2019-12-18 19:40:05,514 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:05,520 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 35 treesize of output 19 [2019-12-18 19:40:05,521 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:05,556 INFO L614 ElimStorePlain]: treesize reduction 3, result has 94.5 percent of original size [2019-12-18 19:40:05,557 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 19:40:05,557 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:35 [2019-12-18 19:40:05,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:05,633 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:05,633 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 19:40:05,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:05,634 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:05,642 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 19:40:05,642 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:05,710 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-18 19:40:05,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:05,711 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 19:40:05,712 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:59 [2019-12-18 19:40:05,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:05,837 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:40:05,839 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:40:05,855 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:05,856 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 19:40:05,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:05,857 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:05,877 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:05,878 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 19:40:05,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:05,879 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:05,969 INFO L614 ElimStorePlain]: treesize reduction 55, result has 64.1 percent of original size [2019-12-18 19:40:05,970 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 19:40:05,970 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:48 [2019-12-18 19:40:06,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:06,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:40:06,042 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 19:40:06,042 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:06,049 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 19:40:06,049 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:06,080 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:06,081 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 19:40:06,081 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 19:40:06,160 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 19:40:06,160 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:06,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:06,170 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 19:40:06,170 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-18 19:40:06,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:40:06,212 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 19:40:06,212 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:06,231 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:06,232 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 19:40:06,232 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:34 [2019-12-18 19:40:06,339 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:40:06,355 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:06,355 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 19:40:06,356 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:06,398 INFO L614 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2019-12-18 19:40:06,399 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 19:40:06,399 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 19:40:06,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:40:06,469 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 19:40:06,470 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:06,488 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:06,489 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 19:40:06,489 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 19:40:06,554 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 19:40:06,555 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:06,566 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:06,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 19:40:06,567 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 19:40:06,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:40:06,614 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 19:40:06,615 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:06,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:06,629 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 19:40:06,630 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:34 [2019-12-18 19:40:06,768 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:40:06,782 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:06,782 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 19:40:06,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:06,783 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:06,841 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-18 19:40:06,842 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 19:40:06,842 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 19:40:06,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:40:06,917 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 19:40:06,918 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:06,935 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:06,936 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 19:40:06,936 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 19:40:07,004 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 19:40:07,004 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:07,016 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:07,017 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 19:40:07,017 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 19:40:07,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:40:07,066 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 19:40:07,066 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:07,081 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:07,082 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 19:40:07,082 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:34 [2019-12-18 19:40:07,198 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 19:40:07,210 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:07,211 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 19:40:07,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:07,212 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:07,267 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-18 19:40:07,268 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 19:40:07,268 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 19:40:07,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:40:07,340 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 19:40:07,340 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:07,356 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:07,357 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 19:40:07,357 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 19:40:07,446 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 19:40:07,446 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:07,458 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:07,458 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 19:40:07,458 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 19:40:07,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 19:40:07,547 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 19:40:07,547 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:07,560 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:07,561 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 19:40:07,562 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-18 19:40:07,737 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:07,737 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 19:40:07,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 19:40:07,739 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:07,771 INFO L614 ElimStorePlain]: treesize reduction 35, result has 46.2 percent of original size [2019-12-18 19:40:07,771 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 19:40:07,772 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-12-18 19:40:07,847 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-18 19:40:07,848 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 19:40:07,848 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 19:40:07,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 19:40:07,857 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 19:40:07,857 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-12-18 19:40:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 532 proven. 139 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-18 19:40:08,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:40:08,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 49] total 65 [2019-12-18 19:40:08,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580656954] [2019-12-18 19:40:08,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-12-18 19:40:08,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:40:08,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-12-18 19:40:08,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=3484, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 19:40:08,072 INFO L87 Difference]: Start difference. First operand 1830 states and 3298 transitions. Second operand 65 states. [2019-12-18 19:40:59,295 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-12-18 19:41:03,833 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-12-18 19:41:13,357 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-12-18 19:41:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:41:18,998 INFO L93 Difference]: Finished difference Result 7668 states and 13673 transitions. [2019-12-18 19:41:18,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 683 states. [2019-12-18 19:41:18,999 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 136 [2019-12-18 19:41:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:41:19,012 INFO L225 Difference]: With dead ends: 7668 [2019-12-18 19:41:19,013 INFO L226 Difference]: Without dead ends: 7668 [2019-12-18 19:41:19,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1449 GetRequests, 717 SyntacticMatches, 4 SemanticMatches, 728 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268636 ImplicationChecksByTransitivity, 63.7s TimeCoverageRelationStatistics Valid=63612, Invalid=468558, Unknown=0, NotChecked=0, Total=532170 [2019-12-18 19:41:19,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7668 states. [2019-12-18 19:41:19,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7668 to 4848. [2019-12-18 19:41:19,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4848 states. [2019-12-18 19:41:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4848 states to 4848 states and 8616 transitions. [2019-12-18 19:41:19,154 INFO L78 Accepts]: Start accepts. Automaton has 4848 states and 8616 transitions. Word has length 136 [2019-12-18 19:41:19,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:41:19,155 INFO L462 AbstractCegarLoop]: Abstraction has 4848 states and 8616 transitions. [2019-12-18 19:41:19,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-12-18 19:41:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 4848 states and 8616 transitions. [2019-12-18 19:41:19,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-18 19:41:19,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:41:19,168 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 12, 12, 12, 12, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:41:19,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:41:19,376 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:41:19,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:41:19,376 INFO L82 PathProgramCache]: Analyzing trace with hash 872267904, now seen corresponding path program 12 times [2019-12-18 19:41:19,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:41:19,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177973987] [2019-12-18 19:41:19,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:41:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:41:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 502 proven. 62 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-12-18 19:41:20,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177973987] [2019-12-18 19:41:20,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062988227] [2019-12-18 19:41:20,528 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown