/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:32:14,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:32:14,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:32:14,190 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:32:14,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:32:14,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:32:14,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:32:14,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:32:14,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:32:14,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:32:14,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:32:14,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:32:14,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:32:14,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:32:14,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:32:14,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:32:14,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:32:14,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:32:14,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:32:14,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:32:14,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:32:14,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:32:14,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:32:14,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:32:14,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:32:14,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:32:14,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:32:14,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:32:14,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:32:14,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:32:14,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:32:14,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:32:14,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:32:14,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:32:14,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:32:14,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:32:14,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:32:14,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:32:14,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:32:14,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:32:14,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:32:14,229 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-18 23:32:14,251 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:32:14,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:32:14,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:32:14,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:32:14,253 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:32:14,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:32:14,254 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:32:14,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:32:14,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:32:14,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:32:14,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:32:14,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:32:14,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:32:14,256 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:32:14,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:32:14,256 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:32:14,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:32:14,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:32:14,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:32:14,257 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:32:14,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:32:14,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:32:14,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:32:14,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:32:14,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:32:14,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:32:14,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:32:14,259 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-18 23:32:14,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:32:14,259 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:32:14,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:32:14,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:32:14,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:32:14,620 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:32:14,620 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:32:14,621 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2019-12-18 23:32:14,679 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1701d83/7bcdb142870f4595ae62eea207556136/FLAG4c1c71bce [2019-12-18 23:32:15,194 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:32:15,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2019-12-18 23:32:15,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1701d83/7bcdb142870f4595ae62eea207556136/FLAG4c1c71bce [2019-12-18 23:32:15,500 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d1701d83/7bcdb142870f4595ae62eea207556136 [2019-12-18 23:32:15,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:32:15,512 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:32:15,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:32:15,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:32:15,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:32:15,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:32:15" (1/1) ... [2019-12-18 23:32:15,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a7a2df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:32:15, skipping insertion in model container [2019-12-18 23:32:15,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:32:15" (1/1) ... [2019-12-18 23:32:15,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:32:15,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:32:16,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:32:16,282 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:32:16,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:32:16,561 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:32:16,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:32:16 WrapperNode [2019-12-18 23:32:16,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:32:16,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:32:16,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:32:16,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:32:16,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:32:16" (1/1) ... [2019-12-18 23:32:16,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:32:16" (1/1) ... [2019-12-18 23:32:16,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:32:16,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:32:16,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:32:16,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:32:16,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:32:16" (1/1) ... [2019-12-18 23:32:16,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:32:16" (1/1) ... [2019-12-18 23:32:16,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:32:16" (1/1) ... [2019-12-18 23:32:16,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:32:16" (1/1) ... [2019-12-18 23:32:16,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:32:16" (1/1) ... [2019-12-18 23:32:16,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:32:16" (1/1) ... [2019-12-18 23:32:16,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:32:16" (1/1) ... [2019-12-18 23:32:16,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:32:16,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:32:16,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:32:16,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:32:16,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:32:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:32:16,792 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-18 23:32:16,793 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-18 23:32:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-18 23:32:16,793 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-18 23:32:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:32:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:32:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 23:32:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:32:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-12-18 23:32:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-18 23:32:16,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:32:16,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:32:16,796 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:32:17,450 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:32:17,451 INFO L287 CfgBuilder]: Removed 16 assume(true) statements. [2019-12-18 23:32:17,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:32:17 BoogieIcfgContainer [2019-12-18 23:32:17,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:32:17,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:32:17,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:32:17,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:32:17,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:32:15" (1/3) ... [2019-12-18 23:32:17,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59419019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:32:17, skipping insertion in model container [2019-12-18 23:32:17,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:32:16" (2/3) ... [2019-12-18 23:32:17,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59419019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:32:17, skipping insertion in model container [2019-12-18 23:32:17,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:32:17" (3/3) ... [2019-12-18 23:32:17,460 INFO L109 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2019-12-18 23:32:17,470 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:32:17,471 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:32:17,478 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:32:17,479 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:32:17,520 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,520 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,521 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,521 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,521 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,522 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,522 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,522 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,522 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,522 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,523 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,523 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,523 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,523 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,524 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,524 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,524 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,524 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,524 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,524 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,525 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,525 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,525 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,525 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,525 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,526 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,526 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,526 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,526 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,526 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,526 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,527 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,527 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,527 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,527 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,527 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,528 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,528 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,528 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,528 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,528 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,529 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,529 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,529 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,529 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,529 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,530 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,530 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,530 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,530 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,530 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,531 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,531 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,531 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,531 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,531 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,531 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,532 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,532 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,532 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,532 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,532 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,533 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,533 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,533 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,533 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,533 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,534 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,534 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,534 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,534 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,534 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,535 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,535 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,535 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,535 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,535 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,536 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,536 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,536 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,536 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,536 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,537 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,537 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,537 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,537 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,538 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,539 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,539 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,539 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,539 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,539 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,540 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,540 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,540 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,540 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,541 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,541 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,541 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,541 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,541 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,542 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,542 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,542 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,542 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,542 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,542 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,543 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,543 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,543 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,543 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,543 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,544 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,544 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,544 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,544 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,544 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,545 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,545 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,545 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,545 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,545 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,545 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,546 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,546 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,546 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,546 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,546 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,547 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,547 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,547 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,547 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,547 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,548 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,548 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,548 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,548 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,548 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,548 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,549 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,549 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,549 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,549 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,549 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,549 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,550 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,550 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,550 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,550 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,550 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,550 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,551 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,551 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,551 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,551 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,551 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,551 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,552 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,552 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,552 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,552 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,552 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,552 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,553 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,553 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,553 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,553 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,553 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,554 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,554 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,554 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,554 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,554 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,554 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,555 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,555 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,555 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,555 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,555 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,556 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,556 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,556 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,556 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,556 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,557 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,557 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,557 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,557 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,557 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,557 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,558 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,558 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,558 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,558 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,558 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,558 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,559 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,559 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,559 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,559 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,559 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,560 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,560 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,560 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,560 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,560 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,561 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,561 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,561 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,561 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,561 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,561 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,565 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,565 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,565 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,565 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,566 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,566 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,566 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,566 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,566 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,567 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,567 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,567 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,567 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,567 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,567 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,568 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,568 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,568 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,568 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,568 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,569 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,569 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,569 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,574 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,575 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,575 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,575 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,575 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,576 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,576 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,576 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,576 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,576 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,576 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,577 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,577 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,577 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,577 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,577 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,578 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,578 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,578 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,578 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,578 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,578 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,579 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,579 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,579 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,579 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,579 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,580 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,580 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,580 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,580 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:32:17,604 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 23:32:17,621 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:32:17,621 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:32:17,621 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:32:17,621 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:32:17,621 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:32:17,622 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:32:17,622 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:32:17,622 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:32:17,637 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 196 places, 204 transitions [2019-12-18 23:32:18,122 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 10787 states. [2019-12-18 23:32:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 10787 states. [2019-12-18 23:32:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 23:32:18,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:32:18,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:32:18,135 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:32:18,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:32:18,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1929394428, now seen corresponding path program 1 times [2019-12-18 23:32:18,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:32:18,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68749674] [2019-12-18 23:32:18,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:32:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:18,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68749674] [2019-12-18 23:32:18,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:32:18,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:32:18,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107021645] [2019-12-18 23:32:18,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-18 23:32:18,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:32:18,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-18 23:32:18,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 23:32:18,500 INFO L87 Difference]: Start difference. First operand 10787 states. Second operand 2 states. [2019-12-18 23:32:18,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:32:18,639 INFO L93 Difference]: Finished difference Result 10784 states and 29353 transitions. [2019-12-18 23:32:18,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 23:32:18,641 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 44 [2019-12-18 23:32:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:32:18,726 INFO L225 Difference]: With dead ends: 10784 [2019-12-18 23:32:18,726 INFO L226 Difference]: Without dead ends: 9749 [2019-12-18 23:32:18,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 23:32:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9749 states. [2019-12-18 23:32:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9749 to 9749. [2019-12-18 23:32:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9749 states. [2019-12-18 23:32:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9749 states to 9749 states and 26526 transitions. [2019-12-18 23:32:19,229 INFO L78 Accepts]: Start accepts. Automaton has 9749 states and 26526 transitions. Word has length 44 [2019-12-18 23:32:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:32:19,230 INFO L462 AbstractCegarLoop]: Abstraction has 9749 states and 26526 transitions. [2019-12-18 23:32:19,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-18 23:32:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 9749 states and 26526 transitions. [2019-12-18 23:32:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 23:32:19,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:32:19,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:32:19,263 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:32:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:32:19,263 INFO L82 PathProgramCache]: Analyzing trace with hash -593181059, now seen corresponding path program 1 times [2019-12-18 23:32:19,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:32:19,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127741130] [2019-12-18 23:32:19,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:32:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:19,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127741130] [2019-12-18 23:32:19,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:32:19,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 23:32:19,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957042532] [2019-12-18 23:32:19,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:32:19,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:32:19,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:32:19,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:32:19,710 INFO L87 Difference]: Start difference. First operand 9749 states and 26526 transitions. Second operand 12 states. [2019-12-18 23:32:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:32:20,513 INFO L93 Difference]: Finished difference Result 9780 states and 26590 transitions. [2019-12-18 23:32:20,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:32:20,514 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-18 23:32:20,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:32:20,574 INFO L225 Difference]: With dead ends: 9780 [2019-12-18 23:32:20,574 INFO L226 Difference]: Without dead ends: 9780 [2019-12-18 23:32:20,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2019-12-18 23:32:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9780 states. [2019-12-18 23:32:20,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9780 to 9746. [2019-12-18 23:32:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9746 states. [2019-12-18 23:32:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9746 states to 9746 states and 26522 transitions. [2019-12-18 23:32:20,937 INFO L78 Accepts]: Start accepts. Automaton has 9746 states and 26522 transitions. Word has length 97 [2019-12-18 23:32:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:32:20,938 INFO L462 AbstractCegarLoop]: Abstraction has 9746 states and 26522 transitions. [2019-12-18 23:32:20,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:32:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 9746 states and 26522 transitions. [2019-12-18 23:32:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 23:32:20,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:32:20,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:32:20,954 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:32:20,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:32:20,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1482308150, now seen corresponding path program 1 times [2019-12-18 23:32:20,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:32:20,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853080514] [2019-12-18 23:32:20,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:32:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:21,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853080514] [2019-12-18 23:32:21,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:32:21,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 23:32:21,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905426450] [2019-12-18 23:32:21,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 23:32:21,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:32:21,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 23:32:21,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:32:21,880 INFO L87 Difference]: Start difference. First operand 9746 states and 26522 transitions. Second operand 18 states. [2019-12-18 23:32:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:32:23,975 INFO L93 Difference]: Finished difference Result 13022 states and 35325 transitions. [2019-12-18 23:32:23,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 23:32:23,976 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-12-18 23:32:23,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:32:24,010 INFO L225 Difference]: With dead ends: 13022 [2019-12-18 23:32:24,010 INFO L226 Difference]: Without dead ends: 13022 [2019-12-18 23:32:24,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 23:32:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13022 states. [2019-12-18 23:32:24,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13022 to 11672. [2019-12-18 23:32:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11672 states. [2019-12-18 23:32:24,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11672 states to 11672 states and 31707 transitions. [2019-12-18 23:32:24,398 INFO L78 Accepts]: Start accepts. Automaton has 11672 states and 31707 transitions. Word has length 98 [2019-12-18 23:32:24,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:32:24,399 INFO L462 AbstractCegarLoop]: Abstraction has 11672 states and 31707 transitions. [2019-12-18 23:32:24,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 23:32:24,399 INFO L276 IsEmpty]: Start isEmpty. Operand 11672 states and 31707 transitions. [2019-12-18 23:32:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-18 23:32:24,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:32:24,418 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:32:24,419 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:32:24,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:32:24,419 INFO L82 PathProgramCache]: Analyzing trace with hash 921844576, now seen corresponding path program 1 times [2019-12-18 23:32:24,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:32:24,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712659246] [2019-12-18 23:32:24,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:32:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:24,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712659246] [2019-12-18 23:32:24,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:32:24,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:32:24,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336144738] [2019-12-18 23:32:24,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:32:24,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:32:24,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:32:24,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:32:24,497 INFO L87 Difference]: Start difference. First operand 11672 states and 31707 transitions. Second operand 4 states. [2019-12-18 23:32:24,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:32:24,564 INFO L93 Difference]: Finished difference Result 11918 states and 32061 transitions. [2019-12-18 23:32:24,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:32:24,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-18 23:32:24,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:32:24,591 INFO L225 Difference]: With dead ends: 11918 [2019-12-18 23:32:24,591 INFO L226 Difference]: Without dead ends: 11312 [2019-12-18 23:32:24,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:32:24,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11312 states. [2019-12-18 23:32:24,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11312 to 10268. [2019-12-18 23:32:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10268 states. [2019-12-18 23:32:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 27635 transitions. [2019-12-18 23:32:24,844 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 27635 transitions. Word has length 99 [2019-12-18 23:32:24,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:32:24,845 INFO L462 AbstractCegarLoop]: Abstraction has 10268 states and 27635 transitions. [2019-12-18 23:32:24,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:32:24,845 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 27635 transitions. [2019-12-18 23:32:24,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-18 23:32:24,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:32:24,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:32:24,862 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:32:24,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:32:24,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1815021150, now seen corresponding path program 1 times [2019-12-18 23:32:24,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:32:24,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662991072] [2019-12-18 23:32:24,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:32:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:25,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662991072] [2019-12-18 23:32:25,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:32:25,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:32:25,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570531714] [2019-12-18 23:32:25,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:32:25,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:32:25,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:32:25,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:32:25,043 INFO L87 Difference]: Start difference. First operand 10268 states and 27635 transitions. Second operand 3 states. [2019-12-18 23:32:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:32:25,062 INFO L93 Difference]: Finished difference Result 1808 states and 4120 transitions. [2019-12-18 23:32:25,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:32:25,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-12-18 23:32:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:32:25,065 INFO L225 Difference]: With dead ends: 1808 [2019-12-18 23:32:25,065 INFO L226 Difference]: Without dead ends: 1544 [2019-12-18 23:32:25,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:32:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2019-12-18 23:32:25,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1424. [2019-12-18 23:32:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1424 states. [2019-12-18 23:32:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 3200 transitions. [2019-12-18 23:32:25,090 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 3200 transitions. Word has length 116 [2019-12-18 23:32:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:32:25,090 INFO L462 AbstractCegarLoop]: Abstraction has 1424 states and 3200 transitions. [2019-12-18 23:32:25,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:32:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 3200 transitions. [2019-12-18 23:32:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-18 23:32:25,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:32:25,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:32:25,094 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:32:25,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:32:25,094 INFO L82 PathProgramCache]: Analyzing trace with hash -206631209, now seen corresponding path program 1 times [2019-12-18 23:32:25,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:32:25,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886522030] [2019-12-18 23:32:25,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:32:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:25,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886522030] [2019-12-18 23:32:25,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910215882] [2019-12-18 23:32:25,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:25,285 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-18 23:32:25,294 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:32:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:25,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:32:25,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 23:32:25,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442884120] [2019-12-18 23:32:25,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:32:25,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:32:25,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:32:25,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:32:25,351 INFO L87 Difference]: Start difference. First operand 1424 states and 3200 transitions. Second operand 7 states. [2019-12-18 23:32:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:32:25,401 INFO L93 Difference]: Finished difference Result 2240 states and 5060 transitions. [2019-12-18 23:32:25,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:32:25,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 138 [2019-12-18 23:32:25,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:32:25,409 INFO L225 Difference]: With dead ends: 2240 [2019-12-18 23:32:25,409 INFO L226 Difference]: Without dead ends: 2240 [2019-12-18 23:32:25,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:32:25,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-18 23:32:25,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1844. [2019-12-18 23:32:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2019-12-18 23:32:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 4157 transitions. [2019-12-18 23:32:25,459 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 4157 transitions. Word has length 138 [2019-12-18 23:32:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:32:25,459 INFO L462 AbstractCegarLoop]: Abstraction has 1844 states and 4157 transitions. [2019-12-18 23:32:25,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:32:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 4157 transitions. [2019-12-18 23:32:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-18 23:32:25,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:32:25,465 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:32:25,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:25,668 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:32:25,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:32:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1577960977, now seen corresponding path program 2 times [2019-12-18 23:32:25,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:32:25,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196217204] [2019-12-18 23:32:25,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:32:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:25,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196217204] [2019-12-18 23:32:25,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765363971] [2019-12-18 23:32:25,847 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:26,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:32:26,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:32:26,004 INFO L264 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:32:26,011 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:32:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:26,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:32:26,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 23:32:26,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687857920] [2019-12-18 23:32:26,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:32:26,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:32:26,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:32:26,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:32:26,389 INFO L87 Difference]: Start difference. First operand 1844 states and 4157 transitions. Second operand 9 states. [2019-12-18 23:32:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:32:26,485 INFO L93 Difference]: Finished difference Result 2660 states and 6017 transitions. [2019-12-18 23:32:26,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:32:26,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-12-18 23:32:26,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:32:26,491 INFO L225 Difference]: With dead ends: 2660 [2019-12-18 23:32:26,491 INFO L226 Difference]: Without dead ends: 2660 [2019-12-18 23:32:26,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:32:26,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2019-12-18 23:32:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2264. [2019-12-18 23:32:26,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-12-18 23:32:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 5114 transitions. [2019-12-18 23:32:26,529 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 5114 transitions. Word has length 167 [2019-12-18 23:32:26,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:32:26,530 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 5114 transitions. [2019-12-18 23:32:26,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:32:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 5114 transitions. [2019-12-18 23:32:26,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-12-18 23:32:26,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:32:26,537 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:32:26,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:26,741 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:32:26,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:32:26,742 INFO L82 PathProgramCache]: Analyzing trace with hash -834842345, now seen corresponding path program 3 times [2019-12-18 23:32:26,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:32:26,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403462751] [2019-12-18 23:32:26,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:32:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:26,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403462751] [2019-12-18 23:32:26,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739169673] [2019-12-18 23:32:26,882 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:27,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 23:32:27,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:32:27,063 INFO L264 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 66 conjunts are in the unsatisfiable core [2019-12-18 23:32:27,071 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:32:27,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-18 23:32:27,113 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:27,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:27,119 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:27,119 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-18 23:32:27,152 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:27,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-18 23:32:27,153 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:27,157 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:27,158 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:27,158 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-18 23:32:27,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-18 23:32:27,289 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:27,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:27,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:27,297 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-18 23:32:27,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:32:27,332 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:27,340 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:27,341 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:27,341 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-18 23:32:27,438 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:32:27,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:27,451 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:32:27,452 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:27,481 INFO L614 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2019-12-18 23:32:27,482 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:27,482 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-18 23:32:27,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:32:27,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:32:27,512 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:27,524 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:27,525 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:27,525 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-18 23:32:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-18 23:32:27,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-18 23:32:27,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2019-12-18 23:32:27,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803599250] [2019-12-18 23:32:27,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:32:27,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:32:27,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:32:27,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:32:27,645 INFO L87 Difference]: Start difference. First operand 2264 states and 5114 transitions. Second operand 13 states. [2019-12-18 23:32:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:32:28,297 INFO L93 Difference]: Finished difference Result 3701 states and 8378 transitions. [2019-12-18 23:32:28,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:32:28,298 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 196 [2019-12-18 23:32:28,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:32:28,306 INFO L225 Difference]: With dead ends: 3701 [2019-12-18 23:32:28,306 INFO L226 Difference]: Without dead ends: 3701 [2019-12-18 23:32:28,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:32:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2019-12-18 23:32:28,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 3020. [2019-12-18 23:32:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3020 states. [2019-12-18 23:32:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 6827 transitions. [2019-12-18 23:32:28,359 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 6827 transitions. Word has length 196 [2019-12-18 23:32:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:32:28,360 INFO L462 AbstractCegarLoop]: Abstraction has 3020 states and 6827 transitions. [2019-12-18 23:32:28,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:32:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 6827 transitions. [2019-12-18 23:32:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-12-18 23:32:28,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:32:28,368 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:32:28,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:28,573 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:32:28,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:32:28,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1197311036, now seen corresponding path program 1 times [2019-12-18 23:32:28,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:32:28,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573024424] [2019-12-18 23:32:28,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:32:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:28,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573024424] [2019-12-18 23:32:28,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392185721] [2019-12-18 23:32:28,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:28,855 INFO L264 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:32:28,859 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:32:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:28,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:32:28,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-12-18 23:32:28,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425254045] [2019-12-18 23:32:28,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 23:32:28,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:32:28,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 23:32:28,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-18 23:32:28,916 INFO L87 Difference]: Start difference. First operand 3020 states and 6827 transitions. Second operand 11 states. [2019-12-18 23:32:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:32:29,061 INFO L93 Difference]: Finished difference Result 4460 states and 10091 transitions. [2019-12-18 23:32:29,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:32:29,062 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 200 [2019-12-18 23:32:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:32:29,077 INFO L225 Difference]: With dead ends: 4460 [2019-12-18 23:32:29,077 INFO L226 Difference]: Without dead ends: 4460 [2019-12-18 23:32:29,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:32:29,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2019-12-18 23:32:29,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 3764. [2019-12-18 23:32:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3764 states. [2019-12-18 23:32:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 8513 transitions. [2019-12-18 23:32:29,145 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 8513 transitions. Word has length 200 [2019-12-18 23:32:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:32:29,146 INFO L462 AbstractCegarLoop]: Abstraction has 3764 states and 8513 transitions. [2019-12-18 23:32:29,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 23:32:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 8513 transitions. [2019-12-18 23:32:29,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-12-18 23:32:29,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:32:29,155 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:32:29,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:29,359 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:32:29,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:32:29,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1476674553, now seen corresponding path program 2 times [2019-12-18 23:32:29,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:32:29,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620126204] [2019-12-18 23:32:29,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:32:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:29,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620126204] [2019-12-18 23:32:29,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191938022] [2019-12-18 23:32:29,634 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:29,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:32:29,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:32:29,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 23:32:29,866 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:32:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:29,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:32:29,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-12-18 23:32:29,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682796801] [2019-12-18 23:32:29,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:32:29,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:32:29,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:32:29,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:32:29,934 INFO L87 Difference]: Start difference. First operand 3764 states and 8513 transitions. Second operand 13 states. [2019-12-18 23:32:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:32:30,088 INFO L93 Difference]: Finished difference Result 5204 states and 11777 transitions. [2019-12-18 23:32:30,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 23:32:30,088 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 233 [2019-12-18 23:32:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:32:30,093 INFO L225 Difference]: With dead ends: 5204 [2019-12-18 23:32:30,093 INFO L226 Difference]: Without dead ends: 5204 [2019-12-18 23:32:30,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-12-18 23:32:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2019-12-18 23:32:30,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4508. [2019-12-18 23:32:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4508 states. [2019-12-18 23:32:30,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 10199 transitions. [2019-12-18 23:32:30,178 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 10199 transitions. Word has length 233 [2019-12-18 23:32:30,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:32:30,179 INFO L462 AbstractCegarLoop]: Abstraction has 4508 states and 10199 transitions. [2019-12-18 23:32:30,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:32:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 10199 transitions. [2019-12-18 23:32:30,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-12-18 23:32:30,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:32:30,193 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:32:30,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:30,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 23:32:30,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:32:30,398 INFO L82 PathProgramCache]: Analyzing trace with hash -308517151, now seen corresponding path program 3 times [2019-12-18 23:32:30,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:32:30,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109941689] [2019-12-18 23:32:30,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:32:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:30,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109941689] [2019-12-18 23:32:30,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181573805] [2019-12-18 23:32:30,716 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:31,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-18 23:32:31,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:32:31,132 INFO L264 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 67 conjunts are in the unsatisfiable core [2019-12-18 23:32:31,138 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:32:31,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-18 23:32:31,143 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,145 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:31,145 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,146 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-18 23:32:31,167 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:31,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-18 23:32:31,168 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,171 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:31,171 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,171 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-18 23:32:31,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-18 23:32:31,289 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:31,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,296 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-18 23:32:31,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:32:31,329 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,338 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:31,338 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,339 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-18 23:32:31,457 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:32:31,478 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:31,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:32:31,482 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,521 INFO L614 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2019-12-18 23:32:31,522 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,522 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-18 23:32:31,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:32:31,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:32:31,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,568 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:31,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,569 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-18 23:32:31,734 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-18 23:32:31,734 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,740 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:31,741 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,741 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2019-12-18 23:32:31,788 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:32:31,789 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:31,800 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,800 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:13 [2019-12-18 23:32:31,942 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:32:31,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:31,960 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:32:31,960 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,985 INFO L614 ElimStorePlain]: treesize reduction 26, result has 51.9 percent of original size [2019-12-18 23:32:31,985 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:31,986 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2019-12-18 23:32:32,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:32:32,022 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:32:32,023 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:32,033 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:32,034 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:32,034 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2019-12-18 23:32:32,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-18 23:32:32,041 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:32,045 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:32,046 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:32,046 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2019-12-18 23:32:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 160 proven. 90 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-18 23:32:32,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:32:32,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 32 [2019-12-18 23:32:32,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485330530] [2019-12-18 23:32:32,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-18 23:32:32,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:32:32,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-18 23:32:32,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:32:32,218 INFO L87 Difference]: Start difference. First operand 4508 states and 10199 transitions. Second operand 32 states. [2019-12-18 23:32:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:32:39,416 INFO L93 Difference]: Finished difference Result 9594 states and 21721 transitions. [2019-12-18 23:32:39,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-12-18 23:32:39,416 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 262 [2019-12-18 23:32:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:32:39,425 INFO L225 Difference]: With dead ends: 9594 [2019-12-18 23:32:39,425 INFO L226 Difference]: Without dead ends: 9594 [2019-12-18 23:32:39,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 348 SyntacticMatches, 3 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7033 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3481, Invalid=16259, Unknown=0, NotChecked=0, Total=19740 [2019-12-18 23:32:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9594 states. [2019-12-18 23:32:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9594 to 7016. [2019-12-18 23:32:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7016 states. [2019-12-18 23:32:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 15866 transitions. [2019-12-18 23:32:39,548 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 15866 transitions. Word has length 262 [2019-12-18 23:32:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:32:39,548 INFO L462 AbstractCegarLoop]: Abstraction has 7016 states and 15866 transitions. [2019-12-18 23:32:39,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-18 23:32:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 15866 transitions. [2019-12-18 23:32:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-12-18 23:32:39,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:32:39,560 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:32:39,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:39,764 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:32:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:32:39,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1631031548, now seen corresponding path program 4 times [2019-12-18 23:32:39,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:32:39,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201979965] [2019-12-18 23:32:39,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:32:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:40,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201979965] [2019-12-18 23:32:40,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893886463] [2019-12-18 23:32:40,108 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:40,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:32:40,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:32:40,862 INFO L264 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-18 23:32:40,866 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:32:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:40,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:32:40,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-12-18 23:32:41,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757708543] [2019-12-18 23:32:41,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 23:32:41,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:32:41,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 23:32:41,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:32:41,033 INFO L87 Difference]: Start difference. First operand 7016 states and 15866 transitions. Second operand 17 states. [2019-12-18 23:32:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:32:41,281 INFO L93 Difference]: Finished difference Result 9224 states and 20858 transitions. [2019-12-18 23:32:41,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 23:32:41,281 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 295 [2019-12-18 23:32:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:32:41,293 INFO L225 Difference]: With dead ends: 9224 [2019-12-18 23:32:41,293 INFO L226 Difference]: Without dead ends: 9224 [2019-12-18 23:32:41,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:32:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9224 states. [2019-12-18 23:32:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9224 to 8156. [2019-12-18 23:32:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8156 states. [2019-12-18 23:32:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 18443 transitions. [2019-12-18 23:32:41,442 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 18443 transitions. Word has length 295 [2019-12-18 23:32:41,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:32:41,443 INFO L462 AbstractCegarLoop]: Abstraction has 8156 states and 18443 transitions. [2019-12-18 23:32:41,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 23:32:41,443 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 18443 transitions. [2019-12-18 23:32:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-12-18 23:32:41,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:32:41,461 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:32:41,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:41,669 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:32:41,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:32:41,670 INFO L82 PathProgramCache]: Analyzing trace with hash -697021545, now seen corresponding path program 5 times [2019-12-18 23:32:41,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:32:41,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565551683] [2019-12-18 23:32:41,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:32:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:32:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:42,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565551683] [2019-12-18 23:32:42,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082758952] [2019-12-18 23:32:42,107 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:32:42,641 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-18 23:32:42,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:32:42,648 INFO L264 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 125 conjunts are in the unsatisfiable core [2019-12-18 23:32:42,657 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:32:42,697 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-18 23:32:42,697 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:42,699 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:42,699 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:42,699 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-18 23:32:42,742 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:42,743 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 62 [2019-12-18 23:32:42,744 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:42,775 INFO L614 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2019-12-18 23:32:42,776 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:32:42,776 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2019-12-18 23:32:42,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:42,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:43,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:43,075 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:43,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-12-18 23:32:43,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:43,077 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:43,082 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:32:43,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:43,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:32:43,104 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:43,197 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-18 23:32:43,198 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:32:43,199 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-18 23:32:43,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:43,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:32:43,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:32:43,255 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:43,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-18 23:32:43,266 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:43,300 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:43,301 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:32:43,302 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-18 23:32:43,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:43,460 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 23:32:43,461 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2019-12-18 23:32:43,471 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:43,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:43,495 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:32:43,496 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:34 [2019-12-18 23:32:43,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:43,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-18 23:32:43,545 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:43,577 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:43,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 62 [2019-12-18 23:32:43,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:43,580 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:43,644 INFO L614 ElimStorePlain]: treesize reduction 23, result has 75.8 percent of original size [2019-12-18 23:32:43,645 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 23:32:43,646 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:48 [2019-12-18 23:32:43,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-18 23:32:43,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:44,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:44,073 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:44,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-12-18 23:32:44,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:44,075 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:44,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:32:44,104 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:44,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:32:44,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:44,107 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:44,235 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-12-18 23:32:44,237 INFO L614 ElimStorePlain]: treesize reduction 54, result has 64.5 percent of original size [2019-12-18 23:32:44,238 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:32:44,238 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-18 23:32:44,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:44,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-18 23:32:44,290 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:44,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:32:44,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:32:44,299 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:44,351 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:44,352 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:32:44,352 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-18 23:32:44,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:44,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:32:44,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, 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 11 [2019-12-18 23:32:44,496 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:44,501 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 23:32:44,502 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:44,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:44,514 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:32:44,514 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:34 [2019-12-18 23:32:44,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:44,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-18 23:32:44,577 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:44,609 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:44,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 62 [2019-12-18 23:32:44,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:44,612 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:44,684 INFO L614 ElimStorePlain]: treesize reduction 23, result has 75.8 percent of original size [2019-12-18 23:32:44,685 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 23:32:44,686 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:48 [2019-12-18 23:32:44,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-18 23:32:44,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:45,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:45,024 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:32:45,027 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:32:45,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:45,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:32:45,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:45,050 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:45,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:45,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2019-12-18 23:32:45,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:45,072 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-18 23:32:45,165 INFO L614 ElimStorePlain]: treesize reduction 52, result has 63.9 percent of original size [2019-12-18 23:32:45,166 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:32:45,166 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:48 [2019-12-18 23:32:45,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:45,215 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-18 23:32:45,215 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:45,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:32:45,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:32:45,227 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:45,265 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:45,265 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:32:45,266 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-18 23:32:45,486 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2019-12-18 23:32:45,486 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:45,496 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:45,497 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:45,497 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-18 23:32:45,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:32:45,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:32:45,553 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:45,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:45,572 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:45,572 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-18 23:32:45,856 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:32:45,873 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:45,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:32:45,874 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:45,921 INFO L614 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2019-12-18 23:32:45,922 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:45,923 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 23:32:45,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:32:45,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:32:45,981 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:45,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:45,999 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:45,999 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 23:32:46,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 23:32:46,148 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:46,163 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:46,164 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:46,164 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 23:32:46,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:32:46,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:32:46,216 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:46,230 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:46,231 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:46,231 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-18 23:32:46,566 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:32:46,576 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:46,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:32:46,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:46,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:46,627 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-18 23:32:46,628 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:46,628 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 23:32:46,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:32:46,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 23:32:46,698 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:46,717 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:46,717 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:46,718 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 23:32:47,026 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 23:32:47,027 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:47,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:47,051 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:47,051 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:34 [2019-12-18 23:32:47,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:32:47,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:32:47,113 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:47,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:47,126 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:32:47,126 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-18 23:32:47,424 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:47,424 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 31 treesize of output 49 [2019-12-18 23:32:47,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:47,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:47,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:32:47,429 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:32:47,450 INFO L614 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2019-12-18 23:32:47,451 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:47,451 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:9 [2019-12-18 23:32:47,465 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-18 23:32:47,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:32:47,466 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:47,473 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:47,473 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:47,474 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-12-18 23:32:47,478 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-18 23:32:47,478 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:32:47,479 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:32:47,480 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:32:47,480 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-18 23:32:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 354 proven. 262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:32:48,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:32:48,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 52] total 67 [2019-12-18 23:32:48,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130699558] [2019-12-18 23:32:48,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-12-18 23:32:48,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:32:48,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-12-18 23:32:48,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=586, Invalid=3836, Unknown=0, NotChecked=0, Total=4422 [2019-12-18 23:32:48,007 INFO L87 Difference]: Start difference. First operand 8156 states and 18443 transitions. Second operand 67 states. [2019-12-18 23:32:52,211 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-18 23:32:54,277 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-18 23:32:55,868 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-12-18 23:32:58,443 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-18 23:33:03,069 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-18 23:33:04,128 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-18 23:33:12,098 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-18 23:33:17,876 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-18 23:33:18,077 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-12-18 23:33:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:33:34,596 INFO L93 Difference]: Finished difference Result 29282 states and 66884 transitions. [2019-12-18 23:33:34,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 387 states. [2019-12-18 23:33:34,597 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 328 [2019-12-18 23:33:34,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:33:34,620 INFO L225 Difference]: With dead ends: 29282 [2019-12-18 23:33:34,620 INFO L226 Difference]: Without dead ends: 29282 [2019-12-18 23:33:34,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1041 GetRequests, 581 SyntacticMatches, 17 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90147 ImplicationChecksByTransitivity, 39.7s TimeCoverageRelationStatistics Valid=22228, Invalid=175352, Unknown=0, NotChecked=0, Total=197580 [2019-12-18 23:33:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29282 states. [2019-12-18 23:33:35,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29282 to 19266. [2019-12-18 23:33:35,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19266 states. [2019-12-18 23:33:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19266 states to 19266 states and 43952 transitions. [2019-12-18 23:33:35,097 INFO L78 Accepts]: Start accepts. Automaton has 19266 states and 43952 transitions. Word has length 328 [2019-12-18 23:33:35,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:33:35,097 INFO L462 AbstractCegarLoop]: Abstraction has 19266 states and 43952 transitions. [2019-12-18 23:33:35,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-12-18 23:33:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 19266 states and 43952 transitions. [2019-12-18 23:33:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-12-18 23:33:35,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:33:35,122 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:33:35,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:33:35,328 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:33:35,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:33:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash -543563556, now seen corresponding path program 6 times [2019-12-18 23:33:35,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:33:35,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085882582] [2019-12-18 23:33:35,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:33:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:33:35,707 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 0 proven. 830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:33:35,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085882582] [2019-12-18 23:33:35,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987626032] [2019-12-18 23:33:35,708 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:33:42,022 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-18 23:33:42,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:33:42,029 INFO L264 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 63 conjunts are in the unsatisfiable core [2019-12-18 23:33:42,036 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:33:42,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-18 23:33:42,040 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:33:42,042 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:33:42,043 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:33:42,043 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-18 23:33:42,077 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:33:42,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-18 23:33:42,078 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:33:42,099 INFO L614 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-12-18 23:33:42,099 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:33:42,100 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-12-18 23:33:42,134 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:33:42,135 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-12-18 23:33:42,136 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:33:42,144 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:33:42,144 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:33:42,145 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-12-18 23:33:42,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-18 23:33:42,221 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:33:42,235 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:33:42,235 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:33:42,235 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-12-18 23:33:42,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:33:42,274 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 23 treesize of output 22 [2019-12-18 23:33:42,275 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:33:42,287 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:33:42,288 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:33:42,288 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-12-18 23:33:42,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:33:42,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-12-18 23:33:42,369 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:33:42,386 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:33:42,386 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:33:42,387 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2019-12-18 23:33:42,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:33:42,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:33:42,635 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:33:42,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:33:42,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 109 [2019-12-18 23:33:42,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:33:42,752 INFO L614 ElimStorePlain]: treesize reduction 60, result has 50.4 percent of original size [2019-12-18 23:33:42,753 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:33:42,753 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:47 [2019-12-18 23:33:42,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:33:42,804 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:33:42,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-12-18 23:33:42,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:33:42,824 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:33:42,825 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:33:42,825 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:38 [2019-12-18 23:33:43,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2019-12-18 23:33:43,007 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:33:43,022 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:33:43,023 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:33:43,024 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:32 [2019-12-18 23:33:43,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-12-18 23:33:43,100 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:33:43,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:33:43,120 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:33:43,120 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:47, output treesize:24 [2019-12-18 23:33:43,457 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:33:43,472 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:33:43,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 67 [2019-12-18 23:33:43,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:33:43,474 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:33:43,519 INFO L614 ElimStorePlain]: treesize reduction 35, result has 57.3 percent of original size [2019-12-18 23:33:43,520 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:33:43,521 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:51, output treesize:27 [2019-12-18 23:33:43,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:33:43,581 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 23:33:43,582 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:33:43,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:33:43,595 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 23:33:43,595 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:27 [2019-12-18 23:33:43,603 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-12-18 23:33:43,604 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:33:43,611 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:33:43,611 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 23:33:43,611 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2019-12-18 23:33:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 310 proven. 19 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2019-12-18 23:33:44,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:33:44,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2019-12-18 23:33:44,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394886000] [2019-12-18 23:33:44,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-18 23:33:44,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:33:44,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-18 23:33:44,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 23:33:44,115 INFO L87 Difference]: Start difference. First operand 19266 states and 43952 transitions. Second operand 40 states. [2019-12-18 23:33:45,497 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-12-18 23:33:45,687 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-18 23:33:46,352 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-12-18 23:33:46,518 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-12-18 23:33:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:33:49,660 INFO L93 Difference]: Finished difference Result 24976 states and 56996 transitions. [2019-12-18 23:33:49,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-18 23:33:49,660 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 361 [2019-12-18 23:33:49,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:33:49,686 INFO L225 Difference]: With dead ends: 24976 [2019-12-18 23:33:49,687 INFO L226 Difference]: Without dead ends: 24976 [2019-12-18 23:33:49,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 381 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2316 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1754, Invalid=6802, Unknown=0, NotChecked=0, Total=8556 [2019-12-18 23:33:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24976 states. [2019-12-18 23:33:50,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24976 to 21612. [2019-12-18 23:33:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21612 states. [2019-12-18 23:33:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21612 states to 21612 states and 49348 transitions. [2019-12-18 23:33:50,039 INFO L78 Accepts]: Start accepts. Automaton has 21612 states and 49348 transitions. Word has length 361 [2019-12-18 23:33:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:33:50,039 INFO L462 AbstractCegarLoop]: Abstraction has 21612 states and 49348 transitions. [2019-12-18 23:33:50,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-18 23:33:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 21612 states and 49348 transitions. [2019-12-18 23:33:50,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-12-18 23:33:50,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:33:50,062 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:33:50,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:33:50,263 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:33:50,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:33:50,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2042829257, now seen corresponding path program 7 times [2019-12-18 23:33:50,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:33:50,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587339794] [2019-12-18 23:33:50,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:33:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:33:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:33:50,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587339794] [2019-12-18 23:33:50,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882581563] [2019-12-18 23:33:50,695 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:33:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:33:50,867 INFO L264 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-18 23:33:50,873 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:33:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1077 backedges. 0 proven. 1077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:33:51,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:33:51,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-12-18 23:33:51,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406935740] [2019-12-18 23:33:51,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:33:51,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:33:51,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:33:51,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:33:51,302 INFO L87 Difference]: Start difference. First operand 21612 states and 49348 transitions. Second operand 23 states. [2019-12-18 23:33:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:33:52,010 INFO L93 Difference]: Finished difference Result 28538 states and 65091 transitions. [2019-12-18 23:33:52,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 23:33:52,011 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 394 [2019-12-18 23:33:52,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:33:52,056 INFO L225 Difference]: With dead ends: 28538 [2019-12-18 23:33:52,056 INFO L226 Difference]: Without dead ends: 28538 [2019-12-18 23:33:52,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 23:33:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2019-12-18 23:33:52,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 25158. [2019-12-18 23:33:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25158 states. [2019-12-18 23:33:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25158 states to 25158 states and 57405 transitions. [2019-12-18 23:33:52,755 INFO L78 Accepts]: Start accepts. Automaton has 25158 states and 57405 transitions. Word has length 394 [2019-12-18 23:33:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:33:52,756 INFO L462 AbstractCegarLoop]: Abstraction has 25158 states and 57405 transitions. [2019-12-18 23:33:52,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:33:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 25158 states and 57405 transitions. [2019-12-18 23:33:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-12-18 23:33:52,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:33:52,791 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:33:52,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:33:52,997 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:33:52,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:33:52,997 INFO L82 PathProgramCache]: Analyzing trace with hash -126761620, now seen corresponding path program 8 times [2019-12-18 23:33:52,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:33:52,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276358813] [2019-12-18 23:33:52,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:33:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:33:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:33:53,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276358813] [2019-12-18 23:33:53,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542010460] [2019-12-18 23:33:53,773 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:33:53,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:33:53,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:33:53,977 INFO L264 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-18 23:33:53,983 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:33:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:33:54,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:33:54,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-12-18 23:33:54,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684756109] [2019-12-18 23:33:54,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-18 23:33:54,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:33:54,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-18 23:33:54,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:33:54,190 INFO L87 Difference]: Start difference. First operand 25158 states and 57405 transitions. Second operand 25 states. [2019-12-18 23:33:54,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:33:54,822 INFO L93 Difference]: Finished difference Result 32130 states and 73255 transitions. [2019-12-18 23:33:54,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 23:33:54,823 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 427 [2019-12-18 23:33:54,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:33:54,854 INFO L225 Difference]: With dead ends: 32130 [2019-12-18 23:33:54,854 INFO L226 Difference]: Without dead ends: 32130 [2019-12-18 23:33:54,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=631, Invalid=1349, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 23:33:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32130 states. [2019-12-18 23:33:55,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32130 to 28750. [2019-12-18 23:33:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28750 states. [2019-12-18 23:33:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28750 states to 28750 states and 65569 transitions. [2019-12-18 23:33:55,274 INFO L78 Accepts]: Start accepts. Automaton has 28750 states and 65569 transitions. Word has length 427 [2019-12-18 23:33:55,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:33:55,274 INFO L462 AbstractCegarLoop]: Abstraction has 28750 states and 65569 transitions. [2019-12-18 23:33:55,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-18 23:33:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 28750 states and 65569 transitions. [2019-12-18 23:33:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-12-18 23:33:55,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:33:55,315 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:33:55,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:33:55,519 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:33:55,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:33:55,520 INFO L82 PathProgramCache]: Analyzing trace with hash -265789225, now seen corresponding path program 9 times [2019-12-18 23:33:55,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:33:55,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358182718] [2019-12-18 23:33:55,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:33:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:33:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 0 proven. 1670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:33:56,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358182718] [2019-12-18 23:33:56,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108698893] [2019-12-18 23:33:56,548 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:34:54,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-18 23:34:54,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:34:54,758 INFO L264 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 117 conjunts are in the unsatisfiable core [2019-12-18 23:34:54,765 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:34:54,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-18 23:34:54,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:54,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:54,783 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:54,783 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-18 23:34:54,804 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:54,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-18 23:34:54,805 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:54,809 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:54,809 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:54,810 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-12-18 23:34:54,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-18 23:34:54,889 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:54,895 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:54,895 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:54,895 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-18 23:34:54,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:34:54,927 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:54,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:54,937 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:54,937 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-18 23:34:55,046 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:34:55,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:55,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:34:55,061 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,097 INFO L614 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2019-12-18 23:34:55,098 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,098 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2019-12-18 23:34:55,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:34:55,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:34:55,128 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,142 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:55,143 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,143 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-18 23:34:55,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-18 23:34:55,298 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:55,305 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,306 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2019-12-18 23:34:55,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 23:34:55,340 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,349 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:55,350 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,350 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-18 23:34:55,476 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:34:55,488 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:55,489 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:34:55,490 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,527 INFO L614 ElimStorePlain]: treesize reduction 26, result has 55.2 percent of original size [2019-12-18 23:34:55,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 23:34:55,528 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:23 [2019-12-18 23:34:55,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:34:55,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:34:55,568 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,581 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:55,581 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,582 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-18 23:34:55,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-18 23:34:55,758 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:55,766 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,766 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2019-12-18 23:34:55,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:34:55,804 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,815 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:55,816 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:55,816 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-12-18 23:34:55,958 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:34:55,972 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:55,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:34:55,974 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:56,004 INFO L614 ElimStorePlain]: treesize reduction 26, result has 55.2 percent of original size [2019-12-18 23:34:56,005 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:56,005 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:23 [2019-12-18 23:34:56,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:34:56,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:34:56,049 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:56,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:56,063 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:56,063 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2019-12-18 23:34:56,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-12-18 23:34:56,265 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:56,272 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:56,273 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:56,273 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2019-12-18 23:34:56,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:34:56,320 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:56,329 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:56,330 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:56,330 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:13 [2019-12-18 23:34:56,508 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:34:56,521 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:56,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:34:56,522 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:56,549 INFO L614 ElimStorePlain]: treesize reduction 26, result has 51.9 percent of original size [2019-12-18 23:34:56,549 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:56,550 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2019-12-18 23:34:56,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:34:56,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:34:56,600 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:56,611 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:56,612 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:56,612 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2019-12-18 23:34:56,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-18 23:34:56,636 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:34:56,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:34:56,645 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:34:56,645 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2019-12-18 23:34:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 1132 proven. 287 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2019-12-18 23:34:57,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:34:57,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2019-12-18 23:34:57,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599114668] [2019-12-18 23:34:57,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-12-18 23:34:57,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:34:57,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-12-18 23:34:57,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2773, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 23:34:57,313 INFO L87 Difference]: Start difference. First operand 28750 states and 65569 transitions. Second operand 56 states. [2019-12-18 23:35:18,141 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-12-18 23:35:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:35:25,251 INFO L93 Difference]: Finished difference Result 46514 states and 106373 transitions. [2019-12-18 23:35:25,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 374 states. [2019-12-18 23:35:25,251 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 460 [2019-12-18 23:35:25,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:35:25,294 INFO L225 Difference]: With dead ends: 46514 [2019-12-18 23:35:25,294 INFO L226 Difference]: Without dead ends: 46514 [2019-12-18 23:35:25,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1166 GetRequests, 734 SyntacticMatches, 7 SemanticMatches, 425 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80010 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=16978, Invalid=164924, Unknown=0, NotChecked=0, Total=181902 [2019-12-18 23:35:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46514 states. [2019-12-18 23:35:25,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46514 to 20536. [2019-12-18 23:35:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20536 states. [2019-12-18 23:35:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20536 states to 20536 states and 46511 transitions. [2019-12-18 23:35:25,935 INFO L78 Accepts]: Start accepts. Automaton has 20536 states and 46511 transitions. Word has length 460 [2019-12-18 23:35:25,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:35:25,935 INFO L462 AbstractCegarLoop]: Abstraction has 20536 states and 46511 transitions. [2019-12-18 23:35:25,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-12-18 23:35:25,935 INFO L276 IsEmpty]: Start isEmpty. Operand 20536 states and 46511 transitions. [2019-12-18 23:35:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-12-18 23:35:25,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:35:25,962 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 9, 9, 9, 9, 9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:35:26,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:35:26,176 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:35:26,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:35:26,177 INFO L82 PathProgramCache]: Analyzing trace with hash -415367242, now seen corresponding path program 10 times [2019-12-18 23:35:26,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:35:26,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929602347] [2019-12-18 23:35:26,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:35:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:35:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:35:26,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929602347] [2019-12-18 23:35:26,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982618844] [2019-12-18 23:35:26,704 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:35:31,275 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:35:31,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:35:31,281 INFO L264 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-18 23:35:31,286 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:35:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:35:31,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:35:31,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-12-18 23:35:31,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072576178] [2019-12-18 23:35:31,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-18 23:35:31,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:35:31,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-18 23:35:31,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2019-12-18 23:35:31,466 INFO L87 Difference]: Start difference. First operand 20536 states and 46511 transitions. Second operand 29 states. [2019-12-18 23:35:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:35:32,102 INFO L93 Difference]: Finished difference Result 24280 states and 54959 transitions. [2019-12-18 23:35:32,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 23:35:32,102 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 493 [2019-12-18 23:35:32,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:35:32,126 INFO L225 Difference]: With dead ends: 24280 [2019-12-18 23:35:32,126 INFO L226 Difference]: Without dead ends: 24280 [2019-12-18 23:35:32,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=875, Invalid=1881, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 23:35:32,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24280 states. [2019-12-18 23:35:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24280 to 22468. [2019-12-18 23:35:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22468 states. [2019-12-18 23:35:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22468 states to 22468 states and 50870 transitions. [2019-12-18 23:35:32,571 INFO L78 Accepts]: Start accepts. Automaton has 22468 states and 50870 transitions. Word has length 493 [2019-12-18 23:35:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:35:32,572 INFO L462 AbstractCegarLoop]: Abstraction has 22468 states and 50870 transitions. [2019-12-18 23:35:32,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-18 23:35:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 22468 states and 50870 transitions. [2019-12-18 23:35:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-12-18 23:35:32,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:35:32,594 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:35:32,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:35:32,794 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:35:32,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:35:32,795 INFO L82 PathProgramCache]: Analyzing trace with hash -394651699, now seen corresponding path program 11 times [2019-12-18 23:35:32,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:35:32,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746582755] [2019-12-18 23:35:32,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:35:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:35:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 0 proven. 2395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:35:33,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746582755] [2019-12-18 23:35:33,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093779649] [2019-12-18 23:35:33,446 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:35:39,250 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-12-18 23:35:39,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:35:39,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 217 conjunts are in the unsatisfiable core [2019-12-18 23:35:39,276 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:35:39,385 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2019-12-18 23:35:39,385 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:39,387 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:39,387 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:39,387 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:9 [2019-12-18 23:35:39,433 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:39,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 62 [2019-12-18 23:35:39,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:39,462 INFO L614 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2019-12-18 23:35:39,462 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:35:39,463 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2019-12-18 23:35:39,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:39,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:39,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:39,801 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:39,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 54 [2019-12-18 23:35:39,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:39,803 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:39,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:35:39,829 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:39,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:35:39,830 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:39,930 INFO L614 ElimStorePlain]: treesize reduction 49, result has 65.2 percent of original size [2019-12-18 23:35:39,931 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:35:39,932 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:48 [2019-12-18 23:35:39,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:39,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-18 23:35:39,984 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:39,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:39,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:39,996 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:40,029 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:40,030 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:35:40,030 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2019-12-18 23:35:40,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:40,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:40,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 32 treesize of output 16 [2019-12-18 23:35:40,363 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:40,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2019-12-18 23:35:40,369 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:40,388 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:40,389 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:35:40,389 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:44 [2019-12-18 23:35:40,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:40,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:40,471 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-12-18 23:35:40,471 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:40,502 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:40,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 62 [2019-12-18 23:35:40,503 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:40,571 INFO L614 ElimStorePlain]: treesize reduction 23, result has 78.1 percent of original size [2019-12-18 23:35:40,571 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 23:35:40,572 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:58 [2019-12-18 23:35:40,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-18 23:35:40,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:40,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:41,017 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:41,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2019-12-18 23:35:41,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:41,019 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:35:41,029 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:35:41,044 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:41,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:35:41,045 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:41,127 INFO L614 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2019-12-18 23:35:41,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:35:41,128 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-18 23:35:41,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:41,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:41,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:41,207 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:41,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-18 23:35:41,214 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:41,245 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:41,246 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:35:41,246 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 23:35:41,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:41,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:41,650 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2019-12-18 23:35:41,650 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:41,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-12-18 23:35:41,655 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:41,689 INFO L614 ElimStorePlain]: treesize reduction 11, result has 80.4 percent of original size [2019-12-18 23:35:41,690 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:35:41,690 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:45 [2019-12-18 23:35:41,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:41,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:41,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-12-18 23:35:41,772 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:41,806 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:41,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 62 [2019-12-18 23:35:41,807 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:41,875 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-18 23:35:41,876 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 23:35:41,876 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2019-12-18 23:35:41,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-18 23:35:42,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:42,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:42,436 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:42,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2019-12-18 23:35:42,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:42,438 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 23:35:42,443 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:35:42,461 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:42,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:35:42,462 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:42,540 INFO L614 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2019-12-18 23:35:42,541 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:35:42,541 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-18 23:35:42,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:42,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:42,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:42,625 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:42,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-18 23:35:42,632 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:42,671 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:42,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 23:35:42,672 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 23:35:43,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:43,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:43,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2019-12-18 23:35:43,133 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:43,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-12-18 23:35:43,138 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:43,151 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:43,151 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:35:43,152 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:45 [2019-12-18 23:35:43,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:43,483 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:43,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 62 [2019-12-18 23:35:43,484 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:43,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:43,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-12-18 23:35:43,493 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:43,561 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-18 23:35:43,562 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 23:35:43,562 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2019-12-18 23:35:43,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-18 23:35:43,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:44,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:44,118 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:35:44,122 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:35:44,139 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:44,139 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:35:44,140 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:44,161 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:44,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2019-12-18 23:35:44,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:44,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:44,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:44,164 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-18 23:35:44,275 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-18 23:35:44,276 INFO L614 ElimStorePlain]: treesize reduction 67, result has 55.6 percent of original size [2019-12-18 23:35:44,276 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:35:44,277 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-18 23:35:44,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:44,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-18 23:35:44,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:44,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:44,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:44,380 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:44,415 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:44,416 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:35:44,416 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 23:35:44,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:44,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:44,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2019-12-18 23:35:44,941 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:44,949 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-12-18 23:35:44,949 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:44,965 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:44,965 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:35:44,965 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:45 [2019-12-18 23:35:45,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:45,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:45,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-12-18 23:35:45,073 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:45,107 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:45,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 62 [2019-12-18 23:35:45,108 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:45,178 INFO L614 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-12-18 23:35:45,178 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-18 23:35:45,179 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2019-12-18 23:35:45,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-18 23:35:45,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:45,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:45,972 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:35:45,974 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:35:45,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:45,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2019-12-18 23:35:45,995 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:46,016 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:46,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 46 [2019-12-18 23:35:46,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:46,018 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-12-18 23:35:46,102 INFO L614 ElimStorePlain]: treesize reduction 53, result has 61.3 percent of original size [2019-12-18 23:35:46,102 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:35:46,103 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2019-12-18 23:35:46,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:46,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-18 23:35:46,213 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:46,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:46,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:46,224 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:46,263 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:46,264 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-18 23:35:46,264 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2019-12-18 23:35:46,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2019-12-18 23:35:46,636 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:46,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:46,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:46,663 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2019-12-18 23:35:46,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:46,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:46,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:46,826 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:46,827 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:46,827 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-18 23:35:47,507 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:35:47,523 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:47,523 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:35:47,524 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:47,571 INFO L614 ElimStorePlain]: treesize reduction 30, result has 64.3 percent of original size [2019-12-18 23:35:47,572 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:47,572 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 23:35:47,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:47,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:47,694 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:47,711 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:47,712 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:47,712 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 23:35:48,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 23:35:48,020 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:48,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:48,036 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:48,037 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 23:35:48,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:48,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:48,139 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:48,153 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:48,153 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:48,154 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-18 23:35:48,758 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:35:48,788 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:48,788 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:35:48,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:48,789 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:48,858 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-18 23:35:48,858 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:48,859 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 23:35:49,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:49,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:49,059 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:49,078 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:49,078 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:49,079 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 23:35:49,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 23:35:49,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:49,705 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:49,705 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:49,706 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 23:35:49,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:49,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:49,816 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:49,827 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:49,828 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:49,828 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-18 23:35:50,482 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:35:50,497 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:50,497 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:35:50,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:50,498 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:50,547 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-18 23:35:50,547 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:50,548 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 23:35:50,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:50,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:50,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:50,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:50,708 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:50,709 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 23:35:51,338 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 23:35:51,339 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:51,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:51,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:51,354 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 23:35:51,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:51,470 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:51,470 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:51,485 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:51,486 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:51,486 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2019-12-18 23:35:52,173 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 23:35:52,190 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:52,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:35:52,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:52,192 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:52,245 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-18 23:35:52,246 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:52,246 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2019-12-18 23:35:52,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:52,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:52,397 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:52,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:52,418 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:52,418 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2019-12-18 23:35:53,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-12-18 23:35:53,088 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:53,102 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:53,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:53,103 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2019-12-18 23:35:53,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 23:35:53,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:53,224 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:53,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:53,238 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 23:35:53,238 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:19 [2019-12-18 23:35:53,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:53,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 57 [2019-12-18 23:35:53,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 23:35:53,858 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:53,881 INFO L614 ElimStorePlain]: treesize reduction 35, result has 46.2 percent of original size [2019-12-18 23:35:53,882 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:53,882 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-12-18 23:35:53,899 INFO L343 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2019-12-18 23:35:53,899 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2019-12-18 23:35:53,900 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:53,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:53,911 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:53,911 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2019-12-18 23:35:53,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-18 23:35:53,915 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 23:35:53,917 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 23:35:53,917 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 23:35:53,918 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-18 23:35:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2395 backedges. 1568 proven. 813 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-18 23:35:55,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:35:55,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 100] total 127 [2019-12-18 23:35:55,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525114570] [2019-12-18 23:35:55,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-12-18 23:35:55,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:35:55,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-12-18 23:35:55,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=14594, Unknown=0, NotChecked=0, Total=16002 [2019-12-18 23:35:55,482 INFO L87 Difference]: Start difference. First operand 22468 states and 50870 transitions. Second operand 127 states. [2019-12-18 23:36:01,739 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-18 23:36:06,244 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-18 23:36:11,343 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-18 23:36:18,307 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-18 23:36:19,565 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-18 23:36:19,722 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-18 23:36:20,372 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-18 23:36:20,709 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-18 23:36:26,468 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 Received shutdown request... [2019-12-18 23:36:28,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-12-18 23:36:28,954 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:36:28,954 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 23:36:28,961 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 23:36:28,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:36:28 BasicIcfg [2019-12-18 23:36:28,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:36:28,963 INFO L168 Benchmark]: Toolchain (without parser) took 253451.58 ms. Allocated memory was 140.0 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 103.0 MB in the beginning and 821.0 MB in the end (delta: -718.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 23:36:28,963 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 23:36:28,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1050.26 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.6 MB in the beginning and 133.9 MB in the end (delta: -31.3 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. [2019-12-18 23:36:28,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.05 ms. Allocated memory is still 203.9 MB. Free memory was 133.9 MB in the beginning and 131.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 23:36:28,964 INFO L168 Benchmark]: Boogie Preprocessor took 48.21 ms. Allocated memory is still 203.9 MB. Free memory was 131.0 MB in the beginning and 129.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 23:36:28,964 INFO L168 Benchmark]: RCFGBuilder took 716.83 ms. Allocated memory was 203.9 MB in the beginning and 233.3 MB in the end (delta: 29.4 MB). Free memory was 129.1 MB in the beginning and 197.2 MB in the end (delta: -68.2 MB). Peak memory consumption was 42.1 MB. Max. memory is 7.1 GB. [2019-12-18 23:36:28,965 INFO L168 Benchmark]: TraceAbstraction took 251508.09 ms. Allocated memory was 233.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 197.2 MB in the beginning and 821.0 MB in the end (delta: -623.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 23:36:28,966 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1050.26 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.6 MB in the beginning and 133.9 MB in the end (delta: -31.3 MB). Peak memory consumption was 37.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 123.05 ms. Allocated memory is still 203.9 MB. Free memory was 133.9 MB in the beginning and 131.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.21 ms. Allocated memory is still 203.9 MB. Free memory was 131.0 MB in the beginning and 129.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 716.83 ms. Allocated memory was 203.9 MB in the beginning and 233.3 MB in the end (delta: 29.4 MB). Free memory was 129.1 MB in the beginning and 197.2 MB in the end (delta: -68.2 MB). Peak memory consumption was 42.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251508.09 ms. Allocated memory was 233.3 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 197.2 MB in the beginning and 821.0 MB in the end (delta: -623.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (22468states) and FLOYD_HOARE automaton (currently 244 states, 127 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 368 known predicates. - TimeoutResultAtElement [Line: 1014]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1014). Cancelled while BasicCegarLoop was constructing difference of abstraction (22468states) and FLOYD_HOARE automaton (currently 244 states, 127 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 368 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 190 locations, 2 error locations. Result: TIMEOUT, OverallTime: 251.3s, OverallIterations: 19, TraceHistogramMax: 13, AutomataDifference: 127.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4241 SDtfs, 55854 SDslu, 51978 SDs, 0 SdLazy, 25489 SolverSat, 6036 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7126 GetRequests, 5316 SyntacticMatches, 49 SemanticMatches, 1760 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234560 ImplicationChecksByTransitivity, 110.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28750occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 56989 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 77.1s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 9414 NumberOfCodeBlocks, 8944 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 9381 ConstructedInterpolants, 60 QuantifiedInterpolants, 18905800 SizeOfPredicates, 451 NumberOfNonLiveVariables, 7528 ConjunctsInSsa, 765 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 4417/22130 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown