/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:34:18,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:34:18,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:34:18,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:34:18,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:34:18,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:34:18,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:34:18,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:34:18,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:34:18,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:34:18,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:34:18,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:34:18,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:34:18,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:34:18,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:34:18,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:34:18,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:34:18,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:34:18,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:34:18,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:34:18,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:34:18,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:34:18,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:34:18,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:34:18,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:34:18,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:34:18,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:34:18,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:34:18,398 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:34:18,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:34:18,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:34:18,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:34:18,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:34:18,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:34:18,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:34:18,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:34:18,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:34:18,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:34:18,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:34:18,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:34:18,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:34:18,406 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:34:18,426 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:34:18,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:34:18,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:34:18,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:34:18,429 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:34:18,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:34:18,430 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:34:18,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:34:18,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:34:18,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:34:18,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:34:18,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:34:18,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:34:18,432 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:34:18,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:34:18,432 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:34:18,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:34:18,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:34:18,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:34:18,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:34:18,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:34:18,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:34:18,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:34:18,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:34:18,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:34:18,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:34:18,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:34:18,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:34:18,435 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:34:18,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:34:18,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:34:18,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:34:18,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:34:18,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:34:18,716 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:34:18,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2019-12-27 00:34:18,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb0c6453d/e05207e3cde44c75a1a3855851f069b2/FLAGfbbd73771 [2019-12-27 00:34:19,341 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:34:19,342 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2019-12-27 00:34:19,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb0c6453d/e05207e3cde44c75a1a3855851f069b2/FLAGfbbd73771 [2019-12-27 00:34:19,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb0c6453d/e05207e3cde44c75a1a3855851f069b2 [2019-12-27 00:34:19,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:34:19,611 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:34:19,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:34:19,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:34:19,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:34:19,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:34:19" (1/1) ... [2019-12-27 00:34:19,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ede25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:19, skipping insertion in model container [2019-12-27 00:34:19,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:34:19" (1/1) ... [2019-12-27 00:34:19,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:34:19,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:34:19,892 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 00:34:20,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:34:20,262 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:34:20,278 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 00:34:20,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:34:20,445 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:34:20,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:20 WrapperNode [2019-12-27 00:34:20,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:34:20,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:34:20,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:34:20,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:34:20,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:20" (1/1) ... [2019-12-27 00:34:20,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:20" (1/1) ... [2019-12-27 00:34:20,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:34:20,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:34:20,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:34:20,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:34:20,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:20" (1/1) ... [2019-12-27 00:34:20,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:20" (1/1) ... [2019-12-27 00:34:20,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:20" (1/1) ... [2019-12-27 00:34:20,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:20" (1/1) ... [2019-12-27 00:34:20,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:20" (1/1) ... [2019-12-27 00:34:20,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:20" (1/1) ... [2019-12-27 00:34:20,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:20" (1/1) ... [2019-12-27 00:34:20,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:34:20,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:34:20,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:34:20,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:34:20,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:20" (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-27 00:34:20,656 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2019-12-27 00:34:20,656 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2019-12-27 00:34:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:34:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:34:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 00:34:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:34:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:34:20,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:34:20,659 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 00:34:21,161 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:34:21,161 INFO L287 CfgBuilder]: Removed 19 assume(true) statements. [2019-12-27 00:34:21,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:34:21 BoogieIcfgContainer [2019-12-27 00:34:21,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:34:21,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:34:21,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:34:21,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:34:21,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:34:19" (1/3) ... [2019-12-27 00:34:21,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201c182f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:34:21, skipping insertion in model container [2019-12-27 00:34:21,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:34:20" (2/3) ... [2019-12-27 00:34:21,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@201c182f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:34:21, skipping insertion in model container [2019-12-27 00:34:21,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:34:21" (3/3) ... [2019-12-27 00:34:21,171 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2019-12-27 00:34:21,178 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:34:21,179 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:34:21,185 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-12-27 00:34:21,186 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:34:21,222 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,223 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,223 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,223 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,223 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,224 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,224 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,224 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,225 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,225 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,225 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,225 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,226 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,226 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,226 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,227 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,227 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,227 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,227 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,227 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,228 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,228 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,228 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,228 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,229 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,229 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,229 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,229 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,229 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,230 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,230 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,230 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,230 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,230 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,231 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,231 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,231 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,231 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,231 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,231 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,232 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,232 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,232 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,232 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,233 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,233 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,233 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,233 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,233 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,234 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,234 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,234 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,234 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,234 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,235 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,235 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,235 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,235 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,235 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,236 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,236 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,236 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,236 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,237 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,237 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,237 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,237 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,238 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,238 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,238 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,238 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,239 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,239 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,239 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,239 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,240 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,240 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,240 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,240 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,240 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,241 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,241 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,241 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,241 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,242 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,242 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,242 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,242 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,242 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,243 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,243 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,243 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,243 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,243 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,244 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,244 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,244 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,244 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,245 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,245 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,245 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,245 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,245 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,246 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,246 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,246 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,246 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,247 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,247 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,247 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,247 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,248 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,248 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,248 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,248 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,249 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,249 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,249 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,249 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,250 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,250 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,250 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,250 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,251 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,251 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,251 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,251 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,252 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,256 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,256 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,257 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,257 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,257 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,257 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,258 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,258 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,258 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,258 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,259 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,259 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,259 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,259 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,259 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,260 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,260 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,260 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,260 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,261 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,261 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,261 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,261 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,262 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,262 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,262 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,262 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,262 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,263 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:34:21,284 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 00:34:21,304 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:34:21,304 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:34:21,304 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:34:21,305 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:34:21,305 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:34:21,305 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:34:21,305 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:34:21,305 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:34:21,321 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 128 transitions [2019-12-27 00:34:21,323 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 122 places, 128 transitions [2019-12-27 00:34:21,403 INFO L132 PetriNetUnfolder]: 10/127 cut-off events. [2019-12-27 00:34:21,404 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 00:34:21,414 INFO L76 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 10/127 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 245 event pairs. 0/114 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2019-12-27 00:34:21,423 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 122 places, 128 transitions [2019-12-27 00:34:21,465 INFO L132 PetriNetUnfolder]: 10/127 cut-off events. [2019-12-27 00:34:21,465 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 00:34:21,472 INFO L76 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 10/127 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 245 event pairs. 0/114 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2019-12-27 00:34:21,482 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4968 [2019-12-27 00:34:21,484 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:34:21,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:21,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:21,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:21,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:23,990 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-27 00:34:24,767 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5902 [2019-12-27 00:34:24,768 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 00:34:24,771 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 34 transitions [2019-12-27 00:34:24,792 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 139 states. [2019-12-27 00:34:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-12-27 00:34:24,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 00:34:24,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:24,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 00:34:24,805 INFO L410 AbstractCegarLoop]: === Iteration 1 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:34:24,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:24,811 INFO L82 PathProgramCache]: Analyzing trace with hash 486263513, now seen corresponding path program 1 times [2019-12-27 00:34:24,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:24,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941920222] [2019-12-27 00:34:24,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:25,043 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-27 00:34:25,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941920222] [2019-12-27 00:34:25,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:25,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:34:25,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572413676] [2019-12-27 00:34:25,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 00:34:25,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:25,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 00:34:25,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 00:34:25,072 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 2 states. [2019-12-27 00:34:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:25,110 INFO L93 Difference]: Finished difference Result 139 states and 298 transitions. [2019-12-27 00:34:25,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 00:34:25,113 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-12-27 00:34:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:25,153 INFO L225 Difference]: With dead ends: 139 [2019-12-27 00:34:25,153 INFO L226 Difference]: Without dead ends: 128 [2019-12-27 00:34:25,154 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-27 00:34:25,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-27 00:34:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-12-27 00:34:25,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-27 00:34:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 277 transitions. [2019-12-27 00:34:25,246 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 277 transitions. Word has length 5 [2019-12-27 00:34:25,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:25,246 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 277 transitions. [2019-12-27 00:34:25,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 00:34:25,247 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 277 transitions. [2019-12-27 00:34:25,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 00:34:25,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:25,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 00:34:25,253 INFO L410 AbstractCegarLoop]: === Iteration 2 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:34:25,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:25,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2105704442, now seen corresponding path program 1 times [2019-12-27 00:34:25,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:25,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123954731] [2019-12-27 00:34:25,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:25,369 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-27 00:34:25,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123954731] [2019-12-27 00:34:25,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:25,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:34:25,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267433868] [2019-12-27 00:34:25,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:34:25,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:25,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:34:25,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:34:25,379 INFO L87 Difference]: Start difference. First operand 128 states and 277 transitions. Second operand 3 states. [2019-12-27 00:34:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:25,409 INFO L93 Difference]: Finished difference Result 200 states and 438 transitions. [2019-12-27 00:34:25,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:34:25,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-27 00:34:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:25,413 INFO L225 Difference]: With dead ends: 200 [2019-12-27 00:34:25,413 INFO L226 Difference]: Without dead ends: 200 [2019-12-27 00:34:25,414 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-27 00:34:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-12-27 00:34:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 155. [2019-12-27 00:34:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-27 00:34:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 343 transitions. [2019-12-27 00:34:25,434 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 343 transitions. Word has length 6 [2019-12-27 00:34:25,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:25,434 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 343 transitions. [2019-12-27 00:34:25,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:34:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 343 transitions. [2019-12-27 00:34:25,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 00:34:25,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:25,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:34:25,436 INFO L410 AbstractCegarLoop]: === Iteration 3 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:34:25,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:25,436 INFO L82 PathProgramCache]: Analyzing trace with hash 282683680, now seen corresponding path program 1 times [2019-12-27 00:34:25,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:25,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145232150] [2019-12-27 00:34:25,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:25,589 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-27 00:34:25,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145232150] [2019-12-27 00:34:25,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:25,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 00:34:25,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179974351] [2019-12-27 00:34:25,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:34:25,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:25,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:34:25,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:34:25,591 INFO L87 Difference]: Start difference. First operand 155 states and 343 transitions. Second operand 7 states. [2019-12-27 00:34:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:25,948 INFO L93 Difference]: Finished difference Result 181 states and 391 transitions. [2019-12-27 00:34:25,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 00:34:25,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-27 00:34:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:25,951 INFO L225 Difference]: With dead ends: 181 [2019-12-27 00:34:25,951 INFO L226 Difference]: Without dead ends: 162 [2019-12-27 00:34:25,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:34:25,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-27 00:34:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-12-27 00:34:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 00:34:25,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 359 transitions. [2019-12-27 00:34:25,961 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 359 transitions. Word has length 10 [2019-12-27 00:34:25,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:25,962 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 359 transitions. [2019-12-27 00:34:25,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:34:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 359 transitions. [2019-12-27 00:34:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 00:34:25,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:25,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:34:25,963 INFO L410 AbstractCegarLoop]: === Iteration 4 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:34:25,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:25,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1366120806, now seen corresponding path program 1 times [2019-12-27 00:34:25,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:25,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481298589] [2019-12-27 00:34:25,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:26,486 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-27 00:34:26,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481298589] [2019-12-27 00:34:26,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:26,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 00:34:26,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975371503] [2019-12-27 00:34:26,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 00:34:26,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:26,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 00:34:26,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 00:34:26,488 INFO L87 Difference]: Start difference. First operand 162 states and 359 transitions. Second operand 12 states. [2019-12-27 00:34:27,641 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-12-27 00:34:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:28,026 INFO L93 Difference]: Finished difference Result 205 states and 441 transitions. [2019-12-27 00:34:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 00:34:28,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-27 00:34:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:28,028 INFO L225 Difference]: With dead ends: 205 [2019-12-27 00:34:28,029 INFO L226 Difference]: Without dead ends: 195 [2019-12-27 00:34:28,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:34:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-12-27 00:34:28,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 183. [2019-12-27 00:34:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-27 00:34:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 401 transitions. [2019-12-27 00:34:28,039 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 401 transitions. Word has length 16 [2019-12-27 00:34:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:28,039 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 401 transitions. [2019-12-27 00:34:28,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 00:34:28,039 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 401 transitions. [2019-12-27 00:34:28,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 00:34:28,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:28,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:34:28,042 INFO L410 AbstractCegarLoop]: === Iteration 5 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:34:28,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:28,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1230311642, now seen corresponding path program 2 times [2019-12-27 00:34:28,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:28,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65432136] [2019-12-27 00:34:28,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:28,524 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-27 00:34:28,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65432136] [2019-12-27 00:34:28,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:28,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 00:34:28,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427273521] [2019-12-27 00:34:28,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 00:34:28,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:28,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 00:34:28,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 00:34:28,526 INFO L87 Difference]: Start difference. First operand 183 states and 401 transitions. Second operand 13 states. [2019-12-27 00:34:30,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:30,706 INFO L93 Difference]: Finished difference Result 208 states and 440 transitions. [2019-12-27 00:34:30,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 00:34:30,711 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-27 00:34:30,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:30,712 INFO L225 Difference]: With dead ends: 208 [2019-12-27 00:34:30,712 INFO L226 Difference]: Without dead ends: 197 [2019-12-27 00:34:30,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=282, Invalid=710, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:34:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-27 00:34:30,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 170. [2019-12-27 00:34:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-27 00:34:30,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 371 transitions. [2019-12-27 00:34:30,721 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 371 transitions. Word has length 16 [2019-12-27 00:34:30,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:30,721 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 371 transitions. [2019-12-27 00:34:30,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 00:34:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 371 transitions. [2019-12-27 00:34:30,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:34:30,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:30,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:34:30,723 INFO L410 AbstractCegarLoop]: === Iteration 6 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:34:30,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:30,724 INFO L82 PathProgramCache]: Analyzing trace with hash 145495381, now seen corresponding path program 1 times [2019-12-27 00:34:30,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:30,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155765632] [2019-12-27 00:34:30,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:31,296 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2019-12-27 00:34:31,621 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-27 00:34:31,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155765632] [2019-12-27 00:34:31,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:31,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 00:34:31,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236476668] [2019-12-27 00:34:31,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 00:34:31,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:31,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 00:34:31,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:34:31,626 INFO L87 Difference]: Start difference. First operand 170 states and 371 transitions. Second operand 15 states. [2019-12-27 00:34:33,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:33,136 INFO L93 Difference]: Finished difference Result 261 states and 568 transitions. [2019-12-27 00:34:33,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:34:33,138 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 00:34:33,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:33,141 INFO L225 Difference]: With dead ends: 261 [2019-12-27 00:34:33,141 INFO L226 Difference]: Without dead ends: 261 [2019-12-27 00:34:33,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-12-27 00:34:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-27 00:34:33,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 237. [2019-12-27 00:34:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-27 00:34:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-27 00:34:33,152 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-27 00:34:33,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:33,153 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-27 00:34:33,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 00:34:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-27 00:34:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:34:33,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:33,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:34:33,156 INFO L410 AbstractCegarLoop]: === Iteration 7 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:34:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:33,156 INFO L82 PathProgramCache]: Analyzing trace with hash 349911829, now seen corresponding path program 2 times [2019-12-27 00:34:33,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:33,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275721743] [2019-12-27 00:34:33,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:33,679 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-12-27 00:34:34,054 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-27 00:34:34,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275721743] [2019-12-27 00:34:34,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:34,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:34:34,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740109205] [2019-12-27 00:34:34,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:34:34,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:34,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:34:34,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:34:34,057 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 16 states. [2019-12-27 00:34:35,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:35,663 INFO L93 Difference]: Finished difference Result 307 states and 673 transitions. [2019-12-27 00:34:35,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:34:35,665 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-27 00:34:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:35,668 INFO L225 Difference]: With dead ends: 307 [2019-12-27 00:34:35,668 INFO L226 Difference]: Without dead ends: 307 [2019-12-27 00:34:35,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2019-12-27 00:34:35,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-27 00:34:35,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 237. [2019-12-27 00:34:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-27 00:34:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-27 00:34:35,681 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-27 00:34:35,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:35,681 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-27 00:34:35,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:34:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-27 00:34:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:34:35,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:35,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:34:35,683 INFO L410 AbstractCegarLoop]: === Iteration 8 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:34:35,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:35,684 INFO L82 PathProgramCache]: Analyzing trace with hash 599415313, now seen corresponding path program 3 times [2019-12-27 00:34:35,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:35,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999699609] [2019-12-27 00:34:35,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:36,474 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-27 00:34:36,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999699609] [2019-12-27 00:34:36,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:36,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:34:36,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91906370] [2019-12-27 00:34:36,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:34:36,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:36,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:34:36,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:34:36,476 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 16 states. [2019-12-27 00:34:37,396 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-12-27 00:34:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:38,242 INFO L93 Difference]: Finished difference Result 304 states and 667 transitions. [2019-12-27 00:34:38,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 00:34:38,242 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-27 00:34:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:38,246 INFO L225 Difference]: With dead ends: 304 [2019-12-27 00:34:38,246 INFO L226 Difference]: Without dead ends: 304 [2019-12-27 00:34:38,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2019-12-27 00:34:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-12-27 00:34:38,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 237. [2019-12-27 00:34:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-27 00:34:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-27 00:34:38,256 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-27 00:34:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:38,256 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-27 00:34:38,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:34:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-27 00:34:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:34:38,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:38,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:34:38,258 INFO L410 AbstractCegarLoop]: === Iteration 9 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:34:38,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash -898885167, now seen corresponding path program 4 times [2019-12-27 00:34:38,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:38,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073805919] [2019-12-27 00:34:38,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:38,670 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-12-27 00:34:39,042 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-27 00:34:39,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073805919] [2019-12-27 00:34:39,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:39,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 00:34:39,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822344889] [2019-12-27 00:34:39,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 00:34:39,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:39,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 00:34:39,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:34:39,044 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 15 states. [2019-12-27 00:34:39,753 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-12-27 00:34:40,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:40,810 INFO L93 Difference]: Finished difference Result 419 states and 934 transitions. [2019-12-27 00:34:40,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 00:34:40,810 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 00:34:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:40,814 INFO L225 Difference]: With dead ends: 419 [2019-12-27 00:34:40,814 INFO L226 Difference]: Without dead ends: 419 [2019-12-27 00:34:40,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:34:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-27 00:34:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 243. [2019-12-27 00:34:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-27 00:34:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 531 transitions. [2019-12-27 00:34:40,825 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 531 transitions. Word has length 18 [2019-12-27 00:34:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:40,825 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 531 transitions. [2019-12-27 00:34:40,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 00:34:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 531 transitions. [2019-12-27 00:34:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:34:40,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:40,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:34:40,826 INFO L410 AbstractCegarLoop]: === Iteration 10 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:34:40,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:40,827 INFO L82 PathProgramCache]: Analyzing trace with hash 976531695, now seen corresponding path program 5 times [2019-12-27 00:34:40,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:40,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97578572] [2019-12-27 00:34:40,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:41,625 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-27 00:34:41,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97578572] [2019-12-27 00:34:41,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:41,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 00:34:41,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036766774] [2019-12-27 00:34:41,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 00:34:41,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:41,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 00:34:41,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-27 00:34:41,627 INFO L87 Difference]: Start difference. First operand 243 states and 531 transitions. Second operand 16 states. [2019-12-27 00:34:43,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:43,401 INFO L93 Difference]: Finished difference Result 322 states and 704 transitions. [2019-12-27 00:34:43,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 00:34:43,402 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-27 00:34:43,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:43,405 INFO L225 Difference]: With dead ends: 322 [2019-12-27 00:34:43,405 INFO L226 Difference]: Without dead ends: 322 [2019-12-27 00:34:43,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2019-12-27 00:34:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-27 00:34:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 243. [2019-12-27 00:34:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-27 00:34:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 531 transitions. [2019-12-27 00:34:43,414 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 531 transitions. Word has length 18 [2019-12-27 00:34:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:43,415 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 531 transitions. [2019-12-27 00:34:43,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 00:34:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 531 transitions. [2019-12-27 00:34:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:34:43,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:43,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:34:43,416 INFO L410 AbstractCegarLoop]: === Iteration 11 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:34:43,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:43,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1354999957, now seen corresponding path program 6 times [2019-12-27 00:34:43,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:43,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615236702] [2019-12-27 00:34:43,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:43,912 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2019-12-27 00:34:44,180 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-27 00:34:44,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615236702] [2019-12-27 00:34:44,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:34:44,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 00:34:44,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498258240] [2019-12-27 00:34:44,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 00:34:44,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:44,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 00:34:44,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:34:44,182 INFO L87 Difference]: Start difference. First operand 243 states and 531 transitions. Second operand 15 states. [2019-12-27 00:34:45,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:45,617 INFO L93 Difference]: Finished difference Result 301 states and 662 transitions. [2019-12-27 00:34:45,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 00:34:45,617 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 00:34:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:45,621 INFO L225 Difference]: With dead ends: 301 [2019-12-27 00:34:45,621 INFO L226 Difference]: Without dead ends: 301 [2019-12-27 00:34:45,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-12-27 00:34:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-27 00:34:45,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 222. [2019-12-27 00:34:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-27 00:34:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 489 transitions. [2019-12-27 00:34:45,629 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 489 transitions. Word has length 18 [2019-12-27 00:34:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:45,630 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 489 transitions. [2019-12-27 00:34:45,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 00:34:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 489 transitions. [2019-12-27 00:34:45,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:34:45,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:45,631 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:34:45,631 INFO L410 AbstractCegarLoop]: === Iteration 12 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:34:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:45,632 INFO L82 PathProgramCache]: Analyzing trace with hash 831318896, now seen corresponding path program 1 times [2019-12-27 00:34:45,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:45,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757156484] [2019-12-27 00:34:45,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:34:45,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757156484] [2019-12-27 00:34:45,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018788638] [2019-12-27 00:34:45,681 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-27 00:34:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:45,777 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-27 00:34:45,784 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:34:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:34:45,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:34:45,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-27 00:34:45,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152770494] [2019-12-27 00:34:45,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:34:45,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:45,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:34:45,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:34:45,812 INFO L87 Difference]: Start difference. First operand 222 states and 489 transitions. Second operand 5 states. [2019-12-27 00:34:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:45,859 INFO L93 Difference]: Finished difference Result 326 states and 718 transitions. [2019-12-27 00:34:45,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:34:45,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 00:34:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:45,862 INFO L225 Difference]: With dead ends: 326 [2019-12-27 00:34:45,862 INFO L226 Difference]: Without dead ends: 326 [2019-12-27 00:34:45,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:34:45,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-27 00:34:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 278. [2019-12-27 00:34:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-12-27 00:34:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 624 transitions. [2019-12-27 00:34:45,871 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 624 transitions. Word has length 21 [2019-12-27 00:34:45,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:45,872 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 624 transitions. [2019-12-27 00:34:45,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:34:45,872 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 624 transitions. [2019-12-27 00:34:45,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:34:45,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:45,873 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:34:46,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:34:46,107 INFO L410 AbstractCegarLoop]: === Iteration 13 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:34:46,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:46,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1273193156, now seen corresponding path program 7 times [2019-12-27 00:34:46,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:46,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254220314] [2019-12-27 00:34:46,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:46,680 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-12-27 00:34:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:34:47,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254220314] [2019-12-27 00:34:47,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093140007] [2019-12-27 00:34:47,415 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 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-27 00:34:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:47,503 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 93 conjunts are in the unsatisfiable core [2019-12-27 00:34:47,506 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:34:47,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-27 00:34:47,561 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:47,580 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 00:34:47,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:47,593 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:34:47,594 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:47,604 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:34:47,605 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:34:47,606 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 00:34:48,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:48,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:48,154 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:34:48,185 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:34:48,186 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:34:48,189 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:48,250 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 00:34:48,251 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:34:48,251 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-27 00:34:48,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:48,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:48,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:48,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:48,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:48,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:48,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-27 00:34:48,457 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:48,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:48,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:48,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:48,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:48,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-27 00:34:48,549 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:48,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:48,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:48,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:48,559 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-27 00:34:48,560 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:48,578 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:34:48,579 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:34:48,579 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-27 00:34:48,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:34:48,837 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-27 00:34:48,838 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:48,888 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-27 00:34:48,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:48,889 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-27 00:34:48,891 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:32 [2019-12-27 00:34:49,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:34:49,032 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-27 00:34:49,033 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:49,038 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:34:49,039 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-27 00:34:49,039 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2019-12-27 00:34:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:34:49,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:34:49,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 34 [2019-12-27 00:34:49,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252835995] [2019-12-27 00:34:49,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 00:34:49,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:49,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 00:34:49,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 00:34:49,126 INFO L87 Difference]: Start difference. First operand 278 states and 624 transitions. Second operand 36 states. [2019-12-27 00:34:50,155 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2019-12-27 00:34:50,405 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2019-12-27 00:34:50,657 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2019-12-27 00:34:51,824 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-27 00:34:52,166 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-27 00:34:52,389 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-27 00:34:52,825 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-12-27 00:34:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:34:53,868 INFO L93 Difference]: Finished difference Result 396 states and 871 transitions. [2019-12-27 00:34:53,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 00:34:53,868 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 23 [2019-12-27 00:34:53,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:34:53,871 INFO L225 Difference]: With dead ends: 396 [2019-12-27 00:34:53,871 INFO L226 Difference]: Without dead ends: 396 [2019-12-27 00:34:53,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=479, Invalid=3303, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 00:34:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-12-27 00:34:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 340. [2019-12-27 00:34:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-27 00:34:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 755 transitions. [2019-12-27 00:34:53,890 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 755 transitions. Word has length 23 [2019-12-27 00:34:53,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:34:53,893 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 755 transitions. [2019-12-27 00:34:53,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 00:34:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 755 transitions. [2019-12-27 00:34:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:34:53,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:34:53,899 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:34:54,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:34:54,109 INFO L410 AbstractCegarLoop]: === Iteration 14 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:34:54,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:34:54,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1480527740, now seen corresponding path program 8 times [2019-12-27 00:34:54,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:34:54,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086573373] [2019-12-27 00:34:54,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:34:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:34:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:34:55,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086573373] [2019-12-27 00:34:55,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981342607] [2019-12-27 00:34:55,345 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 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-27 00:34:55,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:34:55,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:34:55,420 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 91 conjunts are in the unsatisfiable core [2019-12-27 00:34:55,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:34:55,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-27 00:34:55,445 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:55,464 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 00:34:55,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:55,469 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:34:55,470 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:55,479 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:34:55,480 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:34:55,480 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:34:55,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:55,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:55,959 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:34:55,985 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:34:55,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:34:55,986 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:56,062 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 00:34:56,063 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-27 00:34:56,063 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-27 00:34:56,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:56,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:56,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:56,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:56,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:56,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:56,245 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-27 00:34:56,247 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:56,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:56,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:56,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:56,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:56,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-27 00:34:56,298 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:56,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:56,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:56,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:34:56,307 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-27 00:34:56,308 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:56,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:34:56,327 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-27 00:34:56,328 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-27 00:34:56,609 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:34:56,609 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-27 00:34:56,610 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:56,676 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-27 00:34:56,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:34:56,677 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-27 00:34:56,677 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:32 [2019-12-27 00:34:56,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:34:56,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-27 00:34:56,809 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:34:56,822 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:34:56,823 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-27 00:34:56,823 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-27 00:34:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:34:56,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:34:56,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-12-27 00:34:56,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737847671] [2019-12-27 00:34:56,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 00:34:56,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:34:56,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 00:34:56,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 00:34:56,849 INFO L87 Difference]: Start difference. First operand 340 states and 755 transitions. Second operand 33 states. [2019-12-27 00:34:57,770 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-12-27 00:34:58,008 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-12-27 00:34:58,246 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-12-27 00:34:59,277 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-12-27 00:34:59,592 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-27 00:35:00,005 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-12-27 00:35:00,689 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-12-27 00:35:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:01,758 INFO L93 Difference]: Finished difference Result 437 states and 960 transitions. [2019-12-27 00:35:01,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 00:35:01,763 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 23 [2019-12-27 00:35:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:01,765 INFO L225 Difference]: With dead ends: 437 [2019-12-27 00:35:01,766 INFO L226 Difference]: Without dead ends: 437 [2019-12-27 00:35:01,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=432, Invalid=2990, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 00:35:01,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-27 00:35:01,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 340. [2019-12-27 00:35:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-27 00:35:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 755 transitions. [2019-12-27 00:35:01,780 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 755 transitions. Word has length 23 [2019-12-27 00:35:01,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:01,781 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 755 transitions. [2019-12-27 00:35:01,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 00:35:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 755 transitions. [2019-12-27 00:35:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:35:01,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:01,782 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:35:01,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:35:01,986 INFO L410 AbstractCegarLoop]: === Iteration 15 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:35:01,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:01,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1675104768, now seen corresponding path program 9 times [2019-12-27 00:35:01,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:01,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319770486] [2019-12-27 00:35:01,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:02,500 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 37 [2019-12-27 00:35:03,201 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-12-27 00:35:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:35:03,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319770486] [2019-12-27 00:35:03,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327881918] [2019-12-27 00:35:03,469 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 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-27 00:35:03,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:35:03,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:35:03,551 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 95 conjunts are in the unsatisfiable core [2019-12-27 00:35:03,553 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:35:03,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-27 00:35:03,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 00:35:03,612 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 00:35:03,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:03,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:35:03,618 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:03,627 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:03,628 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:35:03,628 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:35:04,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:04,037 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:35:04,065 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:04,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:35:04,067 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:04,123 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-27 00:35:04,124 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-27 00:35:04,124 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:52 [2019-12-27 00:35:04,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:35:04,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:35:04,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:04,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:04,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:04,403 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:35:04,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:04,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-27 00:35:04,407 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:04,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:04,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:04,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:04,438 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:35:04,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:04,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-27 00:35:04,443 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:04,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:04,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:04,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:04,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-27 00:35:04,467 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:04,488 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:04,489 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-27 00:35:04,490 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-27 00:35:04,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:04,729 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-27 00:35:04,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:04,800 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-27 00:35:04,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:35:04,801 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-27 00:35:04,802 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:32 [2019-12-27 00:35:04,919 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:04,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-27 00:35:04,920 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:04,932 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:04,933 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-27 00:35:04,933 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-27 00:35:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:35:04,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:35:04,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2019-12-27 00:35:04,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806122677] [2019-12-27 00:35:04,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 00:35:04,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:04,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 00:35:04,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 00:35:04,973 INFO L87 Difference]: Start difference. First operand 340 states and 755 transitions. Second operand 35 states. [2019-12-27 00:35:05,689 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 47 [2019-12-27 00:35:05,999 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-12-27 00:35:06,250 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-12-27 00:35:06,431 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 50 [2019-12-27 00:35:06,619 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-12-27 00:35:06,780 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-12-27 00:35:07,066 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 64 [2019-12-27 00:35:07,449 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-12-27 00:35:07,711 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 68 [2019-12-27 00:35:07,942 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 50 [2019-12-27 00:35:08,313 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-12-27 00:35:08,490 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-12-27 00:35:08,758 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 54 [2019-12-27 00:35:08,999 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 58 [2019-12-27 00:35:09,334 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-12-27 00:35:09,605 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 67 [2019-12-27 00:35:09,804 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2019-12-27 00:35:09,988 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-12-27 00:35:10,200 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-12-27 00:35:10,398 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 72 [2019-12-27 00:35:10,568 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-27 00:35:10,848 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 66 [2019-12-27 00:35:11,151 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 60 [2019-12-27 00:35:11,508 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2019-12-27 00:35:11,753 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 63 [2019-12-27 00:35:12,013 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 65 [2019-12-27 00:35:12,272 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 56 [2019-12-27 00:35:12,475 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-12-27 00:35:14,378 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 54 [2019-12-27 00:35:15,013 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-12-27 00:35:15,695 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-12-27 00:35:15,851 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-12-27 00:35:16,149 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2019-12-27 00:35:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:16,760 INFO L93 Difference]: Finished difference Result 518 states and 1137 transitions. [2019-12-27 00:35:16,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-27 00:35:16,761 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 23 [2019-12-27 00:35:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:16,769 INFO L225 Difference]: With dead ends: 518 [2019-12-27 00:35:16,769 INFO L226 Difference]: Without dead ends: 518 [2019-12-27 00:35:16,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2578 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=1382, Invalid=7930, Unknown=0, NotChecked=0, Total=9312 [2019-12-27 00:35:16,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-12-27 00:35:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 353. [2019-12-27 00:35:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-12-27 00:35:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 789 transitions. [2019-12-27 00:35:16,785 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 789 transitions. Word has length 23 [2019-12-27 00:35:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:16,786 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 789 transitions. [2019-12-27 00:35:16,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 00:35:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 789 transitions. [2019-12-27 00:35:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:35:16,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:16,787 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:35:16,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:35:16,991 INFO L410 AbstractCegarLoop]: === Iteration 16 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:35:16,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:16,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1319631296, now seen corresponding path program 10 times [2019-12-27 00:35:16,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:16,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131821825] [2019-12-27 00:35:16,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:17,431 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 37 [2019-12-27 00:35:17,690 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2019-12-27 00:35:18,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:35:18,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131821825] [2019-12-27 00:35:18,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080296740] [2019-12-27 00:35:18,389 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 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-27 00:35:18,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:35:18,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:35:18,453 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 101 conjunts are in the unsatisfiable core [2019-12-27 00:35:18,458 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:35:18,466 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-27 00:35:18,467 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:18,486 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 00:35:18,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:18,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:35:18,491 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:18,500 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:18,501 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:35:18,501 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 00:35:18,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:18,891 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:35:18,914 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:18,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:35:18,916 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:18,970 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-27 00:35:18,971 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:35:18,971 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:52 [2019-12-27 00:35:19,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:35:19,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:35:19,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:19,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:19,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:19,191 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:35:19,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:19,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-27 00:35:19,220 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:19,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:19,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:19,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:19,239 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:35:19,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:19,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-27 00:35:19,261 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:19,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:19,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:19,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:19,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-27 00:35:19,279 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:19,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:19,306 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:35:19,306 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:260, output treesize:46 [2019-12-27 00:35:19,795 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:19,795 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-27 00:35:19,796 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:19,850 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-27 00:35:19,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:35:19,852 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-27 00:35:19,852 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:32 [2019-12-27 00:35:20,003 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:20,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-27 00:35:20,004 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:20,008 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:20,009 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-27 00:35:20,009 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2019-12-27 00:35:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:35:20,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:35:20,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2019-12-27 00:35:20,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414277035] [2019-12-27 00:35:20,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 00:35:20,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:20,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 00:35:20,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1084, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 00:35:20,036 INFO L87 Difference]: Start difference. First operand 353 states and 789 transitions. Second operand 35 states. [2019-12-27 00:35:20,661 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-12-27 00:35:21,031 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-12-27 00:35:21,211 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-12-27 00:35:21,475 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-12-27 00:35:21,861 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-12-27 00:35:22,078 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-12-27 00:35:22,250 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 49 [2019-12-27 00:35:22,646 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-12-27 00:35:22,841 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2019-12-27 00:35:23,058 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 57 [2019-12-27 00:35:23,416 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-12-27 00:35:23,649 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2019-12-27 00:35:23,863 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2019-12-27 00:35:24,073 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 55 [2019-12-27 00:35:24,399 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 74 [2019-12-27 00:35:24,721 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 65 [2019-12-27 00:35:25,011 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 59 [2019-12-27 00:35:25,494 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 72 [2019-12-27 00:35:25,782 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 57 [2019-12-27 00:35:26,070 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 45 [2019-12-27 00:35:26,760 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 49 [2019-12-27 00:35:26,967 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 56 [2019-12-27 00:35:27,252 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 53 [2019-12-27 00:35:27,528 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 58 [2019-12-27 00:35:27,811 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 55 [2019-12-27 00:35:28,023 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 49 [2019-12-27 00:35:28,287 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 60 [2019-12-27 00:35:28,457 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-12-27 00:35:29,020 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 62 [2019-12-27 00:35:29,460 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2019-12-27 00:35:29,664 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 51 [2019-12-27 00:35:30,094 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 62 [2019-12-27 00:35:30,455 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-12-27 00:35:30,673 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 51 [2019-12-27 00:35:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:31,277 INFO L93 Difference]: Finished difference Result 542 states and 1191 transitions. [2019-12-27 00:35:31,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 00:35:31,277 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 23 [2019-12-27 00:35:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:31,281 INFO L225 Difference]: With dead ends: 542 [2019-12-27 00:35:31,282 INFO L226 Difference]: Without dead ends: 542 [2019-12-27 00:35:31,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2299 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1206, Invalid=7350, Unknown=0, NotChecked=0, Total=8556 [2019-12-27 00:35:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-12-27 00:35:31,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 336. [2019-12-27 00:35:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-27 00:35:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 746 transitions. [2019-12-27 00:35:31,294 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 746 transitions. Word has length 23 [2019-12-27 00:35:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:31,295 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 746 transitions. [2019-12-27 00:35:31,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 00:35:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 746 transitions. [2019-12-27 00:35:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:35:31,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:31,296 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:35:31,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:35:31,499 INFO L410 AbstractCegarLoop]: === Iteration 17 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:35:31,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:31,500 INFO L82 PathProgramCache]: Analyzing trace with hash 378903552, now seen corresponding path program 11 times [2019-12-27 00:35:31,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:31,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301224590] [2019-12-27 00:35:31,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:31,937 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2019-12-27 00:35:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:35:32,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301224590] [2019-12-27 00:35:32,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298504883] [2019-12-27 00:35:32,651 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 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-27 00:35:32,718 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:35:32,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:35:32,720 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 92 conjunts are in the unsatisfiable core [2019-12-27 00:35:32,722 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:35:32,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-12-27 00:35:32,731 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:32,749 INFO L614 ElimStorePlain]: treesize reduction 12, result has 78.9 percent of original size [2019-12-27 00:35:32,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:32,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:35:32,758 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:32,769 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:32,770 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:35:32,771 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:35:33,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:33,188 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:35:33,217 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:33,217 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:35:33,219 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:33,274 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-27 00:35:33,274 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-27 00:35:33,274 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:52 [2019-12-27 00:35:33,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:35:33,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:35:33,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:33,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:33,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:33,446 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:35:33,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:33,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-27 00:35:33,457 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:33,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:33,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:33,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:33,481 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:35:33,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:33,490 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-27 00:35:33,491 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:33,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:33,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:33,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:33,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-27 00:35:33,500 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:33,517 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:33,518 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-27 00:35:33,519 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:260, output treesize:46 [2019-12-27 00:35:33,851 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:33,851 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 103 [2019-12-27 00:35:33,853 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:33,872 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:33,873 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-27 00:35:33,873 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:39 [2019-12-27 00:35:34,011 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:34,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 47 [2019-12-27 00:35:34,013 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:34,019 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:34,019 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-27 00:35:34,019 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-27 00:35:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:35:34,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:35:34,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 34 [2019-12-27 00:35:34,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365910149] [2019-12-27 00:35:34,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 00:35:34,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:34,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 00:35:34,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 00:35:34,099 INFO L87 Difference]: Start difference. First operand 336 states and 746 transitions. Second operand 36 states. [2019-12-27 00:35:35,043 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-12-27 00:35:35,446 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 58 [2019-12-27 00:35:35,835 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-12-27 00:35:36,944 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-27 00:35:37,437 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-12-27 00:35:37,768 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-12-27 00:35:37,920 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-12-27 00:35:38,350 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-12-27 00:35:38,616 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-12-27 00:35:38,933 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-12-27 00:35:39,350 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-12-27 00:35:39,514 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-27 00:35:39,893 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-12-27 00:35:40,260 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-12-27 00:35:40,618 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-12-27 00:35:40,810 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-12-27 00:35:41,055 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-12-27 00:35:41,267 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-27 00:35:41,465 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-12-27 00:35:41,707 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-12-27 00:35:42,008 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-12-27 00:35:42,298 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2019-12-27 00:35:42,555 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-12-27 00:35:42,800 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-12-27 00:35:42,997 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2019-12-27 00:35:43,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:43,989 INFO L93 Difference]: Finished difference Result 611 states and 1335 transitions. [2019-12-27 00:35:43,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 00:35:43,992 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 23 [2019-12-27 00:35:43,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:43,995 INFO L225 Difference]: With dead ends: 611 [2019-12-27 00:35:43,995 INFO L226 Difference]: Without dead ends: 611 [2019-12-27 00:35:43,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=821, Invalid=5341, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 00:35:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-12-27 00:35:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 400. [2019-12-27 00:35:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-12-27 00:35:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 884 transitions. [2019-12-27 00:35:44,008 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 884 transitions. Word has length 23 [2019-12-27 00:35:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:44,009 INFO L462 AbstractCegarLoop]: Abstraction has 400 states and 884 transitions. [2019-12-27 00:35:44,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 00:35:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 884 transitions. [2019-12-27 00:35:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:35:44,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:44,010 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:35:44,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:35:44,214 INFO L410 AbstractCegarLoop]: === Iteration 18 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:35:44,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:44,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1115213342, now seen corresponding path program 12 times [2019-12-27 00:35:44,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:44,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249398367] [2019-12-27 00:35:44,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:44,708 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 40 [2019-12-27 00:35:45,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:35:45,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249398367] [2019-12-27 00:35:45,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433316804] [2019-12-27 00:35:45,315 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 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-27 00:35:45,382 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-27 00:35:45,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:35:45,384 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 95 conjunts are in the unsatisfiable core [2019-12-27 00:35:45,386 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:35:45,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-27 00:35:45,394 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:45,416 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 00:35:45,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:45,422 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:35:45,422 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:45,430 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:45,431 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:35:45,431 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:35:45,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:45,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:45,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:35:45,903 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:45,903 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:35:45,904 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:45,962 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 00:35:45,962 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-27 00:35:45,963 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-27 00:35:46,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:35:46,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:35:46,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:46,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:46,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:46,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:46,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-27 00:35:46,145 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:46,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:46,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:46,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:46,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:46,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-27 00:35:46,174 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:46,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:46,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:46,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:46,185 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-27 00:35:46,185 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:46,204 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:46,204 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-27 00:35:46,205 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-27 00:35:46,455 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:46,455 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-27 00:35:46,456 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:46,516 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-27 00:35:46,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:35:46,517 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-27 00:35:46,517 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:32 [2019-12-27 00:35:46,639 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:46,640 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-27 00:35:46,641 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:46,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:46,646 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-27 00:35:46,646 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-27 00:35:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:35:46,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:35:46,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-12-27 00:35:46,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097309725] [2019-12-27 00:35:46,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 00:35:46,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:46,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 00:35:46,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 00:35:46,670 INFO L87 Difference]: Start difference. First operand 400 states and 884 transitions. Second operand 33 states. [2019-12-27 00:35:47,458 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-12-27 00:35:47,798 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2019-12-27 00:35:48,074 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-12-27 00:35:48,301 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 54 [2019-12-27 00:35:49,450 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-27 00:35:49,843 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-12-27 00:35:50,079 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-12-27 00:35:50,534 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-12-27 00:35:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:51,516 INFO L93 Difference]: Finished difference Result 503 states and 1101 transitions. [2019-12-27 00:35:51,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 00:35:51,516 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 23 [2019-12-27 00:35:51,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:51,520 INFO L225 Difference]: With dead ends: 503 [2019-12-27 00:35:51,520 INFO L226 Difference]: Without dead ends: 503 [2019-12-27 00:35:51,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=452, Invalid=3088, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 00:35:51,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-12-27 00:35:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 400. [2019-12-27 00:35:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-12-27 00:35:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 884 transitions. [2019-12-27 00:35:51,530 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 884 transitions. Word has length 23 [2019-12-27 00:35:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:51,531 INFO L462 AbstractCegarLoop]: Abstraction has 400 states and 884 transitions. [2019-12-27 00:35:51,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 00:35:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 884 transitions. [2019-12-27 00:35:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:35:51,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:51,532 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:35:51,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:35:51,735 INFO L410 AbstractCegarLoop]: === Iteration 19 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:35:51,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:51,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1827682534, now seen corresponding path program 13 times [2019-12-27 00:35:51,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:51,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122207134] [2019-12-27 00:35:51,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:52,186 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-12-27 00:35:52,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:35:52,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122207134] [2019-12-27 00:35:52,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5028627] [2019-12-27 00:35:52,860 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 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-27 00:35:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:52,927 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 93 conjunts are in the unsatisfiable core [2019-12-27 00:35:52,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:35:52,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-27 00:35:52,941 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:52,962 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 00:35:52,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:52,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:35:52,968 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:52,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:52,979 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:35:52,980 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 00:35:53,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:53,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:53,445 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:35:53,479 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:53,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:35:53,481 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:53,547 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 00:35:53,548 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:35:53,548 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-27 00:35:53,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:35:53,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:35:53,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:53,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:53,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:53,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:53,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-27 00:35:53,740 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:53,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:53,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:53,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:53,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:53,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-27 00:35:53,780 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:53,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:53,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:53,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:35:53,788 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-27 00:35:53,789 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:53,807 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:53,808 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:35:53,808 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-27 00:35:54,038 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:54,038 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-27 00:35:54,039 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:54,100 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-27 00:35:54,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:35:54,102 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-27 00:35:54,102 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:32 [2019-12-27 00:35:54,251 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:54,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-27 00:35:54,252 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:35:54,257 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:35:54,257 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-27 00:35:54,258 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2019-12-27 00:35:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:35:54,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:35:54,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 34 [2019-12-27 00:35:54,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112963354] [2019-12-27 00:35:54,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 00:35:54,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:35:54,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 00:35:54,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 00:35:54,336 INFO L87 Difference]: Start difference. First operand 400 states and 884 transitions. Second operand 36 states. [2019-12-27 00:35:55,275 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-12-27 00:35:55,521 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-12-27 00:35:55,722 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2019-12-27 00:35:56,610 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-27 00:35:56,896 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-27 00:35:57,298 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-27 00:35:57,539 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-27 00:35:57,982 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-12-27 00:35:58,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:35:58,977 INFO L93 Difference]: Finished difference Result 470 states and 1032 transitions. [2019-12-27 00:35:58,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 00:35:58,977 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 23 [2019-12-27 00:35:58,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:35:58,981 INFO L225 Difference]: With dead ends: 470 [2019-12-27 00:35:58,981 INFO L226 Difference]: Without dead ends: 470 [2019-12-27 00:35:58,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=482, Invalid=3300, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 00:35:58,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-12-27 00:35:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 364. [2019-12-27 00:35:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-12-27 00:35:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 809 transitions. [2019-12-27 00:35:58,991 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 809 transitions. Word has length 23 [2019-12-27 00:35:58,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:35:58,991 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 809 transitions. [2019-12-27 00:35:58,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 00:35:58,991 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 809 transitions. [2019-12-27 00:35:58,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:35:58,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:35:58,992 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:35:59,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:35:59,196 INFO L410 AbstractCegarLoop]: === Iteration 20 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:35:59,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:35:59,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2090449835, now seen corresponding path program 14 times [2019-12-27 00:35:59,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:35:59,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438731203] [2019-12-27 00:35:59,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:35:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:35:59,633 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 40 [2019-12-27 00:35:59,950 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2019-12-27 00:36:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:00,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438731203] [2019-12-27 00:36:00,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408600874] [2019-12-27 00:36:00,506 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 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-27 00:36:00,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:36:00,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:36:00,582 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 98 conjunts are in the unsatisfiable core [2019-12-27 00:36:00,584 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:36:00,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-27 00:36:00,611 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 00:36:00,639 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 00:36:00,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:00,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:36:00,648 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:00,659 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:00,659 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:36:00,660 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:36:01,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,118 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:36:01,143 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:01,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:36:01,145 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:01,205 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 00:36:01,206 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-27 00:36:01,206 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-27 00:36:01,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:01,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:01,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-27 00:36:01,384 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:01,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,413 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-27 00:36:01,414 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:01,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,423 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-27 00:36:01,423 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:01,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:01,443 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-27 00:36:01,444 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-27 00:36:01,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:01,716 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:01,716 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 120 [2019-12-27 00:36:01,718 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:01,778 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-27 00:36:01,779 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-27 00:36:01,779 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 00:36:01,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:01,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:01,885 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-27 00:36:01,886 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:01,913 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-27 00:36:01,913 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:01,925 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-27 00:36:01,926 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:01,986 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-27 00:36:01,987 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-27 00:36:01,987 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:212, output treesize:46 [2019-12-27 00:36:02,141 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:02,142 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-27 00:36:02,143 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:02,152 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:02,152 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-27 00:36:02,153 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:7 [2019-12-27 00:36:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:02,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:36:02,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 35 [2019-12-27 00:36:02,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96680075] [2019-12-27 00:36:02,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-27 00:36:02,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:02,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-27 00:36:02,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 00:36:02,231 INFO L87 Difference]: Start difference. First operand 364 states and 809 transitions. Second operand 37 states. [2019-12-27 00:36:02,818 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-12-27 00:36:03,140 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-12-27 00:36:03,385 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2019-12-27 00:36:03,612 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 65 [2019-12-27 00:36:04,679 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-12-27 00:36:05,126 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-12-27 00:36:05,776 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-27 00:36:06,053 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-12-27 00:36:06,491 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-12-27 00:36:07,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:07,303 INFO L93 Difference]: Finished difference Result 532 states and 1171 transitions. [2019-12-27 00:36:07,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 00:36:07,304 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 25 [2019-12-27 00:36:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:07,307 INFO L225 Difference]: With dead ends: 532 [2019-12-27 00:36:07,307 INFO L226 Difference]: Without dead ends: 532 [2019-12-27 00:36:07,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=486, Invalid=3420, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 00:36:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-27 00:36:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 376. [2019-12-27 00:36:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-12-27 00:36:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 833 transitions. [2019-12-27 00:36:07,317 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 833 transitions. Word has length 25 [2019-12-27 00:36:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:07,318 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 833 transitions. [2019-12-27 00:36:07,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-27 00:36:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 833 transitions. [2019-12-27 00:36:07,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:36:07,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:07,319 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:07,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:36:07,524 INFO L410 AbstractCegarLoop]: === Iteration 21 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:36:07,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:07,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1978593398, now seen corresponding path program 1 times [2019-12-27 00:36:07,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:07,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472191420] [2019-12-27 00:36:07,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:08,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472191420] [2019-12-27 00:36:08,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137555596] [2019-12-27 00:36:08,439 INFO L94 rtionOrderModulation]: Keeping assertion order 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-27 00:36:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:08,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 78 conjunts are in the unsatisfiable core [2019-12-27 00:36:08,519 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:36:08,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-27 00:36:08,528 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 00:36:08,556 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 00:36:08,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:08,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:36:08,563 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:08,574 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:08,575 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:36:08,575 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:36:08,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:08,867 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:08,867 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:36:08,868 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:08,911 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-27 00:36:08,911 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-27 00:36:08,912 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2019-12-27 00:36:08,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:08,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:08,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:08,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-27 00:36:08,987 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:09,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:09,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-27 00:36:09,017 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:09,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-27 00:36:09,021 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:09,031 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:09,032 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-27 00:36:09,033 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-27 00:36:09,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:09,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:09,222 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:36:09,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:09,228 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-27 00:36:09,229 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:09,243 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:36:09,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:09,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-27 00:36:09,248 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:09,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-27 00:36:09,252 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:09,263 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:09,263 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-27 00:36:09,264 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-27 00:36:09,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:09,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:36:09,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-12-27 00:36:09,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35911920] [2019-12-27 00:36:09,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 00:36:09,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:09,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 00:36:09,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2019-12-27 00:36:09,360 INFO L87 Difference]: Start difference. First operand 376 states and 833 transitions. Second operand 30 states. [2019-12-27 00:36:09,892 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 45 [2019-12-27 00:36:10,271 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2019-12-27 00:36:10,622 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2019-12-27 00:36:10,896 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2019-12-27 00:36:11,096 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 50 [2019-12-27 00:36:11,423 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 60 [2019-12-27 00:36:11,595 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 47 [2019-12-27 00:36:11,894 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 57 [2019-12-27 00:36:13,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:13,051 INFO L93 Difference]: Finished difference Result 464 states and 1011 transitions. [2019-12-27 00:36:13,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 00:36:13,051 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 25 [2019-12-27 00:36:13,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:13,055 INFO L225 Difference]: With dead ends: 464 [2019-12-27 00:36:13,055 INFO L226 Difference]: Without dead ends: 447 [2019-12-27 00:36:13,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=371, Invalid=1885, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 00:36:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-27 00:36:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 435. [2019-12-27 00:36:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-12-27 00:36:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 959 transitions. [2019-12-27 00:36:13,066 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 959 transitions. Word has length 25 [2019-12-27 00:36:13,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:13,066 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 959 transitions. [2019-12-27 00:36:13,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 00:36:13,066 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 959 transitions. [2019-12-27 00:36:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:36:13,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:13,067 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:13,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:36:13,271 INFO L410 AbstractCegarLoop]: === Iteration 22 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:36:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:13,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1352666678, now seen corresponding path program 2 times [2019-12-27 00:36:13,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:13,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734640034] [2019-12-27 00:36:13,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:14,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734640034] [2019-12-27 00:36:14,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044415153] [2019-12-27 00:36:14,126 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-27 00:36:14,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:36:14,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:36:14,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 78 conjunts are in the unsatisfiable core [2019-12-27 00:36:14,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:36:14,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-27 00:36:14,204 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 00:36:14,233 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 00:36:14,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:14,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:36:14,238 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:14,250 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:14,250 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:36:14,250 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:36:14,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:14,533 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:14,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:36:14,534 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:14,579 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-27 00:36:14,579 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-27 00:36:14,580 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2019-12-27 00:36:14,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:14,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:14,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:14,705 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-27 00:36:14,706 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:14,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:14,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-27 00:36:14,720 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:14,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-27 00:36:14,724 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:14,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:14,735 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-27 00:36:14,735 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-27 00:36:14,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:14,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:14,896 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:36:14,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:14,903 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-27 00:36:14,903 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:14,919 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:36:14,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:14,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-27 00:36:14,924 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:14,928 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-27 00:36:14,929 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:14,962 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:14,962 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-27 00:36:14,962 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-27 00:36:15,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:15,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:36:15,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2019-12-27 00:36:15,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226501191] [2019-12-27 00:36:15,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 00:36:15,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:15,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 00:36:15,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:36:15,095 INFO L87 Difference]: Start difference. First operand 435 states and 959 transitions. Second operand 32 states. [2019-12-27 00:36:17,293 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2019-12-27 00:36:17,518 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2019-12-27 00:36:18,040 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-12-27 00:36:18,588 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 51 [2019-12-27 00:36:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:20,037 INFO L93 Difference]: Finished difference Result 548 states and 1192 transitions. [2019-12-27 00:36:20,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 00:36:20,038 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 25 [2019-12-27 00:36:20,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:20,041 INFO L225 Difference]: With dead ends: 548 [2019-12-27 00:36:20,041 INFO L226 Difference]: Without dead ends: 531 [2019-12-27 00:36:20,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=522, Invalid=2900, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 00:36:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-12-27 00:36:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 472. [2019-12-27 00:36:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-12-27 00:36:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1038 transitions. [2019-12-27 00:36:20,050 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1038 transitions. Word has length 25 [2019-12-27 00:36:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:20,050 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 1038 transitions. [2019-12-27 00:36:20,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 00:36:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1038 transitions. [2019-12-27 00:36:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:36:20,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:20,051 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:20,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:36:20,255 INFO L410 AbstractCegarLoop]: === Iteration 23 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:36:20,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:20,255 INFO L82 PathProgramCache]: Analyzing trace with hash 638994318, now seen corresponding path program 3 times [2019-12-27 00:36:20,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:20,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191205498] [2019-12-27 00:36:20,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:20,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191205498] [2019-12-27 00:36:20,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576742845] [2019-12-27 00:36:20,904 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-27 00:36:20,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:36:20,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:36:20,987 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 76 conjunts are in the unsatisfiable core [2019-12-27 00:36:20,989 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:36:20,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-27 00:36:20,998 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 00:36:21,022 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 00:36:21,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:21,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:36:21,028 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:21,037 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:21,038 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:36:21,038 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:36:21,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:21,264 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:21,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:36:21,265 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:21,308 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-27 00:36:21,309 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-27 00:36:21,309 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2019-12-27 00:36:21,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:21,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:21,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:21,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-27 00:36:21,394 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:21,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:21,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-27 00:36:21,407 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:21,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-27 00:36:21,412 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:21,423 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:21,424 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-27 00:36:21,424 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-27 00:36:21,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:21,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:21,617 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:36:21,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:21,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-27 00:36:21,623 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:21,637 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:36:21,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:21,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-27 00:36:21,643 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:21,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-27 00:36:21,648 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:21,656 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:21,657 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-27 00:36:21,657 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-27 00:36:21,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:21,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:36:21,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2019-12-27 00:36:21,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262463811] [2019-12-27 00:36:21,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 00:36:21,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:21,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 00:36:21,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2019-12-27 00:36:21,749 INFO L87 Difference]: Start difference. First operand 472 states and 1038 transitions. Second operand 29 states. [2019-12-27 00:36:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:25,128 INFO L93 Difference]: Finished difference Result 543 states and 1182 transitions. [2019-12-27 00:36:25,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:36:25,129 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2019-12-27 00:36:25,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:25,132 INFO L225 Difference]: With dead ends: 543 [2019-12-27 00:36:25,132 INFO L226 Difference]: Without dead ends: 526 [2019-12-27 00:36:25,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=384, Invalid=2166, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 00:36:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-12-27 00:36:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 472. [2019-12-27 00:36:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-12-27 00:36:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1038 transitions. [2019-12-27 00:36:25,149 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1038 transitions. Word has length 25 [2019-12-27 00:36:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:25,149 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 1038 transitions. [2019-12-27 00:36:25,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 00:36:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1038 transitions. [2019-12-27 00:36:25,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:36:25,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:25,156 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:25,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:36:25,366 INFO L410 AbstractCegarLoop]: === Iteration 24 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:36:25,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:25,366 INFO L82 PathProgramCache]: Analyzing trace with hash -631310293, now seen corresponding path program 15 times [2019-12-27 00:36:25,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:25,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374044418] [2019-12-27 00:36:25,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:25,758 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 38 [2019-12-27 00:36:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:26,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374044418] [2019-12-27 00:36:26,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849623285] [2019-12-27 00:36:26,549 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 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-27 00:36:26,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:36:26,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:36:26,627 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 99 conjunts are in the unsatisfiable core [2019-12-27 00:36:26,628 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:36:26,637 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-27 00:36:26,638 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:26,670 INFO L614 ElimStorePlain]: treesize reduction 13, result has 78.7 percent of original size [2019-12-27 00:36:26,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:26,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:36:26,680 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:26,693 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:26,693 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:36:26,694 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:34 [2019-12-27 00:36:27,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,100 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:36:27,127 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:27,128 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:36:27,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:27,192 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 00:36:27,193 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-27 00:36:27,193 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-27 00:36:27,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:27,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:27,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,369 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:36:27,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-27 00:36:27,379 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:27,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,401 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:36:27,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-27 00:36:27,410 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:27,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-27 00:36:27,419 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:27,440 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:27,441 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-27 00:36:27,441 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-27 00:36:27,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:27,682 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:27,683 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 120 [2019-12-27 00:36:27,684 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:27,742 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-27 00:36:27,743 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-27 00:36:27,743 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 00:36:27,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:27,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:27,843 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-27 00:36:27,843 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:27,875 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-27 00:36:27,876 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:27,890 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-27 00:36:27,891 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:27,950 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-27 00:36:27,950 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-27 00:36:27,950 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:212, output treesize:46 [2019-12-27 00:36:28,185 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:28,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-27 00:36:28,186 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:28,194 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:28,195 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-27 00:36:28,195 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:7 [2019-12-27 00:36:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:28,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:36:28,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 36 [2019-12-27 00:36:28,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664596271] [2019-12-27 00:36:28,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-27 00:36:28,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:28,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-27 00:36:28,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 00:36:28,292 INFO L87 Difference]: Start difference. First operand 472 states and 1038 transitions. Second operand 38 states. [2019-12-27 00:36:29,443 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2019-12-27 00:36:29,836 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 67 [2019-12-27 00:36:30,219 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-12-27 00:36:30,625 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-12-27 00:36:31,028 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-12-27 00:36:31,711 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-12-27 00:36:31,912 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2019-12-27 00:36:32,326 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 75 [2019-12-27 00:36:32,574 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 75 [2019-12-27 00:36:33,122 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 79 [2019-12-27 00:36:33,384 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 78 [2019-12-27 00:36:33,574 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-12-27 00:36:33,790 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-12-27 00:36:34,281 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2019-12-27 00:36:34,510 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-12-27 00:36:35,114 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 79 [2019-12-27 00:36:35,370 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2019-12-27 00:36:35,898 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 82 [2019-12-27 00:36:36,360 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2019-12-27 00:36:36,632 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2019-12-27 00:36:36,930 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-12-27 00:36:37,219 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 82 [2019-12-27 00:36:37,557 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-12-27 00:36:37,832 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 69 [2019-12-27 00:36:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:38,535 INFO L93 Difference]: Finished difference Result 721 states and 1595 transitions. [2019-12-27 00:36:38,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 00:36:38,535 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 25 [2019-12-27 00:36:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:38,540 INFO L225 Difference]: With dead ends: 721 [2019-12-27 00:36:38,540 INFO L226 Difference]: Without dead ends: 721 [2019-12-27 00:36:38,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=779, Invalid=4771, Unknown=0, NotChecked=0, Total=5550 [2019-12-27 00:36:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-12-27 00:36:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 478. [2019-12-27 00:36:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-12-27 00:36:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1051 transitions. [2019-12-27 00:36:38,550 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1051 transitions. Word has length 25 [2019-12-27 00:36:38,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:38,550 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 1051 transitions. [2019-12-27 00:36:38,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-27 00:36:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1051 transitions. [2019-12-27 00:36:38,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:36:38,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:38,551 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:38,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:36:38,755 INFO L410 AbstractCegarLoop]: === Iteration 25 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:36:38,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:38,756 INFO L82 PathProgramCache]: Analyzing trace with hash 927642954, now seen corresponding path program 4 times [2019-12-27 00:36:38,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:38,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155040901] [2019-12-27 00:36:38,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:39,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155040901] [2019-12-27 00:36:39,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209005411] [2019-12-27 00:36:39,546 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:36:39,612 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:36:39,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:36:39,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 84 conjunts are in the unsatisfiable core [2019-12-27 00:36:39,616 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:36:39,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-27 00:36:39,650 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:39,665 INFO L614 ElimStorePlain]: treesize reduction 13, result has 76.4 percent of original size [2019-12-27 00:36:39,678 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-12-27 00:36:39,678 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 1 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:36:39,678 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:39,687 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:39,687 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:36:39,687 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:28 [2019-12-27 00:36:40,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:40,042 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:40,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:36:40,044 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:40,104 INFO L614 ElimStorePlain]: treesize reduction 46, result has 48.3 percent of original size [2019-12-27 00:36:40,104 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-27 00:36:40,105 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:34 [2019-12-27 00:36:40,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:40,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:40,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:40,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:40,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-27 00:36:40,319 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:40,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:40,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:40,343 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-27 00:36:40,344 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:40,357 INFO L343 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2019-12-27 00:36:40,357 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 43 [2019-12-27 00:36:40,358 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:40,372 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:40,373 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-27 00:36:40,374 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:28 [2019-12-27 00:36:40,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:40,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:40,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:40,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:40,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2019-12-27 00:36:40,606 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:40,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:40,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:40,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-12-27 00:36:40,624 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:40,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:40,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2019-12-27 00:36:40,630 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:40,638 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:40,639 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-27 00:36:40,639 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:28 [2019-12-27 00:36:40,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:40,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:36:40,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 29 [2019-12-27 00:36:40,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167400782] [2019-12-27 00:36:40,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 00:36:40,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:40,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 00:36:40,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2019-12-27 00:36:40,820 INFO L87 Difference]: Start difference. First operand 478 states and 1051 transitions. Second operand 30 states. [2019-12-27 00:36:42,285 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-12-27 00:36:42,661 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-12-27 00:36:43,269 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2019-12-27 00:36:43,637 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 43 [2019-12-27 00:36:43,977 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2019-12-27 00:36:44,203 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 52 [2019-12-27 00:36:45,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:45,778 INFO L93 Difference]: Finished difference Result 520 states and 1132 transitions. [2019-12-27 00:36:45,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 00:36:45,778 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 25 [2019-12-27 00:36:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:45,782 INFO L225 Difference]: With dead ends: 520 [2019-12-27 00:36:45,782 INFO L226 Difference]: Without dead ends: 503 [2019-12-27 00:36:45,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=470, Invalid=2722, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 00:36:45,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-12-27 00:36:45,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 450. [2019-12-27 00:36:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-12-27 00:36:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 990 transitions. [2019-12-27 00:36:45,791 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 990 transitions. Word has length 25 [2019-12-27 00:36:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:45,791 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 990 transitions. [2019-12-27 00:36:45,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 00:36:45,791 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 990 transitions. [2019-12-27 00:36:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:36:45,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:45,793 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:45,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:36:45,998 INFO L410 AbstractCegarLoop]: === Iteration 26 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:36:45,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:45,999 INFO L82 PathProgramCache]: Analyzing trace with hash -709771567, now seen corresponding path program 16 times [2019-12-27 00:36:45,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:45,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119955978] [2019-12-27 00:36:45,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:46,566 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 41 [2019-12-27 00:36:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:47,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119955978] [2019-12-27 00:36:47,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400887159] [2019-12-27 00:36:47,600 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:36:47,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:36:47,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:36:47,666 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 104 conjunts are in the unsatisfiable core [2019-12-27 00:36:47,667 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:36:47,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-27 00:36:47,679 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 00:36:47,705 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 00:36:47,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:47,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:36:47,711 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:47,721 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:47,722 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:36:47,722 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 00:36:48,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,181 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:36:48,208 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:48,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:36:48,210 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:48,270 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 00:36:48,271 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:36:48,271 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-27 00:36:48,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:48,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:48,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-27 00:36:48,477 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:48,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-27 00:36:48,504 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:48,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,511 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-27 00:36:48,511 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:48,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:48,533 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:36:48,533 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-27 00:36:48,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:48,785 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:48,785 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 120 [2019-12-27 00:36:48,786 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:48,844 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-27 00:36:48,845 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:36:48,845 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:49 [2019-12-27 00:36:48,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:48,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:48,967 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-27 00:36:48,968 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:48,999 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-27 00:36:49,000 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:49,010 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-27 00:36:49,011 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:49,074 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-27 00:36:49,075 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-27 00:36:49,075 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:212, output treesize:46 [2019-12-27 00:36:49,237 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:49,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-27 00:36:49,239 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:49,245 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:49,245 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-27 00:36:49,246 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:7 [2019-12-27 00:36:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:49,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:36:49,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 36 [2019-12-27 00:36:49,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237087709] [2019-12-27 00:36:49,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-27 00:36:49,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:49,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-27 00:36:49,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1292, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 00:36:49,331 INFO L87 Difference]: Start difference. First operand 450 states and 990 transitions. Second operand 38 states. [2019-12-27 00:36:50,172 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-12-27 00:36:50,561 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-12-27 00:36:50,867 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2019-12-27 00:36:51,123 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 53 [2019-12-27 00:36:51,887 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-12-27 00:36:52,290 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-12-27 00:36:52,577 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-12-27 00:36:53,205 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2019-12-27 00:36:53,550 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2019-12-27 00:36:54,090 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 64 [2019-12-27 00:36:54,436 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2019-12-27 00:36:54,653 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2019-12-27 00:36:55,047 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 72 [2019-12-27 00:36:55,546 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2019-12-27 00:36:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:36:56,165 INFO L93 Difference]: Finished difference Result 563 states and 1237 transitions. [2019-12-27 00:36:56,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 00:36:56,166 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 25 [2019-12-27 00:36:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:36:56,170 INFO L225 Difference]: With dead ends: 563 [2019-12-27 00:36:56,170 INFO L226 Difference]: Without dead ends: 563 [2019-12-27 00:36:56,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=512, Invalid=3648, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 00:36:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-12-27 00:36:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 407. [2019-12-27 00:36:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-27 00:36:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 899 transitions. [2019-12-27 00:36:56,177 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 899 transitions. Word has length 25 [2019-12-27 00:36:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:36:56,177 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 899 transitions. [2019-12-27 00:36:56,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-27 00:36:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 899 transitions. [2019-12-27 00:36:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:36:56,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:36:56,179 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:36:56,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:36:56,383 INFO L410 AbstractCegarLoop]: === Iteration 27 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:36:56,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:36:56,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1324684501, now seen corresponding path program 17 times [2019-12-27 00:36:56,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:36:56,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365496391] [2019-12-27 00:36:56,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:36:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:36:56,814 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 40 [2019-12-27 00:36:57,131 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2019-12-27 00:36:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:57,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365496391] [2019-12-27 00:36:57,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411683081] [2019-12-27 00:36:57,681 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:36:57,751 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:36:57,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:36:57,753 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 98 conjunts are in the unsatisfiable core [2019-12-27 00:36:57,756 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:36:57,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-27 00:36:57,772 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 00:36:57,807 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 00:36:57,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:57,812 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:36:57,813 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:57,824 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:57,824 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:36:57,825 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:36:58,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,274 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:36:58,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:58,304 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:36:58,306 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:58,367 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 00:36:58,368 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-27 00:36:58,369 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-27 00:36:58,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:58,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:58,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,572 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-27 00:36:58,573 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:58,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-27 00:36:58,601 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:58,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,610 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-27 00:36:58,611 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:58,632 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:58,632 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-27 00:36:58,633 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-27 00:36:58,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:36:58,896 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:58,896 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 120 [2019-12-27 00:36:58,897 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:58,959 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-27 00:36:58,960 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-27 00:36:58,960 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 00:36:59,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:59,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:36:59,063 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-27 00:36:59,064 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:59,090 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-27 00:36:59,091 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:59,104 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-27 00:36:59,105 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:59,170 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-27 00:36:59,171 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-27 00:36:59,171 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:212, output treesize:46 [2019-12-27 00:36:59,351 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:59,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-27 00:36:59,353 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:36:59,360 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:36:59,360 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-27 00:36:59,360 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:7 [2019-12-27 00:36:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:36:59,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:36:59,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 35 [2019-12-27 00:36:59,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139923497] [2019-12-27 00:36:59,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-27 00:36:59,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:36:59,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-27 00:36:59,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 00:36:59,456 INFO L87 Difference]: Start difference. First operand 407 states and 899 transitions. Second operand 37 states. [2019-12-27 00:37:00,368 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-12-27 00:37:00,601 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-12-27 00:37:00,812 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-12-27 00:37:01,671 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-27 00:37:01,908 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-12-27 00:37:02,406 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-12-27 00:37:02,677 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-12-27 00:37:03,116 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-27 00:37:03,374 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-12-27 00:37:03,842 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-12-27 00:37:04,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:04,711 INFO L93 Difference]: Finished difference Result 501 states and 1106 transitions. [2019-12-27 00:37:04,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 00:37:04,712 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 25 [2019-12-27 00:37:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:04,715 INFO L225 Difference]: With dead ends: 501 [2019-12-27 00:37:04,715 INFO L226 Difference]: Without dead ends: 501 [2019-12-27 00:37:04,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=489, Invalid=3417, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 00:37:04,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-12-27 00:37:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 397. [2019-12-27 00:37:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-12-27 00:37:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 877 transitions. [2019-12-27 00:37:04,723 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 877 transitions. Word has length 25 [2019-12-27 00:37:04,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:04,723 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 877 transitions. [2019-12-27 00:37:04,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-27 00:37:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 877 transitions. [2019-12-27 00:37:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:37:04,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:04,725 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:04,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:04,928 INFO L410 AbstractCegarLoop]: === Iteration 28 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:04,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:04,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1550608564, now seen corresponding path program 5 times [2019-12-27 00:37:04,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:04,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513186766] [2019-12-27 00:37:04,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:05,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513186766] [2019-12-27 00:37:05,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143396672] [2019-12-27 00:37:05,888 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:05,977 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:37:05,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:05,979 WARN L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 91 conjunts are in the unsatisfiable core [2019-12-27 00:37:05,980 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:05,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-27 00:37:05,988 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 00:37:06,015 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 00:37:06,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:06,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:37:06,020 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:06,031 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:06,031 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:37:06,032 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:37:06,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:06,341 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:06,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:37:06,343 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:06,389 INFO L614 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-12-27 00:37:06,390 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-27 00:37:06,390 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:46 [2019-12-27 00:37:06,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:06,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:06,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:06,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-27 00:37:06,526 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:06,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:06,547 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2019-12-27 00:37:06,548 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:06,553 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2019-12-27 00:37:06,554 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:06,566 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:06,566 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-27 00:37:06,567 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:210, output treesize:36 [2019-12-27 00:37:06,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:06,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:06,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:06,825 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:06,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:06,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-27 00:37:06,829 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:06,853 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:06,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:06,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2019-12-27 00:37:06,856 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:06,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2019-12-27 00:37:06,863 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:06,875 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:06,875 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-27 00:37:06,876 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:210, output treesize:36 [2019-12-27 00:37:06,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:06,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2019-12-27 00:37:06,987 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:06,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2019-12-27 00:37:06,994 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:06,998 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:06,998 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-27 00:37:06,999 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:3 [2019-12-27 00:37:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:07,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:07,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-12-27 00:37:07,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886525081] [2019-12-27 00:37:07,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 00:37:07,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:07,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 00:37:07,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:37:07,006 INFO L87 Difference]: Start difference. First operand 397 states and 877 transitions. Second operand 32 states. [2019-12-27 00:37:07,741 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2019-12-27 00:37:07,997 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-12-27 00:37:08,277 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-12-27 00:37:08,469 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2019-12-27 00:37:08,729 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-12-27 00:37:08,952 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-12-27 00:37:09,131 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2019-12-27 00:37:09,352 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 63 [2019-12-27 00:37:09,606 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2019-12-27 00:37:10,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:10,867 INFO L93 Difference]: Finished difference Result 433 states and 946 transitions. [2019-12-27 00:37:10,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 00:37:10,868 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 25 [2019-12-27 00:37:10,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:10,871 INFO L225 Difference]: With dead ends: 433 [2019-12-27 00:37:10,871 INFO L226 Difference]: Without dead ends: 416 [2019-12-27 00:37:10,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=380, Invalid=1972, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 00:37:10,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-12-27 00:37:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 345. [2019-12-27 00:37:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-27 00:37:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 768 transitions. [2019-12-27 00:37:10,878 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 768 transitions. Word has length 25 [2019-12-27 00:37:10,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:10,878 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 768 transitions. [2019-12-27 00:37:10,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 00:37:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 768 transitions. [2019-12-27 00:37:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:37:10,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:10,879 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:11,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:11,083 INFO L410 AbstractCegarLoop]: === Iteration 29 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:11,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:11,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2088272730, now seen corresponding path program 18 times [2019-12-27 00:37:11,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:11,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896609207] [2019-12-27 00:37:11,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:11,608 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-12-27 00:37:11,852 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2019-12-27 00:37:12,278 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-12-27 00:37:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:13,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896609207] [2019-12-27 00:37:13,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681019750] [2019-12-27 00:37:13,034 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:13,120 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 00:37:13,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:13,122 WARN L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 108 conjunts are in the unsatisfiable core [2019-12-27 00:37:13,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:13,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,161 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-27 00:37:13,162 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 1 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:37:13,162 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:13,171 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:13,171 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:37:13,172 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:27 [2019-12-27 00:37:13,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,404 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:13,431 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:13,432 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 76 [2019-12-27 00:37:13,433 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:13,485 INFO L614 ElimStorePlain]: treesize reduction 46, result has 48.9 percent of original size [2019-12-27 00:37:13,485 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:37:13,486 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:44 [2019-12-27 00:37:13,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,627 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 62 treesize of output 46 [2019-12-27 00:37:13,628 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:13,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,645 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 76 treesize of output 54 [2019-12-27 00:37:13,646 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:13,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2019-12-27 00:37:13,653 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:13,668 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:13,669 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:37:13,669 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:236, output treesize:38 [2019-12-27 00:37:13,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:13,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:13,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 111 [2019-12-27 00:37:13,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:13,886 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 00:37:14,022 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 39 [2019-12-27 00:37:14,023 INFO L614 ElimStorePlain]: treesize reduction 740, result has 9.2 percent of original size [2019-12-27 00:37:14,023 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-27 00:37:14,024 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:79, output treesize:57 [2019-12-27 00:37:14,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:14,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:14,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:14,113 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 63 treesize of output 49 [2019-12-27 00:37:14,115 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:37:14,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:14,156 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 75 treesize of output 57 [2019-12-27 00:37:14,157 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:37:14,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2019-12-27 00:37:14,164 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:37:14,229 INFO L614 ElimStorePlain]: treesize reduction 125, result has 27.7 percent of original size [2019-12-27 00:37:14,229 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:37:14,230 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:237, output treesize:48 [2019-12-27 00:37:14,499 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:14,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 123 [2019-12-27 00:37:14,500 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:14,566 INFO L614 ElimStorePlain]: treesize reduction 64, result has 51.5 percent of original size [2019-12-27 00:37:14,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:14,567 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-27 00:37:14,568 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:23 [2019-12-27 00:37:14,650 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:14,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 35 [2019-12-27 00:37:14,651 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:14,671 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:14,671 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-27 00:37:14,672 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:9 [2019-12-27 00:37:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:14,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:14,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 34 [2019-12-27 00:37:14,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815134409] [2019-12-27 00:37:14,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 00:37:14,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:14,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 00:37:14,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 00:37:14,680 INFO L87 Difference]: Start difference. First operand 345 states and 768 transitions. Second operand 36 states. [2019-12-27 00:37:18,035 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-12-27 00:37:19,154 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-27 00:37:19,516 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2019-12-27 00:37:19,888 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-12-27 00:37:20,113 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-12-27 00:37:20,411 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-12-27 00:37:20,580 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-12-27 00:37:20,766 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-27 00:37:21,048 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-12-27 00:37:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:23,050 INFO L93 Difference]: Finished difference Result 591 states and 1296 transitions. [2019-12-27 00:37:23,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-27 00:37:23,051 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 30 [2019-12-27 00:37:23,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:23,054 INFO L225 Difference]: With dead ends: 591 [2019-12-27 00:37:23,054 INFO L226 Difference]: Without dead ends: 591 [2019-12-27 00:37:23,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 9 SyntacticMatches, 12 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2784 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=838, Invalid=7718, Unknown=0, NotChecked=0, Total=8556 [2019-12-27 00:37:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-12-27 00:37:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 491. [2019-12-27 00:37:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-12-27 00:37:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 1098 transitions. [2019-12-27 00:37:23,067 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 1098 transitions. Word has length 30 [2019-12-27 00:37:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:23,067 INFO L462 AbstractCegarLoop]: Abstraction has 491 states and 1098 transitions. [2019-12-27 00:37:23,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 00:37:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 1098 transitions. [2019-12-27 00:37:23,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:37:23,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:23,068 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:23,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:23,277 INFO L410 AbstractCegarLoop]: === Iteration 30 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:23,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:23,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1686493757, now seen corresponding path program 6 times [2019-12-27 00:37:23,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:23,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146694160] [2019-12-27 00:37:23,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:24,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:24,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146694160] [2019-12-27 00:37:24,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569113908] [2019-12-27 00:37:24,319 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:24,405 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 00:37:24,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:24,408 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 116 conjunts are in the unsatisfiable core [2019-12-27 00:37:24,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:24,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-27 00:37:24,420 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 00:37:24,447 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 00:37:24,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:24,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:37:24,450 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:24,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:24,463 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:37:24,463 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:37:24,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:24,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:24,900 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:24,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:24,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:37:24,928 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:24,991 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-27 00:37:24,992 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-27 00:37:24,992 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 00:37:25,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:25,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:25,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:25,130 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:25,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:25,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-27 00:37:25,134 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:25,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:25,154 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:25,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:25,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-27 00:37:25,158 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:25,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:25,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-27 00:37:25,164 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:25,184 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:25,185 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-27 00:37:25,185 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-27 00:37:25,387 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:25,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 77 [2019-12-27 00:37:25,388 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:25,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:25,406 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-27 00:37:25,406 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-27 00:37:25,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:25,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:25,723 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:25,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:25,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:25,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 114 [2019-12-27 00:37:25,770 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:25,802 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:25,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:25,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:25,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 113 [2019-12-27 00:37:25,845 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:25,886 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:25,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 124 [2019-12-27 00:37:25,888 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:25,927 INFO L614 ElimStorePlain]: treesize reduction 26, result has 63.4 percent of original size [2019-12-27 00:37:25,928 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-27 00:37:25,928 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:258, output treesize:45 [2019-12-27 00:37:26,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:26,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:26,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2019-12-27 00:37:26,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331968698] [2019-12-27 00:37:26,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-27 00:37:26,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:26,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-27 00:37:26,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 00:37:26,067 INFO L87 Difference]: Start difference. First operand 491 states and 1098 transitions. Second operand 38 states. [2019-12-27 00:37:28,384 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-12-27 00:37:31,000 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-27 00:37:31,177 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-12-27 00:37:31,555 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-27 00:37:31,701 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-12-27 00:37:32,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:32,664 INFO L93 Difference]: Finished difference Result 546 states and 1204 transitions. [2019-12-27 00:37:32,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 00:37:32,665 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 30 [2019-12-27 00:37:32,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:32,668 INFO L225 Difference]: With dead ends: 546 [2019-12-27 00:37:32,668 INFO L226 Difference]: Without dead ends: 534 [2019-12-27 00:37:32,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=745, Invalid=5417, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 00:37:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-12-27 00:37:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 497. [2019-12-27 00:37:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-12-27 00:37:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1110 transitions. [2019-12-27 00:37:32,678 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1110 transitions. Word has length 30 [2019-12-27 00:37:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:32,679 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 1110 transitions. [2019-12-27 00:37:32,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-27 00:37:32,679 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1110 transitions. [2019-12-27 00:37:32,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:37:32,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:32,680 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:32,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:32,883 INFO L410 AbstractCegarLoop]: === Iteration 31 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:32,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:32,884 INFO L82 PathProgramCache]: Analyzing trace with hash 6218509, now seen corresponding path program 7 times [2019-12-27 00:37:32,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:32,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582306822] [2019-12-27 00:37:32,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:34,048 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 42 [2019-12-27 00:37:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:34,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582306822] [2019-12-27 00:37:34,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620662384] [2019-12-27 00:37:34,206 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:34,288 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 128 conjunts are in the unsatisfiable core [2019-12-27 00:37:34,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:34,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:34,318 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-27 00:37:34,318 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 1 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:37:34,319 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:34,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:34,326 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:37:34,326 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:27 [2019-12-27 00:37:34,518 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:34,540 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:34,541 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 76 [2019-12-27 00:37:34,542 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:34,593 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.5 percent of original size [2019-12-27 00:37:34,594 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-27 00:37:34,594 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:38 [2019-12-27 00:37:34,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:34,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:34,688 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:34,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:34,690 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:34,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:34,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 42 [2019-12-27 00:37:34,696 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:34,700 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:34,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:34,702 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:34,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:34,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2019-12-27 00:37:34,709 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:34,712 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:34,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:34,713 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 0 case distinctions, treesize of input 50 treesize of output 33 [2019-12-27 00:37:34,713 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:34,728 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:34,728 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:37:34,728 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:212, output treesize:32 [2019-12-27 00:37:34,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:34,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:35,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:35,020 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:35,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:35,025 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 45 [2019-12-27 00:37:35,026 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:35,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:35,038 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:35,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:35,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 36 [2019-12-27 00:37:35,044 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:35,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:35,050 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 0 case distinctions, treesize of input 56 treesize of output 37 [2019-12-27 00:37:35,051 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:35,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:35,068 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:37:35,068 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:225, output treesize:41 [2019-12-27 00:37:35,145 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:35,146 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 67 [2019-12-27 00:37:35,147 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:35,171 INFO L614 ElimStorePlain]: treesize reduction 16, result has 63.6 percent of original size [2019-12-27 00:37:35,171 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 00:37:35,172 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:28 [2019-12-27 00:37:35,283 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:35,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 44 [2019-12-27 00:37:35,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:35,287 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:35,287 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-27 00:37:35,287 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:7 [2019-12-27 00:37:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:35,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:35,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 35 [2019-12-27 00:37:35,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065492609] [2019-12-27 00:37:35,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 00:37:35,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:35,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 00:37:35,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 00:37:35,365 INFO L87 Difference]: Start difference. First operand 497 states and 1110 transitions. Second operand 36 states. [2019-12-27 00:37:36,661 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-12-27 00:37:37,101 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-12-27 00:37:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:39,685 INFO L93 Difference]: Finished difference Result 540 states and 1189 transitions. [2019-12-27 00:37:39,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 00:37:39,685 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 30 [2019-12-27 00:37:39,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:39,689 INFO L225 Difference]: With dead ends: 540 [2019-12-27 00:37:39,689 INFO L226 Difference]: Without dead ends: 530 [2019-12-27 00:37:39,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=450, Invalid=3456, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 00:37:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-12-27 00:37:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 503. [2019-12-27 00:37:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-12-27 00:37:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 1122 transitions. [2019-12-27 00:37:39,696 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 1122 transitions. Word has length 30 [2019-12-27 00:37:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:39,696 INFO L462 AbstractCegarLoop]: Abstraction has 503 states and 1122 transitions. [2019-12-27 00:37:39,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 00:37:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 1122 transitions. [2019-12-27 00:37:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:37:39,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:39,697 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:39,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:39,899 INFO L410 AbstractCegarLoop]: === Iteration 32 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:39,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:39,899 INFO L82 PathProgramCache]: Analyzing trace with hash -383631969, now seen corresponding path program 8 times [2019-12-27 00:37:39,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:39,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128980087] [2019-12-27 00:37:39,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:40,396 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 36 [2019-12-27 00:37:40,633 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 36 [2019-12-27 00:37:41,228 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2019-12-27 00:37:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:41,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128980087] [2019-12-27 00:37:41,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41731468] [2019-12-27 00:37:41,448 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:41,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:37:41,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:41,547 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 99 conjunts are in the unsatisfiable core [2019-12-27 00:37:41,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:41,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-27 00:37:41,563 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:41,581 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 00:37:41,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:41,586 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:37:41,586 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:41,597 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:41,598 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:37:41,598 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:37:41,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:41,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:41,928 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:41,952 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:41,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:37:41,954 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:42,005 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-27 00:37:42,006 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-27 00:37:42,006 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:43 [2019-12-27 00:37:42,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:42,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:42,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:42,145 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:42,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:42,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-27 00:37:42,150 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:42,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:42,181 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:42,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:42,184 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-27 00:37:42,185 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:42,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:42,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-27 00:37:42,193 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:42,206 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:42,207 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-27 00:37:42,207 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:233, output treesize:37 [2019-12-27 00:37:42,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:42,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:42,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:42,582 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:42,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:42,589 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2019-12-27 00:37:42,589 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:42,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:42,603 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:42,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:42,610 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2019-12-27 00:37:42,610 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:42,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:42,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2019-12-27 00:37:42,617 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:42,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:42,644 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-27 00:37:42,645 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:240, output treesize:40 [2019-12-27 00:37:42,720 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 33 treesize of output 38 [2019-12-27 00:37:42,721 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:42,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:42,735 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-27 00:37:42,735 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:29 [2019-12-27 00:37:42,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:42,873 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:42,876 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:42,878 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:42,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-12-27 00:37:42,879 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:42,883 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:42,884 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2019-12-27 00:37:42,884 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:42,889 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:42,890 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-27 00:37:42,890 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:7 [2019-12-27 00:37:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:42,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:42,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 39 [2019-12-27 00:37:42,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190617754] [2019-12-27 00:37:42,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 00:37:42,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:42,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 00:37:42,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1453, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 00:37:42,940 INFO L87 Difference]: Start difference. First operand 503 states and 1122 transitions. Second operand 40 states. [2019-12-27 00:37:44,064 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2019-12-27 00:37:44,344 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 60 [2019-12-27 00:37:44,588 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-12-27 00:37:46,002 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-12-27 00:37:46,220 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-12-27 00:37:46,398 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-12-27 00:37:46,730 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-12-27 00:37:46,894 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-12-27 00:37:47,080 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-27 00:37:47,515 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-12-27 00:37:47,725 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-12-27 00:37:47,926 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-27 00:37:48,178 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-12-27 00:37:48,410 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-12-27 00:37:48,714 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-12-27 00:37:48,891 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-12-27 00:37:49,181 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-12-27 00:37:49,374 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-12-27 00:37:49,566 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-12-27 00:37:50,179 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-12-27 00:37:50,363 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-27 00:37:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:37:52,164 INFO L93 Difference]: Finished difference Result 632 states and 1377 transitions. [2019-12-27 00:37:52,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 00:37:52,164 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 30 [2019-12-27 00:37:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:37:52,168 INFO L225 Difference]: With dead ends: 632 [2019-12-27 00:37:52,168 INFO L226 Difference]: Without dead ends: 622 [2019-12-27 00:37:52,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1872 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=812, Invalid=6498, Unknown=0, NotChecked=0, Total=7310 [2019-12-27 00:37:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-12-27 00:37:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 501. [2019-12-27 00:37:52,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-12-27 00:37:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1118 transitions. [2019-12-27 00:37:52,176 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1118 transitions. Word has length 30 [2019-12-27 00:37:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:37:52,176 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 1118 transitions. [2019-12-27 00:37:52,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 00:37:52,177 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1118 transitions. [2019-12-27 00:37:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:37:52,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:37:52,178 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:37:52,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:52,381 INFO L410 AbstractCegarLoop]: === Iteration 33 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:37:52,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:37:52,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1470594389, now seen corresponding path program 9 times [2019-12-27 00:37:52,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:37:52,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101512169] [2019-12-27 00:37:52,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:37:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:37:52,906 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 36 [2019-12-27 00:37:53,138 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 36 [2019-12-27 00:37:53,743 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2019-12-27 00:37:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:53,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101512169] [2019-12-27 00:37:53,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263847402] [2019-12-27 00:37:53,972 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:37:54,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 00:37:54,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:37:54,053 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 99 conjunts are in the unsatisfiable core [2019-12-27 00:37:54,054 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:37:54,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-27 00:37:54,062 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 00:37:54,089 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 00:37:54,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:54,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:37:54,094 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:54,106 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:54,107 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:37:54,107 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:37:54,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:54,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:54,429 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:54,454 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:54,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:37:54,456 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:54,510 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-27 00:37:54,511 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-27 00:37:54,511 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:43 [2019-12-27 00:37:54,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:54,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:54,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:54,647 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:54,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:54,650 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-27 00:37:54,650 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:54,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:54,669 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:54,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:54,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-27 00:37:54,673 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:54,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:54,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-27 00:37:54,679 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:54,693 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:54,694 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-27 00:37:54,694 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:233, output treesize:37 [2019-12-27 00:37:55,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:55,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:55,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:55,079 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:55,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:55,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2019-12-27 00:37:55,086 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:55,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:55,098 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:55,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:55,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2019-12-27 00:37:55,105 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:55,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:37:55,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2019-12-27 00:37:55,111 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:55,127 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:55,128 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-27 00:37:55,128 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:240, output treesize:40 [2019-12-27 00:37:55,210 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 33 treesize of output 38 [2019-12-27 00:37:55,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:55,234 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:55,235 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-27 00:37:55,235 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:29 [2019-12-27 00:37:55,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:37:55,388 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:55,391 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:55,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:55,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-12-27 00:37:55,395 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:55,398 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:37:55,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2019-12-27 00:37:55,399 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:37:55,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:37:55,406 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-27 00:37:55,406 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:7 [2019-12-27 00:37:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:37:55,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:37:55,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 39 [2019-12-27 00:37:55,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439428432] [2019-12-27 00:37:55,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 00:37:55,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:37:55,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 00:37:55,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1453, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 00:37:55,457 INFO L87 Difference]: Start difference. First operand 501 states and 1118 transitions. Second operand 40 states. [2019-12-27 00:37:56,186 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-12-27 00:37:56,576 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2019-12-27 00:37:56,844 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 60 [2019-12-27 00:37:57,083 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-12-27 00:37:58,212 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-12-27 00:37:58,721 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-12-27 00:37:58,885 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-12-27 00:37:59,074 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-12-27 00:37:59,254 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-12-27 00:37:59,422 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-12-27 00:37:59,614 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-27 00:37:59,829 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-12-27 00:38:00,073 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-12-27 00:38:00,349 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-12-27 00:38:00,852 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-12-27 00:38:02,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:02,990 INFO L93 Difference]: Finished difference Result 595 states and 1306 transitions. [2019-12-27 00:38:02,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 00:38:02,991 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 30 [2019-12-27 00:38:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:02,995 INFO L225 Difference]: With dead ends: 595 [2019-12-27 00:38:02,995 INFO L226 Difference]: Without dead ends: 585 [2019-12-27 00:38:02,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=558, Invalid=4698, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 00:38:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-12-27 00:38:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 500. [2019-12-27 00:38:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-27 00:38:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1116 transitions. [2019-12-27 00:38:03,002 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1116 transitions. Word has length 30 [2019-12-27 00:38:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:03,002 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 1116 transitions. [2019-12-27 00:38:03,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 00:38:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1116 transitions. [2019-12-27 00:38:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:38:03,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:03,003 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:03,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:03,207 INFO L410 AbstractCegarLoop]: === Iteration 34 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:38:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash -48444409, now seen corresponding path program 10 times [2019-12-27 00:38:03,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:03,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150536265] [2019-12-27 00:38:03,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:03,563 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2019-12-27 00:38:03,827 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2019-12-27 00:38:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:04,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150536265] [2019-12-27 00:38:04,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989889304] [2019-12-27 00:38:04,931 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:05,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:38:05,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:38:05,026 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 121 conjunts are in the unsatisfiable core [2019-12-27 00:38:05,028 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:05,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-27 00:38:05,048 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 00:38:05,087 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 00:38:05,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:05,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:38:05,091 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:05,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:05,101 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:38:05,101 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:38:05,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:05,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:05,578 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:05,605 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:05,606 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:38:05,607 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:05,673 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-27 00:38:05,673 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-27 00:38:05,674 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 00:38:05,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:38:05,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:38:05,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:05,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:05,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:05,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-27 00:38:05,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:05,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:05,849 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:05,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:05,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-27 00:38:05,856 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:05,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:05,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-27 00:38:05,869 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:05,887 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:05,887 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-27 00:38:05,888 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-27 00:38:06,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:38:06,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:38:06,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:06,183 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:06,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:06,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-12-27 00:38:06,189 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:06,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:06,203 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:06,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:06,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2019-12-27 00:38:06,210 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:06,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:06,216 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2019-12-27 00:38:06,216 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:06,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:06,238 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-27 00:38:06,238 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:231, output treesize:43 [2019-12-27 00:38:06,412 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:06,413 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 77 [2019-12-27 00:38:06,413 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:06,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:06,426 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-27 00:38:06,427 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-27 00:38:06,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:06,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 47 [2019-12-27 00:38:06,567 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:06,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:06,573 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-27 00:38:06,573 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-27 00:38:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:06,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:06,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 40 [2019-12-27 00:38:06,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28361266] [2019-12-27 00:38:06,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-27 00:38:06,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:06,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-27 00:38:06,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1580, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 00:38:06,664 INFO L87 Difference]: Start difference. First operand 500 states and 1116 transitions. Second operand 42 states. [2019-12-27 00:38:07,706 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2019-12-27 00:38:07,965 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2019-12-27 00:38:08,200 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-12-27 00:38:09,539 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-27 00:38:10,217 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-12-27 00:38:10,903 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-12-27 00:38:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:13,823 INFO L93 Difference]: Finished difference Result 665 states and 1474 transitions. [2019-12-27 00:38:13,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 00:38:13,824 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 30 [2019-12-27 00:38:13,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:13,828 INFO L225 Difference]: With dead ends: 665 [2019-12-27 00:38:13,828 INFO L226 Difference]: Without dead ends: 665 [2019-12-27 00:38:13,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=662, Invalid=5658, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 00:38:13,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-12-27 00:38:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 577. [2019-12-27 00:38:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-12-27 00:38:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1288 transitions. [2019-12-27 00:38:13,837 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1288 transitions. Word has length 30 [2019-12-27 00:38:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:13,837 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 1288 transitions. [2019-12-27 00:38:13,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-27 00:38:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1288 transitions. [2019-12-27 00:38:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:38:13,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:13,839 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:14,042 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:14,042 INFO L410 AbstractCegarLoop]: === Iteration 35 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:38:14,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:14,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1731509287, now seen corresponding path program 11 times [2019-12-27 00:38:14,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:14,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897218207] [2019-12-27 00:38:14,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:15,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897218207] [2019-12-27 00:38:15,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695942911] [2019-12-27 00:38:15,054 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:15,134 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:38:15,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:38:15,136 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 108 conjunts are in the unsatisfiable core [2019-12-27 00:38:15,138 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:15,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-27 00:38:15,145 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 00:38:15,172 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 00:38:15,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:15,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:38:15,177 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:15,186 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:15,187 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 00:38:15,187 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 00:38:15,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:15,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:15,486 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:15,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:15,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:38:15,512 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:15,581 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-27 00:38:15,581 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-27 00:38:15,582 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 00:38:15,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:38:15,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:38:15,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:15,753 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:15,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:15,756 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-27 00:38:15,757 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:15,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:15,774 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:15,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:15,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-27 00:38:15,777 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:15,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:15,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-27 00:38:15,783 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:15,800 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:15,800 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-27 00:38:15,801 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-27 00:38:16,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:38:16,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:38:16,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:16,018 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:16,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:16,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-12-27 00:38:16,026 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:16,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:16,040 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:16,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:16,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2019-12-27 00:38:16,048 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:16,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:16,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2019-12-27 00:38:16,054 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:16,074 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:16,074 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-27 00:38:16,075 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:231, output treesize:43 [2019-12-27 00:38:16,286 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:16,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 77 [2019-12-27 00:38:16,287 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:16,320 INFO L614 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-12-27 00:38:16,321 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-27 00:38:16,321 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-27 00:38:16,456 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:16,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 47 [2019-12-27 00:38:16,457 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:16,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:16,462 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-27 00:38:16,462 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-27 00:38:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:16,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:16,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 37 [2019-12-27 00:38:16,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847814022] [2019-12-27 00:38:16,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-27 00:38:16,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:16,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-27 00:38:16,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1257, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 00:38:16,534 INFO L87 Difference]: Start difference. First operand 577 states and 1288 transitions. Second operand 38 states. [2019-12-27 00:38:17,414 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-12-27 00:38:17,749 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-27 00:38:18,024 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-12-27 00:38:18,491 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-27 00:38:18,925 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-27 00:38:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:38:21,544 INFO L93 Difference]: Finished difference Result 632 states and 1394 transitions. [2019-12-27 00:38:21,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 00:38:21,544 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 30 [2019-12-27 00:38:21,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:38:21,549 INFO L225 Difference]: With dead ends: 632 [2019-12-27 00:38:21,549 INFO L226 Difference]: Without dead ends: 622 [2019-12-27 00:38:21,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=584, Invalid=3838, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 00:38:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-12-27 00:38:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 589. [2019-12-27 00:38:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-12-27 00:38:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1312 transitions. [2019-12-27 00:38:21,556 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1312 transitions. Word has length 30 [2019-12-27 00:38:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:38:21,556 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 1312 transitions. [2019-12-27 00:38:21,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-27 00:38:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1312 transitions. [2019-12-27 00:38:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 00:38:21,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:38:21,557 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:38:21,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:21,758 INFO L410 AbstractCegarLoop]: === Iteration 36 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:38:21,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:38:21,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1694747289, now seen corresponding path program 12 times [2019-12-27 00:38:21,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:38:21,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491143121] [2019-12-27 00:38:21,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:38:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:38:22,287 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 40 [2019-12-27 00:38:22,870 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 32 [2019-12-27 00:38:23,042 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 34 [2019-12-27 00:38:23,238 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 34 [2019-12-27 00:38:23,445 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 32 [2019-12-27 00:38:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:23,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491143121] [2019-12-27 00:38:23,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284773853] [2019-12-27 00:38:23,760 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:23,832 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 00:38:23,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:38:23,834 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 107 conjunts are in the unsatisfiable core [2019-12-27 00:38:23,835 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:38:23,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-27 00:38:23,842 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:23,862 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 00:38:23,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:23,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-27 00:38:23,866 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:23,876 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:23,876 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:38:23,876 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 00:38:24,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:24,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:24,209 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:24,234 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:24,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-27 00:38:24,235 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:24,291 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-27 00:38:24,291 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:38:24,292 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:43 [2019-12-27 00:38:24,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:38:24,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:38:24,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:24,415 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:24,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:24,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-27 00:38:24,422 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:24,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:24,436 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:24,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:24,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-27 00:38:24,442 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:24,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:24,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-27 00:38:24,447 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:24,461 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:24,462 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:38:24,462 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:233, output treesize:37 [2019-12-27 00:38:24,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:38:24,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:38:24,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:24,740 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:24,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:24,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2019-12-27 00:38:24,753 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:24,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:24,759 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:24,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:24,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2019-12-27 00:38:24,770 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:24,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 00:38:24,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-12-27 00:38:24,775 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:24,802 INFO L614 ElimStorePlain]: treesize reduction 4, result has 89.2 percent of original size [2019-12-27 00:38:24,802 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:38:24,803 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:213, output treesize:33 [2019-12-27 00:38:25,012 INFO L343 Elim1Store]: treesize reduction 20, result has 76.7 percent of original size [2019-12-27 00:38:25,013 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 89 [2019-12-27 00:38:25,013 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:25,039 INFO L614 ElimStorePlain]: treesize reduction 8, result has 80.0 percent of original size [2019-12-27 00:38:25,040 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 00:38:25,040 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-12-27 00:38:25,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 00:38:25,164 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:25,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:25,170 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:25,177 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:25,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 21 [2019-12-27 00:38:25,177 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:25,181 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 00:38:25,187 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:25,187 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 22 [2019-12-27 00:38:25,188 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 00:38:25,194 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 00:38:25,194 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-27 00:38:25,195 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:7 [2019-12-27 00:38:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:38:25,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:38:25,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 39 [2019-12-27 00:38:25,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332509121] [2019-12-27 00:38:25,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 00:38:25,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:38:25,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 00:38:25,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 00:38:25,253 INFO L87 Difference]: Start difference. First operand 589 states and 1312 transitions. Second operand 40 states. [2019-12-27 00:38:25,990 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-12-27 00:38:26,381 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 52 [2019-12-27 00:38:26,666 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 59 [2019-12-27 00:38:26,916 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 56 Received shutdown request... [2019-12-27 00:38:27,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:38:27,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:38:27,762 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 00:38:27,766 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 00:38:27,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:38:27 BasicIcfg [2019-12-27 00:38:27,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:38:27,767 INFO L168 Benchmark]: Toolchain (without parser) took 248157.45 ms. Allocated memory was 145.2 MB in the beginning and 292.0 MB in the end (delta: 146.8 MB). Free memory was 101.5 MB in the beginning and 55.3 MB in the end (delta: 46.2 MB). Peak memory consumption was 193.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:38:27,768 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 00:38:27,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.05 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 148.5 MB in the end (delta: -47.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:38:27,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.41 ms. Allocated memory is still 202.4 MB. Free memory was 148.5 MB in the beginning and 145.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 00:38:27,768 INFO L168 Benchmark]: Boogie Preprocessor took 45.20 ms. Allocated memory is still 202.4 MB. Free memory was 145.8 MB in the beginning and 143.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:38:27,769 INFO L168 Benchmark]: RCFGBuilder took 572.99 ms. Allocated memory is still 202.4 MB. Free memory was 143.8 MB in the beginning and 113.4 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2019-12-27 00:38:27,769 INFO L168 Benchmark]: TraceAbstraction took 246602.64 ms. Allocated memory was 202.4 MB in the beginning and 292.0 MB in the end (delta: 89.7 MB). Free memory was 113.4 MB in the beginning and 55.3 MB in the end (delta: 58.1 MB). Peak memory consumption was 147.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:38:27,772 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.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 834.05 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 148.5 MB in the end (delta: -47.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 94.41 ms. Allocated memory is still 202.4 MB. Free memory was 148.5 MB in the beginning and 145.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.20 ms. Allocated memory is still 202.4 MB. Free memory was 145.8 MB in the beginning and 143.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 572.99 ms. Allocated memory is still 202.4 MB. Free memory was 143.8 MB in the beginning and 113.4 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246602.64 ms. Allocated memory was 202.4 MB in the beginning and 292.0 MB in the end (delta: 89.7 MB). Free memory was 113.4 MB in the beginning and 55.3 MB in the end (delta: 58.1 MB). Peak memory consumption was 147.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 122 ProgramPointsBefore, 30 ProgramPointsAfterwards, 128 TransitionsBefore, 34 TransitionsAfterwards, 4968 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 18 ConcurrentYvCompositions, 3 ChoiceCompositions, 2682 VarBasedMoverChecksPositive, 65 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 68 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 5902 CheckedPairsTotal, 114 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 821]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (589states) and FLOYD_HOARE automaton (currently 13 states, 40 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 825]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 825). Cancelled while BasicCegarLoop was constructing difference of abstraction (589states) and FLOYD_HOARE automaton (currently 13 states, 40 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - TimeoutResultAtElement [Line: 826]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 826). Cancelled while BasicCegarLoop was constructing difference of abstraction (589states) and FLOYD_HOARE automaton (currently 13 states, 40 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 49 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 3 error locations. Result: TIMEOUT, OverallTime: 246.4s, OverallIterations: 36, TraceHistogramMax: 3, AutomataDifference: 165.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1044 SDtfs, 5882 SDslu, 7570 SDs, 0 SdLazy, 55187 SolverSat, 2128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2129 GetRequests, 249 SyntacticMatches, 81 SemanticMatches, 1798 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29659 ImplicationChecksByTransitivity, 152.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=589occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 2970 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 68.6s InterpolantComputationTime, 1455 NumberOfCodeBlocks, 1455 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 1394 ConstructedInterpolants, 487 QuantifiedInterpolants, 1196143 SizeOfPredicates, 1030 NumberOfNonLiveVariables, 4185 ConjunctsInSsa, 2355 ConjunctsInUnsatCore, 61 InterpolantComputations, 11 PerfectInterpolantSequences, 51/402 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