/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:17:52,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:17:52,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:17:52,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:17:52,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:17:52,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:17:52,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:17:52,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:17:52,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:17:52,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:17:52,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:17:52,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:17:52,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:17:52,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:17:52,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:17:52,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:17:52,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:17:52,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:17:52,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:17:52,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:17:52,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:17:52,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:17:52,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:17:52,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:17:52,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:17:52,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:17:52,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:17:52,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:17:52,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:17:52,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:17:52,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:17:52,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:17:52,135 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:17:52,136 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:17:52,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:17:52,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:17:52,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:17:52,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:17:52,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:17:52,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:17:52,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:17:52,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 23:17:52,164 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:17:52,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:17:52,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:17:52,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:17:52,166 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:17:52,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:17:52,166 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:17:52,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:17:52,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:17:52,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:17:52,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:17:52,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:17:52,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:17:52,168 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:17:52,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:17:52,168 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:17:52,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:17:52,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:17:52,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:17:52,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:17:52,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:17:52,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:17:52,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:17:52,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:17:52,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:17:52,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:17:52,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:17:52,170 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:17:52,170 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 23:17:52,171 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:17:52,171 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:17:52,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:17:52,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:17:52,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:17:52,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:17:52,456 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:17:52,457 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:17:52,457 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 23:17:52,528 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25659bf04/3f84b53060754862836b00b1257aca92/FLAG085826275 [2019-12-27 23:17:53,068 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:17:53,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2019-12-27 23:17:53,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25659bf04/3f84b53060754862836b00b1257aca92/FLAG085826275 [2019-12-27 23:17:53,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25659bf04/3f84b53060754862836b00b1257aca92 [2019-12-27 23:17:53,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:17:53,312 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:17:53,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:17:53,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:17:53,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:17:53,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:17:53" (1/1) ... [2019-12-27 23:17:53,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745088c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:17:53, skipping insertion in model container [2019-12-27 23:17:53,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:17:53" (1/1) ... [2019-12-27 23:17:53,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:17:53,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:17:53,576 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 23:17:53,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:17:53,899 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:17:53,914 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 23:17:53,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:17:54,062 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:17:54,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:17:54 WrapperNode [2019-12-27 23:17:54,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:17:54,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:17:54,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:17:54,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:17:54,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:17:54" (1/1) ... [2019-12-27 23:17:54,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:17:54" (1/1) ... [2019-12-27 23:17:54,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:17:54,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:17:54,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:17:54,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:17:54,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:17:54" (1/1) ... [2019-12-27 23:17:54,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:17:54" (1/1) ... [2019-12-27 23:17:54,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:17:54" (1/1) ... [2019-12-27 23:17:54,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:17:54" (1/1) ... [2019-12-27 23:17:54,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:17:54" (1/1) ... [2019-12-27 23:17:54,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:17:54" (1/1) ... [2019-12-27 23:17:54,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:17:54" (1/1) ... [2019-12-27 23:17:54,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:17:54,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:17:54,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:17:54,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:17:54,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:17:54" (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 23:17:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2019-12-27 23:17:54,239 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2019-12-27 23:17:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:17:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:17:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 23:17:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:17:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:17:54,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:17:54,242 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 23:17:54,822 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:17:54,823 INFO L287 CfgBuilder]: Removed 19 assume(true) statements. [2019-12-27 23:17:54,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:17:54 BoogieIcfgContainer [2019-12-27 23:17:54,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:17:54,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:17:54,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:17:54,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:17:54,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:17:53" (1/3) ... [2019-12-27 23:17:54,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343de02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:17:54, skipping insertion in model container [2019-12-27 23:17:54,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:17:54" (2/3) ... [2019-12-27 23:17:54,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343de02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:17:54, skipping insertion in model container [2019-12-27 23:17:54,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:17:54" (3/3) ... [2019-12-27 23:17:54,844 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2019-12-27 23:17:54,854 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:17:54,855 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:17:54,862 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-12-27 23:17:54,863 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:17:54,905 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,905 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,906 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,906 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,907 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,907 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,907 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,908 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,908 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,909 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,915 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,916 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,916 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,916 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,916 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,917 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,917 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,918 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 23:17:54,918 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 23:17:54,918 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,919 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,919 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 23:17:54,919 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 23:17:54,920 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,920 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,920 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,920 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,920 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,921 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,921 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,922 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,922 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,922 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,922 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 23:17:54,922 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 23:17:54,923 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,923 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,924 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 23:17:54,925 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 23:17:54,925 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,925 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,926 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,926 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,926 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,927 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,927 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,927 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,927 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,928 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,928 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,928 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,928 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,928 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,929 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,929 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,929 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,929 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,930 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,930 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,930 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,930 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,930 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,931 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,931 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,931 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,931 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,932 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,932 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,932 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,932 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,933 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,935 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,935 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,935 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,936 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,936 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,936 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 23:17:54,936 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 23:17:54,937 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,937 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,937 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,937 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,937 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,938 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,938 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,939 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,939 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,940 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 23:17:54,940 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 23:17:54,940 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,941 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,941 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,941 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,941 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,942 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,942 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,942 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,942 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,942 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,943 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,943 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,943 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,944 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,946 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,946 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,947 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,947 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,947 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,947 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,948 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,948 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,948 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,948 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,949 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,949 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,949 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,949 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,950 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,950 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,950 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,950 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,951 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,951 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,951 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,952 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,952 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,952 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,952 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,956 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,957 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,957 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,957 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,957 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 23:17:54,958 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,958 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,958 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,958 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,959 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,959 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 23:17:54,959 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,959 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,959 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 23:17:54,960 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,960 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,960 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 23:17:54,960 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,961 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,961 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,961 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,961 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,961 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,962 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,962 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,962 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,962 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,963 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,963 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:17:54,984 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 23:17:55,004 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:17:55,005 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:17:55,005 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:17:55,005 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:17:55,005 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:17:55,005 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:17:55,006 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:17:55,006 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:17:55,022 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 128 transitions [2019-12-27 23:17:55,024 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 122 places, 128 transitions [2019-12-27 23:17:55,105 INFO L132 PetriNetUnfolder]: 10/127 cut-off events. [2019-12-27 23:17:55,105 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 23:17:55,114 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 23:17:55,124 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 122 places, 128 transitions [2019-12-27 23:17:55,154 INFO L132 PetriNetUnfolder]: 10/127 cut-off events. [2019-12-27 23:17:55,154 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 23:17:55,158 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 23:17:55,166 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4968 [2019-12-27 23:17:55,167 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:17:57,263 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-27 23:17:57,740 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5914 [2019-12-27 23:17:57,741 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 23:17:57,744 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 34 transitions [2019-12-27 23:17:57,758 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 139 states. [2019-12-27 23:17:57,760 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-12-27 23:17:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 23:17:57,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:17:57,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 23:17:57,768 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 23:17:57,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:17:57,774 INFO L82 PathProgramCache]: Analyzing trace with hash 485339031, now seen corresponding path program 1 times [2019-12-27 23:17:57,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:17:57,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155060339] [2019-12-27 23:17:57,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:17:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:17:57,933 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 23:17:57,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155060339] [2019-12-27 23:17:57,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:17:57,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:17:57,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2105120247] [2019-12-27 23:17:57,936 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:17:57,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:17:57,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 23:17:57,955 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:17:57,958 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:17:57,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 23:17:57,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:17:57,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 23:17:57,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 23:17:57,979 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 2 states. [2019-12-27 23:17:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:17:57,992 INFO L93 Difference]: Finished difference Result 139 states and 298 transitions. [2019-12-27 23:17:57,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 23:17:57,994 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-12-27 23:17:57,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:17:58,008 INFO L225 Difference]: With dead ends: 139 [2019-12-27 23:17:58,008 INFO L226 Difference]: Without dead ends: 128 [2019-12-27 23:17:58,009 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 23:17:58,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-27 23:17:58,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-12-27 23:17:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-27 23:17:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 277 transitions. [2019-12-27 23:17:58,067 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 277 transitions. Word has length 5 [2019-12-27 23:17:58,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:17:58,067 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 277 transitions. [2019-12-27 23:17:58,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 23:17:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 277 transitions. [2019-12-27 23:17:58,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 23:17:58,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:17:58,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 23:17:58,069 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 23:17:58,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:17:58,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2134363384, now seen corresponding path program 1 times [2019-12-27 23:17:58,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:17:58,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013209250] [2019-12-27 23:17:58,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:17:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:17:58,143 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 23:17:58,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013209250] [2019-12-27 23:17:58,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:17:58,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:17:58,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1507286554] [2019-12-27 23:17:58,144 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:17:58,144 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:17:58,146 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 7 states and 6 transitions. [2019-12-27 23:17:58,146 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:17:58,146 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:17:58,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:17:58,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:17:58,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:17:58,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:17:58,148 INFO L87 Difference]: Start difference. First operand 128 states and 277 transitions. Second operand 3 states. [2019-12-27 23:17:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:17:58,184 INFO L93 Difference]: Finished difference Result 200 states and 438 transitions. [2019-12-27 23:17:58,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:17:58,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-27 23:17:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:17:58,187 INFO L225 Difference]: With dead ends: 200 [2019-12-27 23:17:58,187 INFO L226 Difference]: Without dead ends: 200 [2019-12-27 23:17:58,188 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 23:17:58,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-12-27 23:17:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 155. [2019-12-27 23:17:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-27 23:17:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 343 transitions. [2019-12-27 23:17:58,209 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 343 transitions. Word has length 6 [2019-12-27 23:17:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:17:58,210 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 343 transitions. [2019-12-27 23:17:58,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:17:58,210 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 343 transitions. [2019-12-27 23:17:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 23:17:58,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:17:58,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:17:58,211 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 23:17:58,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:17:58,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1264596255, now seen corresponding path program 1 times [2019-12-27 23:17:58,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:17:58,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000944188] [2019-12-27 23:17:58,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:17:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:17:58,410 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 23:17:58,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000944188] [2019-12-27 23:17:58,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:17:58,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:17:58,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1740340107] [2019-12-27 23:17:58,412 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:17:58,413 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:17:58,416 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 23:17:58,416 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:17:58,417 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:17:58,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:17:58,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:17:58,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:17:58,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:17:58,418 INFO L87 Difference]: Start difference. First operand 155 states and 343 transitions. Second operand 7 states. [2019-12-27 23:17:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:17:58,755 INFO L93 Difference]: Finished difference Result 181 states and 391 transitions. [2019-12-27 23:17:58,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:17:58,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-27 23:17:58,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:17:58,758 INFO L225 Difference]: With dead ends: 181 [2019-12-27 23:17:58,758 INFO L226 Difference]: Without dead ends: 162 [2019-12-27 23:17:58,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:17:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-27 23:17:58,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-12-27 23:17:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 23:17:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 359 transitions. [2019-12-27 23:17:58,773 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 359 transitions. Word has length 10 [2019-12-27 23:17:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:17:58,773 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 359 transitions. [2019-12-27 23:17:58,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:17:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 359 transitions. [2019-12-27 23:17:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 23:17:58,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:17:58,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:17:58,775 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 23:17:58,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:17:58,776 INFO L82 PathProgramCache]: Analyzing trace with hash -328941052, now seen corresponding path program 1 times [2019-12-27 23:17:58,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:17:58,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457414397] [2019-12-27 23:17:58,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:17:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:17:59,353 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 23:17:59,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457414397] [2019-12-27 23:17:59,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:17:59,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 23:17:59,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1569858633] [2019-12-27 23:17:59,355 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:17:59,358 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:17:59,365 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 40 transitions. [2019-12-27 23:17:59,365 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:17:59,626 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:17:59,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:17:59,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:17:59,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:17:59,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:17:59,627 INFO L87 Difference]: Start difference. First operand 162 states and 359 transitions. Second operand 19 states. [2019-12-27 23:18:00,927 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44 [2019-12-27 23:18:01,282 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-12-27 23:18:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:18:01,952 INFO L93 Difference]: Finished difference Result 180 states and 384 transitions. [2019-12-27 23:18:01,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 23:18:01,953 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2019-12-27 23:18:01,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:18:01,955 INFO L225 Difference]: With dead ends: 180 [2019-12-27 23:18:01,955 INFO L226 Difference]: Without dead ends: 170 [2019-12-27 23:18:01,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=305, Invalid=885, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 23:18:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-27 23:18:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-12-27 23:18:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-27 23:18:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 371 transitions. [2019-12-27 23:18:01,979 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 371 transitions. Word has length 16 [2019-12-27 23:18:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:18:01,979 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 371 transitions. [2019-12-27 23:18:01,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:18:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 371 transitions. [2019-12-27 23:18:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:18:01,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:18:01,980 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 23:18:01,981 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 23:18:01,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:18:01,981 INFO L82 PathProgramCache]: Analyzing trace with hash -960067854, now seen corresponding path program 1 times [2019-12-27 23:18:01,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:18:01,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735546721] [2019-12-27 23:18:01,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:18:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:18:02,595 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 36 [2019-12-27 23:18:02,917 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 23:18:02,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735546721] [2019-12-27 23:18:02,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:18:02,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 23:18:02,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [511984584] [2019-12-27 23:18:02,918 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:18:02,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:18:02,929 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 50 transitions. [2019-12-27 23:18:02,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:18:03,291 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 23:18:03,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 23:18:03,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:18:03,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 23:18:03,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:18:03,292 INFO L87 Difference]: Start difference. First operand 170 states and 371 transitions. Second operand 23 states. [2019-12-27 23:18:04,817 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-12-27 23:18:05,128 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2019-12-27 23:18:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:18:06,280 INFO L93 Difference]: Finished difference Result 234 states and 515 transitions. [2019-12-27 23:18:06,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 23:18:06,280 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 18 [2019-12-27 23:18:06,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:18:06,283 INFO L225 Difference]: With dead ends: 234 [2019-12-27 23:18:06,284 INFO L226 Difference]: Without dead ends: 234 [2019-12-27 23:18:06,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=246, Invalid=1314, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 23:18:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-12-27 23:18:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 222. [2019-12-27 23:18:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-27 23:18:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 489 transitions. [2019-12-27 23:18:06,295 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 489 transitions. Word has length 18 [2019-12-27 23:18:06,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:18:06,297 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 489 transitions. [2019-12-27 23:18:06,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 23:18:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 489 transitions. [2019-12-27 23:18:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:18:06,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:18:06,299 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 23:18:06,299 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 23:18:06,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:18:06,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1193789261, now seen corresponding path program 1 times [2019-12-27 23:18:06,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:18:06,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313845798] [2019-12-27 23:18:06,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:18:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:18:06,347 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 23:18:06,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313845798] [2019-12-27 23:18:06,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910750479] [2019-12-27 23:18:06,348 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 23:18:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:18:06,438 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-27 23:18:06,446 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:18:06,460 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 23:18:06,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:18:06,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-12-27 23:18:06,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [551770912] [2019-12-27 23:18:06,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:18:06,467 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:18:06,474 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 23:18:06,474 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:18:06,477 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:18:06,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:18:06,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:18:06,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:18:06,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:18:06,478 INFO L87 Difference]: Start difference. First operand 222 states and 489 transitions. Second operand 4 states. [2019-12-27 23:18:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:18:06,497 INFO L93 Difference]: Finished difference Result 326 states and 718 transitions. [2019-12-27 23:18:06,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:18:06,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-27 23:18:06,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:18:06,501 INFO L225 Difference]: With dead ends: 326 [2019-12-27 23:18:06,501 INFO L226 Difference]: Without dead ends: 326 [2019-12-27 23:18:06,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:18:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-27 23:18:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 278. [2019-12-27 23:18:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-12-27 23:18:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 624 transitions. [2019-12-27 23:18:06,524 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 624 transitions. Word has length 21 [2019-12-27 23:18:06,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:18:06,524 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 624 transitions. [2019-12-27 23:18:06,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:18:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 624 transitions. [2019-12-27 23:18:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:18:06,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:18:06,531 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 23:18:06,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:18:06,736 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 23:18:06,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:18:06,736 INFO L82 PathProgramCache]: Analyzing trace with hash 554824476, now seen corresponding path program 2 times [2019-12-27 23:18:06,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:18:06,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291913339] [2019-12-27 23:18:06,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:18:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:18:07,453 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 51 [2019-12-27 23:18:08,249 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 23:18:08,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291913339] [2019-12-27 23:18:08,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459938348] [2019-12-27 23:18:08,250 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:18:08,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:18:08,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:18:08,330 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 102 conjunts are in the unsatisfiable core [2019-12-27 23:18:08,334 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:18:08,388 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 23:18:08,389 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:08,413 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 23:18:08,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:08,426 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 23:18:08,426 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:08,435 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:08,436 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 23:18:08,436 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 23:18:08,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:08,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:08,852 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:18:08,873 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:08,874 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 23:18:08,878 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:08,936 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 23:18:08,936 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 23:18:08,937 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-27 23:18:09,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:09,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:09,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:09,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:09,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:09,135 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 61 treesize of output 54 [2019-12-27 23:18:09,137 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:09,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:09,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:09,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:09,183 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 59 treesize of output 52 [2019-12-27 23:18:09,184 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:09,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:09,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:09,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:09,205 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 59 treesize of output 52 [2019-12-27 23:18:09,206 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:09,281 INFO L614 ElimStorePlain]: treesize reduction 141, result has 28.4 percent of original size [2019-12-27 23:18:09,282 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 23:18:09,283 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:254, output treesize:56 [2019-12-27 23:18:09,592 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:09,593 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 52 treesize of output 107 [2019-12-27 23:18:09,594 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:09,660 INFO L614 ElimStorePlain]: treesize reduction 84, result has 46.5 percent of original size [2019-12-27 23:18:09,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:09,663 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-27 23:18:09,664 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:58 [2019-12-27 23:18:09,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:09,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:09,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:09,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:10,156 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2019-12-27 23:18:10,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:10,302 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:10,302 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 60 treesize of output 55 [2019-12-27 23:18:10,304 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:10,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:10,317 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 23:18:10,317 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:70, output treesize:7 [2019-12-27 23:18:10,427 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 23:18:10,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:18:10,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2019-12-27 23:18:10,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1067020076] [2019-12-27 23:18:10,429 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:18:10,433 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:18:10,445 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 75 transitions. [2019-12-27 23:18:10,445 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:18:11,426 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 23:18:11,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 23:18:11,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:18:11,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 23:18:11,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=2017, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 23:18:11,429 INFO L87 Difference]: Start difference. First operand 278 states and 624 transitions. Second operand 30 states. [2019-12-27 23:18:12,542 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-12-27 23:18:13,063 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2019-12-27 23:18:13,499 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2019-12-27 23:18:13,683 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-12-27 23:18:13,966 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-12-27 23:18:15,536 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-12-27 23:18:15,868 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-12-27 23:18:16,358 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-12-27 23:18:16,679 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-12-27 23:18:17,248 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-12-27 23:18:17,824 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-12-27 23:18:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:18:18,529 INFO L93 Difference]: Finished difference Result 318 states and 709 transitions. [2019-12-27 23:18:18,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 23:18:18,530 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2019-12-27 23:18:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:18:18,533 INFO L225 Difference]: With dead ends: 318 [2019-12-27 23:18:18,533 INFO L226 Difference]: Without dead ends: 318 [2019-12-27 23:18:18,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=624, Invalid=6348, Unknown=0, NotChecked=0, Total=6972 [2019-12-27 23:18:18,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-27 23:18:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 286. [2019-12-27 23:18:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-12-27 23:18:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 641 transitions. [2019-12-27 23:18:18,544 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 641 transitions. Word has length 23 [2019-12-27 23:18:18,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:18:18,545 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 641 transitions. [2019-12-27 23:18:18,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 23:18:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 641 transitions. [2019-12-27 23:18:18,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:18:18,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:18:18,546 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 23:18:18,746 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:18:18,747 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 23:18:18,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:18:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2064920054, now seen corresponding path program 3 times [2019-12-27 23:18:18,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:18:18,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135035656] [2019-12-27 23:18:18,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:18:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:18:19,423 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 41 [2019-12-27 23:18:20,275 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 23:18:20,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135035656] [2019-12-27 23:18:20,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270072967] [2019-12-27 23:18:20,276 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:18:20,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 23:18:20,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:18:20,367 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 94 conjunts are in the unsatisfiable core [2019-12-27 23:18:20,370 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:18:20,382 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 23:18:20,383 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:20,400 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 23:18:20,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:20,407 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 23:18:20,408 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:20,417 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:20,418 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 23:18:20,418 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 23:18:20,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:20,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:20,942 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:18:20,972 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:20,973 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 23:18:20,974 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:21,038 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 23:18:21,039 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 23:18:21,039 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-27 23:18:21,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:21,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:21,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:21,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:21,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:21,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18: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, 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 23:18:21,266 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:21,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:21,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:21,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:21,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:21,289 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 23:18:21,290 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:21,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:21,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:21,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:21,301 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 23:18:21,302 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:21,318 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:21,319 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 23:18:21,319 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-27 23:18:21,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:21,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:21,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:21,649 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:21,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, 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 23:18:21,651 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:21,707 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-27 23:18:21,707 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 23:18:21,708 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 23:18:21,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:21,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:21,853 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 23:18:21,854 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:21,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 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-27 23:18:21,897 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:21,911 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 23:18:21,912 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:21,975 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-27 23:18:21,976 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 23:18:21,977 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:212, output treesize:46 [2019-12-27 23:18:22,238 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:22,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 23:18:22,239 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:22,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:22,247 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 23:18:22,247 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:7 [2019-12-27 23:18:22,278 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 23:18:22,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:18:22,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2019-12-27 23:18:22,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1661879195] [2019-12-27 23:18:22,279 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:18:22,282 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:18:22,297 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 85 transitions. [2019-12-27 23:18:22,298 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:18:23,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 23:18:23,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 23:18:23,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:18:23,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 23:18:23,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2260, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 23:18:23,502 INFO L87 Difference]: Start difference. First operand 286 states and 641 transitions. Second operand 35 states. [2019-12-27 23:18:24,737 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-12-27 23:18:25,313 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-12-27 23:18:25,745 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-12-27 23:18:26,177 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-12-27 23:18:27,506 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-12-27 23:18:27,835 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-12-27 23:18:28,269 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-12-27 23:18:28,800 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-12-27 23:18:29,235 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-12-27 23:18:29,921 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-12-27 23:18:30,558 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-12-27 23:18:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:18:32,240 INFO L93 Difference]: Finished difference Result 374 states and 829 transitions. [2019-12-27 23:18:32,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 23:18:32,243 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 25 [2019-12-27 23:18:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:18:32,245 INFO L225 Difference]: With dead ends: 374 [2019-12-27 23:18:32,245 INFO L226 Difference]: Without dead ends: 374 [2019-12-27 23:18:32,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2661 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=867, Invalid=8253, Unknown=0, NotChecked=0, Total=9120 [2019-12-27 23:18:32,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-27 23:18:32,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 326. [2019-12-27 23:18:32,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-12-27 23:18:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 727 transitions. [2019-12-27 23:18:32,258 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 727 transitions. Word has length 25 [2019-12-27 23:18:32,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:18:32,258 INFO L462 AbstractCegarLoop]: Abstraction has 326 states and 727 transitions. [2019-12-27 23:18:32,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 23:18:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 727 transitions. [2019-12-27 23:18:32,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:18:32,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:18:32,260 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 23:18:32,463 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:18:32,463 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 23:18:32,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:18:32,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1265695988, now seen corresponding path program 1 times [2019-12-27 23:18:32,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:18:32,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427422346] [2019-12-27 23:18:32,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:18:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:18:33,341 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 23:18:33,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427422346] [2019-12-27 23:18:33,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037172767] [2019-12-27 23:18:33,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:18:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:18:33,414 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 83 conjunts are in the unsatisfiable core [2019-12-27 23:18:33,416 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:18:33,452 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 23:18:33,453 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 23:18:33,487 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 23:18:33,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:33,502 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 23:18:33,502 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:33,513 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:33,514 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 23:18:33,514 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 23:18:33,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:33,832 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:33,832 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 23:18:33,833 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:33,883 INFO L614 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-12-27 23:18:33,884 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 23:18:33,885 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:46 [2019-12-27 23:18:34,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:34,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:34,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:34,045 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 23:18:34,046 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:34,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:34,066 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 23:18:34,067 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:34,070 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 23:18:34,071 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:34,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:34,083 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 23:18:34,083 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:210, output treesize:36 [2019-12-27 23:18:34,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:34,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:34,270 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:18:34,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:34,274 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 71 treesize of output 60 [2019-12-27 23:18:34,275 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:34,300 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:18:34,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:34,304 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 23:18:34,304 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:34,308 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 59 treesize of output 52 [2019-12-27 23:18:34,309 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:34,322 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:34,323 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 23:18:34,323 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:210, output treesize:36 [2019-12-27 23:18:34,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:34,446 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 23:18:34,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:18:34,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2019-12-27 23:18:34,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [175535317] [2019-12-27 23:18:34,447 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:18:34,451 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:18:34,460 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 23:18:34,460 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:18:34,807 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:18:34,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 23:18:34,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:18:34,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 23:18:34,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 23:18:34,809 INFO L87 Difference]: Start difference. First operand 326 states and 727 transitions. Second operand 25 states. [2019-12-27 23:18:36,191 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-12-27 23:18:36,707 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-12-27 23:18:37,214 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2019-12-27 23:18:37,382 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-12-27 23:18:38,002 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-12-27 23:18:38,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:18:38,769 INFO L93 Difference]: Finished difference Result 377 states and 831 transitions. [2019-12-27 23:18:38,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 23:18:38,770 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-12-27 23:18:38,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:18:38,774 INFO L225 Difference]: With dead ends: 377 [2019-12-27 23:18:38,774 INFO L226 Difference]: Without dead ends: 360 [2019-12-27 23:18:38,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=511, Invalid=3521, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 23:18:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-12-27 23:18:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 345. [2019-12-27 23:18:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-27 23:18:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 768 transitions. [2019-12-27 23:18:38,785 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 768 transitions. Word has length 25 [2019-12-27 23:18:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:18:38,786 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 768 transitions. [2019-12-27 23:18:38,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 23:18:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 768 transitions. [2019-12-27 23:18:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:18:38,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:18:38,787 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 23:18:38,992 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:18:38,993 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 23:18:38,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:18:38,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1770531068, now seen corresponding path program 4 times [2019-12-27 23:18:38,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:18:38,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625204092] [2019-12-27 23:18:38,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:18:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:18:39,615 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 39 [2019-12-27 23:18:39,880 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-12-27 23:18:40,126 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-12-27 23:18:40,361 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 38 [2019-12-27 23:18:40,567 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-12-27 23:18:40,742 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-12-27 23:18:41,241 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 23:18:41,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625204092] [2019-12-27 23:18:41,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784699137] [2019-12-27 23:18:41,242 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 23:18:41,334 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:18:41,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:18:41,337 WARN L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 116 conjunts are in the unsatisfiable core [2019-12-27 23:18:41,339 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:18:41,352 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 23:18:41,353 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:41,382 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 23:18:41,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:41,387 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 23:18:41,387 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:41,399 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:41,400 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 23:18:41,400 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 23:18:41,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:41,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:41,962 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:18:41,992 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:41,993 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 23:18:41,994 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:42,053 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 23:18:42,054 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 23:18:42,054 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-27 23:18:42,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:42,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:42,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,254 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 23:18:42,255 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:42,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,279 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 23:18:42,279 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:42,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,286 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 23:18:42,287 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:42,304 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:42,305 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 23:18:42,305 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-27 23:18:42,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,738 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:18:42,779 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:42,780 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 23:18:42,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:42,853 INFO L614 ElimStorePlain]: treesize reduction 72, result has 47.1 percent of original size [2019-12-27 23:18:42,854 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 23:18:42,855 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:77, output treesize:55 [2019-12-27 23:18:42,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:42,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:42,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:42,993 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 23:18:42,993 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:42,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:43,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:43,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:43,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:43,019 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 23:18:43,020 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:43,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:43,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:43,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:43,027 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 23:18:43,028 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:43,049 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:43,049 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 23:18:43,049 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-27 23:18:43,342 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:43,343 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 23:18:43,344 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:43,408 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-27 23:18:43,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:43,409 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 23:18:43,410 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:32 [2019-12-27 23:18:43,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:43,565 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 23:18:43,566 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:43,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:43,571 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 23:18:43,571 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-27 23:18:43,665 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 23:18:43,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:18:43,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 43 [2019-12-27 23:18:43,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1612351014] [2019-12-27 23:18:43,666 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:18:43,672 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:18:43,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 110 transitions. [2019-12-27 23:18:43,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:18:45,213 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 23:18:45,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 23:18:45,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:18:45,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 23:18:45,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3450, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 23:18:45,219 INFO L87 Difference]: Start difference. First operand 345 states and 768 transitions. Second operand 40 states. [2019-12-27 23:18:46,349 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-12-27 23:18:46,880 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-12-27 23:18:47,273 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-12-27 23:18:47,701 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2019-12-27 23:18:48,848 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-12-27 23:18:49,798 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-12-27 23:18:50,639 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-12-27 23:18:51,245 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-12-27 23:18:51,808 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-12-27 23:18:52,022 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-12-27 23:18:52,613 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-12-27 23:18:53,458 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-12-27 23:18:54,361 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-12-27 23:18:54,693 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-12-27 23:18:54,947 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-12-27 23:18:55,291 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-12-27 23:18:55,825 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-12-27 23:18:56,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:18:56,360 INFO L93 Difference]: Finished difference Result 397 states and 878 transitions. [2019-12-27 23:18:56,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-27 23:18:56,366 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 30 [2019-12-27 23:18:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:18:56,369 INFO L225 Difference]: With dead ends: 397 [2019-12-27 23:18:56,370 INFO L226 Difference]: Without dead ends: 397 [2019-12-27 23:18:56,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3997 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=979, Invalid=12361, Unknown=0, NotChecked=0, Total=13340 [2019-12-27 23:18:56,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-12-27 23:18:56,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 357. [2019-12-27 23:18:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-12-27 23:18:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 794 transitions. [2019-12-27 23:18:56,384 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 794 transitions. Word has length 30 [2019-12-27 23:18:56,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:18:56,384 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 794 transitions. [2019-12-27 23:18:56,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 23:18:56,384 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 794 transitions. [2019-12-27 23:18:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:18:56,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:18:56,386 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 23:18:56,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:18:56,593 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 23:18:56,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:18:56,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1237545890, now seen corresponding path program 2 times [2019-12-27 23:18:56,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:18:56,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489345237] [2019-12-27 23:18:56,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:18:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:18:57,399 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 36 [2019-12-27 23:18:57,974 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 23:18:57,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489345237] [2019-12-27 23:18:57,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514971650] [2019-12-27 23:18:57,990 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 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 23:18:58,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:18:58,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:18:58,065 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 108 conjunts are in the unsatisfiable core [2019-12-27 23:18:58,068 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:18:58,079 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 23:18:58,080 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:58,100 INFO L614 ElimStorePlain]: treesize reduction 12, result has 78.9 percent of original size [2019-12-27 23:18:58,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:58,108 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 23:18:58,108 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:58,119 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:58,120 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 23:18:58,120 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 23:18:58,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:58,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:58,448 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:18:58,474 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:58,474 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 23:18:58,475 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:58,537 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-27 23:18:58,538 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 23:18:58,538 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 23:18:58,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:58,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:58,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:58,679 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:18:58,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:58,683 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 23:18:58,683 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:58,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:58,704 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:18:58,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:58,707 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 23:18:58,708 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:58,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:58,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, 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 23:18:58,716 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:58,736 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:58,737 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 23:18:58,737 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-27 23:18:59,008 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:59,009 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 23:18:59,010 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:59,026 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:59,027 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 23:18:59,027 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-27 23:18:59,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:59,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:18:59,307 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:18:59,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:59,313 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 71 treesize of output 60 [2019-12-27 23:18:59,314 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:59,330 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:18:59,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:18:59,336 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 23:18:59,336 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:59,340 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 58 treesize of output 51 [2019-12-27 23:18:59,340 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:59,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:59,354 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 23:18:59,354 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:219, output treesize:39 [2019-12-27 23:18:59,500 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:59,500 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 23:18:59,501 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:18:59,508 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:18:59,508 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 23:18:59,509 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-27 23:18:59,583 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 23:18:59,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:18:59,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 37 [2019-12-27 23:18:59,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497737666] [2019-12-27 23:18:59,585 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:18:59,591 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:18:59,605 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 82 transitions. [2019-12-27 23:18:59,605 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:19:00,301 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 23:19:00,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 23:19:00,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:19:00,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 23:19:00,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2093, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 23:19:00,303 INFO L87 Difference]: Start difference. First operand 357 states and 794 transitions. Second operand 31 states. [2019-12-27 23:19:02,033 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-12-27 23:19:02,659 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-12-27 23:19:02,846 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-12-27 23:19:03,320 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-12-27 23:19:04,709 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-12-27 23:19:05,151 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-12-27 23:19:05,407 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-12-27 23:19:05,600 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-12-27 23:19:05,954 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-12-27 23:19:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:19:06,530 INFO L93 Difference]: Finished difference Result 377 states and 827 transitions. [2019-12-27 23:19:06,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 23:19:06,534 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-12-27 23:19:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:19:06,536 INFO L225 Difference]: With dead ends: 377 [2019-12-27 23:19:06,536 INFO L226 Difference]: Without dead ends: 367 [2019-12-27 23:19:06,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=583, Invalid=5897, Unknown=0, NotChecked=0, Total=6480 [2019-12-27 23:19:06,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-12-27 23:19:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2019-12-27 23:19:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-12-27 23:19:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 814 transitions. [2019-12-27 23:19:06,548 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 814 transitions. Word has length 30 [2019-12-27 23:19:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:19:06,548 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 814 transitions. [2019-12-27 23:19:06,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 23:19:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 814 transitions. [2019-12-27 23:19:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:19:06,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:19:06,549 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 23:19:06,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:19:06,753 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 23:19:06,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:19:06,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1988729270, now seen corresponding path program 3 times [2019-12-27 23:19:06,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:19:06,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199209596] [2019-12-27 23:19:06,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:19:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:19:07,456 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 36 [2019-12-27 23:19:08,202 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 23:19:08,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199209596] [2019-12-27 23:19:08,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621367008] [2019-12-27 23:19:08,203 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 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 23:19:08,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:19:08,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:19:08,288 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 119 conjunts are in the unsatisfiable core [2019-12-27 23:19:08,291 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:19:08,303 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 23:19:08,303 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:08,326 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 23:19:08,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:08,330 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 23:19:08,330 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:08,341 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:08,342 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 23:19:08,342 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 23:19:08,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:08,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:08,950 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:08,973 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:08,973 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 23:19:08,974 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:09,026 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-27 23:19:09,028 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 23:19:09,028 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 23:19:09,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:09,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:09,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:09,197 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:09,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:09,200 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 23:19:09,200 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:09,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:09,217 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:09,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:09,221 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 23:19:09,222 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:09,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:09,226 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 23:19:09,226 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:09,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:09,247 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 23:19:09,247 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-27 23:19:09,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:09,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:09,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:09,656 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:09,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:09,663 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 23:19:09,664 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:09,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:09,677 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:09,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:09,683 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 23:19:09,684 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:09,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:09,696 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 23:19:09,697 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:09,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:09,717 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 23:19:09,717 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:258, output treesize:52 [2019-12-27 23:19:09,834 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:09,834 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 23:19:09,835 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:09,850 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:09,851 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 23:19:09,851 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-27 23:19:10,006 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:10,007 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 23:19:10,007 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:10,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:10,012 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 23:19:10,013 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-27 23:19:10,119 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 23:19:10,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:19:10,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 39 [2019-12-27 23:19:10,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1238133807] [2019-12-27 23:19:10,119 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:19:10,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:19:10,142 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 120 transitions. [2019-12-27 23:19:10,142 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:19:12,773 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 23:19:12,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-27 23:19:12,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:19:12,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-27 23:19:12,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3567, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 23:19:12,776 INFO L87 Difference]: Start difference. First operand 367 states and 814 transitions. Second operand 44 states. [2019-12-27 23:19:15,066 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2019-12-27 23:19:15,618 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-12-27 23:19:15,932 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-12-27 23:19:16,625 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-27 23:19:16,896 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-12-27 23:19:17,625 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 50 [2019-12-27 23:19:19,397 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 39 [2019-12-27 23:19:19,699 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 35 [2019-12-27 23:19:20,375 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-12-27 23:19:20,590 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 47 [2019-12-27 23:19:20,905 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 38 [2019-12-27 23:19:21,578 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 46 [2019-12-27 23:19:22,680 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-12-27 23:19:23,393 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-12-27 23:19:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:19:24,047 INFO L93 Difference]: Finished difference Result 425 states and 891 transitions. [2019-12-27 23:19:24,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 23:19:24,048 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 30 [2019-12-27 23:19:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:19:24,051 INFO L225 Difference]: With dead ends: 425 [2019-12-27 23:19:24,051 INFO L226 Difference]: Without dead ends: 415 [2019-12-27 23:19:24,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2136 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=681, Invalid=8825, Unknown=0, NotChecked=0, Total=9506 [2019-12-27 23:19:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-12-27 23:19:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 370. [2019-12-27 23:19:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-12-27 23:19:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 820 transitions. [2019-12-27 23:19:24,063 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 820 transitions. Word has length 30 [2019-12-27 23:19:24,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:19:24,064 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 820 transitions. [2019-12-27 23:19:24,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-27 23:19:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 820 transitions. [2019-12-27 23:19:24,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:19:24,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:19:24,065 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 23:19:24,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:19:24,269 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 23:19:24,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:19:24,270 INFO L82 PathProgramCache]: Analyzing trace with hash 86820262, now seen corresponding path program 4 times [2019-12-27 23:19:24,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:19:24,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870808937] [2019-12-27 23:19:24,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:19:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:19:24,896 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 32 [2019-12-27 23:19:25,583 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 23:19:25,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870808937] [2019-12-27 23:19:25,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765741040] [2019-12-27 23:19:25,584 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 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 23:19:25,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:19:25,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:19:25,667 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 127 conjunts are in the unsatisfiable core [2019-12-27 23:19:25,668 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:19:25,677 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 23:19:25,677 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:25,697 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 23:19:25,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:25,702 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 23:19:25,703 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:25,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:25,714 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 23:19:25,714 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 23:19:26,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:26,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:26,133 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:26,160 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:26,161 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 23:19:26,162 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:26,225 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-27 23:19:26,225 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 23:19:26,226 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:49 [2019-12-27 23:19:26,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:26,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:26,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:26,377 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:26,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:26,384 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 23:19:26,385 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:26,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:26,398 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:26,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:26,403 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 23:19:26,404 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:26,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:26,420 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 23:19:26,420 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:26,436 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:26,437 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 23:19:26,437 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:251, output treesize:43 [2019-12-27 23:19:26,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:26,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:26,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:26,710 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:26,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:26,720 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 23:19:26,721 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:26,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:26,728 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:26,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:26,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, 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 23:19:26,740 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:26,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:26,745 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 54 treesize of output 44 [2019-12-27 23:19:26,746 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:26,781 INFO L614 ElimStorePlain]: treesize reduction 4, result has 90.7 percent of original size [2019-12-27 23:19:26,782 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 23:19:26,782 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:231, output treesize:39 [2019-12-27 23:19:26,988 INFO L343 Elim1Store]: treesize reduction 20, result has 76.7 percent of original size [2019-12-27 23:19:26,989 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 23:19:26,990 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:27,018 INFO L614 ElimStorePlain]: treesize reduction 8, result has 81.4 percent of original size [2019-12-27 23:19:27,018 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 23:19:27,019 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:35 [2019-12-27 23:19:27,168 INFO L343 Elim1Store]: treesize reduction 12, result has 73.3 percent of original size [2019-12-27 23:19:27,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 55 [2019-12-27 23:19:27,169 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:27,173 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:27,173 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 23:19:27,174 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:7 [2019-12-27 23:19:27,248 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 23:19:27,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:19:27,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 40 [2019-12-27 23:19:27,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [964972588] [2019-12-27 23:19:27,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:19:27,254 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:19:27,290 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 108 transitions. [2019-12-27 23:19:27,290 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:19:29,564 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 23:19:29,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-27 23:19:29,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:19:29,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-27 23:19:29,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=3732, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 23:19:29,566 INFO L87 Difference]: Start difference. First operand 370 states and 820 transitions. Second operand 46 states. [2019-12-27 23:19:30,618 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2019-12-27 23:19:31,077 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 42 [2019-12-27 23:19:31,490 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 47 [2019-12-27 23:19:32,144 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2019-12-27 23:19:32,970 WARN L192 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-12-27 23:19:33,178 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-12-27 23:19:33,439 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 44 [2019-12-27 23:19:34,216 WARN L192 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2019-12-27 23:19:34,553 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-12-27 23:19:34,771 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-12-27 23:19:35,201 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-12-27 23:19:35,501 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-12-27 23:19:35,900 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2019-12-27 23:19:36,339 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-12-27 23:19:36,673 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 43 [2019-12-27 23:19:36,936 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-12-27 23:19:37,341 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-12-27 23:19:37,662 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 51 [2019-12-27 23:19:38,765 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2019-12-27 23:19:39,161 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 38 [2019-12-27 23:19:39,351 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2019-12-27 23:19:39,604 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 41 [2019-12-27 23:19:39,985 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 48 [2019-12-27 23:19:40,273 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2019-12-27 23:19:40,694 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 50 [2019-12-27 23:19:40,956 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-12-27 23:19:41,955 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-12-27 23:19:42,191 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-12-27 23:19:42,523 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-12-27 23:19:43,080 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-27 23:19:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:19:43,144 INFO L93 Difference]: Finished difference Result 464 states and 969 transitions. [2019-12-27 23:19:43,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 23:19:43,145 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2019-12-27 23:19:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:19:43,149 INFO L225 Difference]: With dead ends: 464 [2019-12-27 23:19:43,149 INFO L226 Difference]: Without dead ends: 442 [2019-12-27 23:19:43,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4480 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=1233, Invalid=12573, Unknown=0, NotChecked=0, Total=13806 [2019-12-27 23:19:43,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-12-27 23:19:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 379. [2019-12-27 23:19:43,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-27 23:19:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 835 transitions. [2019-12-27 23:19:43,158 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 835 transitions. Word has length 30 [2019-12-27 23:19:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:19:43,159 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 835 transitions. [2019-12-27 23:19:43,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-12-27 23:19:43,159 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 835 transitions. [2019-12-27 23:19:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:19:43,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:19:43,160 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 23:19:43,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:19:43,364 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 23:19:43,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:19:43,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1435825986, now seen corresponding path program 5 times [2019-12-27 23:19:43,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:19:43,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068779637] [2019-12-27 23:19:43,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:19:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:19:44,018 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2019-12-27 23:19:44,632 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 23:19:44,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068779637] [2019-12-27 23:19:44,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139545368] [2019-12-27 23:19:44,633 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 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 23:19:44,718 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:19:44,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:19:44,720 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 122 conjunts are in the unsatisfiable core [2019-12-27 23:19:44,727 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:19:44,736 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 23:19:44,736 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 23:19:44,763 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 23:19:44,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:44,768 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 23:19:44,769 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:44,781 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:44,782 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 23:19:44,782 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 23:19:45,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:45,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:45,123 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:45,148 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:45,148 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 23:19:45,149 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:45,215 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-27 23:19:45,216 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 23:19:45,216 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 23:19:45,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:45,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:45,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:45,360 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:45,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:45,364 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 23:19:45,364 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:45,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:45,383 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:45,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:45,387 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 23:19:45,388 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:45,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:45,393 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 23:19:45,393 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:45,410 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:45,410 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 23:19:45,411 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-27 23:19:45,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:45,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:45,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:45,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:45,864 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:45,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:45,872 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 23:19:45,872 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:45,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:45,887 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:19:45,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:45,894 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 23:19:45,894 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:45,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:19:45,905 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 23:19:45,906 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:45,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:45,924 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 23:19:45,925 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:231, output treesize:43 [2019-12-27 23:19:46,181 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:46,182 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 23:19:46,183 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:46,216 INFO L614 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-12-27 23:19:46,216 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 23:19:46,217 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-27 23:19:46,356 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:46,356 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 23:19:46,357 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:19:46,362 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:19:46,362 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 23:19:46,362 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-27 23:19:46,456 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 23:19:46,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:19:46,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 40 [2019-12-27 23:19:46,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1962102309] [2019-12-27 23:19:46,457 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:19:46,461 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:19:46,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 88 transitions. [2019-12-27 23:19:46,480 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:19:46,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:47,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:19:48,095 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 23:19:48,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 23:19:48,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:19:48,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 23:19:48,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2663, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 23:19:48,096 INFO L87 Difference]: Start difference. First operand 379 states and 835 transitions. Second operand 35 states. [2019-12-27 23:19:49,994 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-12-27 23:19:50,464 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-27 23:19:51,189 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2019-12-27 23:19:51,432 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2019-12-27 23:19:51,838 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 71 [2019-12-27 23:19:52,169 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-12-27 23:19:52,473 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 68 [2019-12-27 23:19:52,992 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 66 [2019-12-27 23:19:53,543 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 80 [2019-12-27 23:19:54,300 WARN L192 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 98 [2019-12-27 23:19:54,657 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 70 [2019-12-27 23:19:55,590 WARN L192 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 119 [2019-12-27 23:19:56,129 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-12-27 23:19:56,363 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2019-12-27 23:19:56,928 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-12-27 23:19:57,176 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2019-12-27 23:19:57,477 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-12-27 23:19:57,836 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 83 [2019-12-27 23:19:58,284 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-12-27 23:19:58,575 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-12-27 23:19:58,798 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-12-27 23:19:59,002 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-12-27 23:19:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:19:59,665 INFO L93 Difference]: Finished difference Result 578 states and 1244 transitions. [2019-12-27 23:19:59,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 23:19:59,666 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 30 [2019-12-27 23:19:59,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:19:59,671 INFO L225 Difference]: With dead ends: 578 [2019-12-27 23:19:59,671 INFO L226 Difference]: Without dead ends: 568 [2019-12-27 23:19:59,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2284 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=741, Invalid=7815, Unknown=0, NotChecked=0, Total=8556 [2019-12-27 23:19:59,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-12-27 23:19:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 367. [2019-12-27 23:19:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-12-27 23:19:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 811 transitions. [2019-12-27 23:19:59,682 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 811 transitions. Word has length 30 [2019-12-27 23:19:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:19:59,683 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 811 transitions. [2019-12-27 23:19:59,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 23:19:59,683 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 811 transitions. [2019-12-27 23:19:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:19:59,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:19:59,684 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:19:59,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:19:59,888 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 23:19:59,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:19:59,888 INFO L82 PathProgramCache]: Analyzing trace with hash 946363378, now seen corresponding path program 5 times [2019-12-27 23:19:59,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:19:59,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645006944] [2019-12-27 23:19:59,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:19:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:20:00,476 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 37 [2019-12-27 23:20:01,154 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2019-12-27 23:20:01,439 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2019-12-27 23:20:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:20:02,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645006944] [2019-12-27 23:20:02,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389068730] [2019-12-27 23:20:02,222 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:20:02,306 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 23:20:02,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:20:02,308 WARN L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 113 conjunts are in the unsatisfiable core [2019-12-27 23:20:02,311 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:20:02,323 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 23:20:02,323 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 23:20:02,355 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 23:20:02,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:02,361 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 23:20:02,361 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:02,388 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:02,389 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 23:20:02,389 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 23:20:02,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:02,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:02,984 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:20:03,012 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:03,012 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 23:20:03,013 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:03,072 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 23:20:03,073 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 23:20:03,073 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-27 23:20:03,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:03,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:03,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,282 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 23:20:03,283 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:03,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,309 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 23:20:03,309 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:03,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,317 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 23:20:03,317 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:03,343 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:03,343 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 23:20:03,344 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-27 23:20:03,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:03,784 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:20:03,828 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:03,829 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 23:20:03,830 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:03,904 INFO L614 ElimStorePlain]: treesize reduction 72, result has 47.1 percent of original size [2019-12-27 23:20:03,905 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 23:20:03,905 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:55 [2019-12-27 23:20:04,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:04,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:04,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:04,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:04,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:04,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:04,037 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 23:20:04,038 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:04,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:04,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:04,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:04,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:04,073 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 23:20:04,073 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:04,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:04,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:04,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:04,081 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 23:20:04,081 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:04,105 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:04,106 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 23:20:04,106 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-27 23:20:04,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:04,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:04,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:04,420 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:04,420 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 23:20:04,422 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:04,485 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-27 23:20:04,485 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 23:20:04,486 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:49 [2019-12-27 23:20:04,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:04,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:04,633 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 23:20:04,634 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:04,668 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 23:20:04,669 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:04,677 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 23:20:04,678 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:04,738 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-27 23:20:04,739 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 23:20:04,739 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:212, output treesize:46 [2019-12-27 23:20:07,067 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:07,068 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 23:20:07,068 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:07,076 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:07,077 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 23:20:07,077 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:7 [2019-12-27 23:20:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:20:07,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:20:07,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 46 [2019-12-27 23:20:07,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1250941318] [2019-12-27 23:20:07,118 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:20:07,123 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:20:07,145 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 120 transitions. [2019-12-27 23:20:07,145 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:20:09,114 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 37 times. [2019-12-27 23:20:09,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-12-27 23:20:09,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:20:09,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-12-27 23:20:09,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=4137, Unknown=4, NotChecked=0, Total=4422 [2019-12-27 23:20:09,116 INFO L87 Difference]: Start difference. First operand 367 states and 811 transitions. Second operand 47 states. [2019-12-27 23:20:11,772 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-12-27 23:20:12,788 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-12-27 23:20:13,191 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-12-27 23:20:13,637 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-12-27 23:20:13,884 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-12-27 23:20:14,655 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-12-27 23:20:15,052 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-12-27 23:20:15,741 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-12-27 23:20:16,442 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-12-27 23:20:16,699 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-12-27 23:20:17,351 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-12-27 23:20:17,568 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-12-27 23:20:17,854 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-12-27 23:20:18,507 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2019-12-27 23:20:18,781 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-12-27 23:20:19,061 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-12-27 23:20:19,478 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-12-27 23:20:19,756 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-12-27 23:20:20,241 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-12-27 23:20:20,963 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-12-27 23:20:21,479 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-12-27 23:20:22,196 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-12-27 23:20:22,911 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-12-27 23:20:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:20:24,460 INFO L93 Difference]: Finished difference Result 459 states and 1015 transitions. [2019-12-27 23:20:24,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-27 23:20:24,460 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2019-12-27 23:20:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:20:24,464 INFO L225 Difference]: With dead ends: 459 [2019-12-27 23:20:24,465 INFO L226 Difference]: Without dead ends: 459 [2019-12-27 23:20:24,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5728 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=1465, Invalid=16891, Unknown=4, NotChecked=0, Total=18360 [2019-12-27 23:20:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-27 23:20:24,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 397. [2019-12-27 23:20:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-12-27 23:20:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 888 transitions. [2019-12-27 23:20:24,482 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 888 transitions. Word has length 32 [2019-12-27 23:20:24,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:20:24,482 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 888 transitions. [2019-12-27 23:20:24,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-12-27 23:20:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 888 transitions. [2019-12-27 23:20:24,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:20:24,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:20:24,485 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 23:20:24,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:20:24,689 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 23:20:24,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:20:24,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1745587444, now seen corresponding path program 6 times [2019-12-27 23:20:24,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:20:24,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216699031] [2019-12-27 23:20:24,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:20:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:20:25,455 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 37 [2019-12-27 23:20:25,853 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-12-27 23:20:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:20:26,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216699031] [2019-12-27 23:20:26,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549631755] [2019-12-27 23:20:26,528 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:20:26,615 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 23:20:26,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:20:26,617 WARN L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 125 conjunts are in the unsatisfiable core [2019-12-27 23:20:26,620 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:20:26,627 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 23:20:26,628 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 23:20:26,652 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 23:20:26,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:26,655 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 23:20:26,656 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:26,668 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:26,669 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 23:20:26,669 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 23:20:27,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:27,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:27,218 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:20:27,245 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:27,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, 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 23:20:27,246 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:27,308 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-27 23:20:27,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 23:20:27,309 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 23:20:27,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:27,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:27,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:27,494 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:20:27,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:27,497 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 23:20:27,498 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:27,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:27,515 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:20:27,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:27,518 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 23:20:27,518 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:27,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:27,524 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 23:20:27,525 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:27,542 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:27,542 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 23:20:27,542 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-27 23:20:27,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:27,801 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:27,801 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 23:20:27,802 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:27,851 INFO L614 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-12-27 23:20:27,852 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 23:20:27,852 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:49 [2019-12-27 23:20:28,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:28,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:28,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, 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 23:20:28,048 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:28,077 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 23:20:28,078 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:28,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, 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 23:20:28,087 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:28,150 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-27 23:20:28,151 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 23:20:28,151 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:212, output treesize:46 [2019-12-27 23:20:28,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:28,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:28,564 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:20:28,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:28,607 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:28,608 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 79 treesize of output 118 [2019-12-27 23:20:28,609 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:28,639 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:20:28,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:28,679 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:28,679 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 91 treesize of output 128 [2019-12-27 23:20:28,680 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:28,713 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:28,714 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 78 treesize of output 117 [2019-12-27 23:20:28,715 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:28,778 INFO L614 ElimStorePlain]: treesize reduction 40, result has 57.9 percent of original size [2019-12-27 23:20:28,779 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 23:20:28,779 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:288, output treesize:55 [2019-12-27 23:20:28,997 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:28,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 62 [2019-12-27 23:20:28,998 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:29,005 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:29,005 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 23:20:29,006 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:7 [2019-12-27 23:20:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:20:29,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:20:29,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 43 [2019-12-27 23:20:29,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [542193453] [2019-12-27 23:20:29,107 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:20:29,112 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:20:29,128 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 92 transitions. [2019-12-27 23:20:29,129 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:20:30,199 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 23:20:30,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 23:20:30,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:20:30,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 23:20:30,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3017, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 23:20:30,200 INFO L87 Difference]: Start difference. First operand 397 states and 888 transitions. Second operand 36 states. [2019-12-27 23:20:32,073 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-12-27 23:20:33,854 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-12-27 23:20:35,115 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-27 23:20:35,488 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 58 [2019-12-27 23:20:35,998 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-12-27 23:20:36,374 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2019-12-27 23:20:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:20:38,247 INFO L93 Difference]: Finished difference Result 503 states and 1115 transitions. [2019-12-27 23:20:38,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 23:20:38,247 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 32 [2019-12-27 23:20:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:20:38,251 INFO L225 Difference]: With dead ends: 503 [2019-12-27 23:20:38,252 INFO L226 Difference]: Without dead ends: 503 [2019-12-27 23:20:38,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2048 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=517, Invalid=7315, Unknown=0, NotChecked=0, Total=7832 [2019-12-27 23:20:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-12-27 23:20:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 472. [2019-12-27 23:20:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-12-27 23:20:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1050 transitions. [2019-12-27 23:20:38,262 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1050 transitions. Word has length 32 [2019-12-27 23:20:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:20:38,262 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 1050 transitions. [2019-12-27 23:20:38,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 23:20:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1050 transitions. [2019-12-27 23:20:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:20:38,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:20:38,264 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 23:20:38,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:20:38,468 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 23:20:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:20:38,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1798140568, now seen corresponding path program 7 times [2019-12-27 23:20:38,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:20:38,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603971098] [2019-12-27 23:20:38,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:20:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:20:39,208 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2019-12-27 23:20:39,384 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2019-12-27 23:20:39,524 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-12-27 23:20:39,677 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-12-27 23:20:39,847 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 44 [2019-12-27 23:20:39,996 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2019-12-27 23:20:40,178 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-12-27 23:20:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:20:41,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603971098] [2019-12-27 23:20:41,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546277296] [2019-12-27 23:20:41,264 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:20:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:20:41,349 WARN L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 110 conjunts are in the unsatisfiable core [2019-12-27 23:20:41,351 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:20:41,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:41,365 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-27 23:20:41,365 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 23:20:41,365 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:41,375 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:41,375 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 23:20:41,376 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:27 [2019-12-27 23:20:41,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:41,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:41,534 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:20:41,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:41,559 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 46 treesize of output 79 [2019-12-27 23:20:41,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:41,560 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:41,625 INFO L614 ElimStorePlain]: treesize reduction 47, result has 54.8 percent of original size [2019-12-27 23:20:41,626 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 23:20:41,626 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:48 [2019-12-27 23:20:41,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:41,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:41,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:41,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:41,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 37 [2019-12-27 23:20:41,736 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:41,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:41,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:41,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 36 [2019-12-27 23:20:41,749 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:41,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:41,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 45 [2019-12-27 23:20:41,756 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:41,777 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:41,777 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 23:20:41,778 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:248, output treesize:42 [2019-12-27 23:20:41,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:41,987 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:41,988 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 2 case distinctions, treesize of input 46 treesize of output 79 [2019-12-27 23:20:41,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:41,989 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:42,043 INFO L614 ElimStorePlain]: treesize reduction 47, result has 52.0 percent of original size [2019-12-27 23:20:42,044 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 23:20:42,044 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:54 [2019-12-27 23:20:42,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:42,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:42,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:42,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:42,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:42,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:20:42,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:42,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 63 [2019-12-27 23:20:42,403 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 23:20:42,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:42,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:42,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:42,414 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:20:42,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:42,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 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 55 [2019-12-27 23:20:42,423 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 23:20:42,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:42,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:42,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:20:42,432 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 80 treesize of output 54 [2019-12-27 23:20:42,433 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 23:20:42,523 INFO L614 ElimStorePlain]: treesize reduction 155, result has 29.9 percent of original size [2019-12-27 23:20:42,523 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 23:20:42,523 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:291, output treesize:66 [2019-12-27 23:20:42,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:42,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:42,694 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 57 treesize of output 47 [2019-12-27 23:20:42,695 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:42,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 55 treesize of output 45 [2019-12-27 23:20:42,720 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:42,729 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 55 treesize of output 45 [2019-12-27 23:20:42,730 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:42,825 INFO L614 ElimStorePlain]: treesize reduction 133, result has 28.1 percent of original size [2019-12-27 23:20:42,826 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 23:20:42,826 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:230, output treesize:52 [2019-12-27 23:20:43,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:20:43,123 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 52 treesize of output 55 [2019-12-27 23:20:43,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:20:43,124 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:20:43,154 INFO L614 ElimStorePlain]: treesize reduction 54, result has 26.0 percent of original size [2019-12-27 23:20:43,154 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 23:20:43,155 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:10 [2019-12-27 23:20:43,276 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:20:43,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:20:43,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 41 [2019-12-27 23:20:43,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1494830753] [2019-12-27 23:20:43,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:20:43,284 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:20:43,310 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 100 transitions. [2019-12-27 23:20:43,310 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:20:45,278 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 31 times. [2019-12-27 23:20:45,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-27 23:20:45,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:20:45,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-27 23:20:45,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3436, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 23:20:45,280 INFO L87 Difference]: Start difference. First operand 472 states and 1050 transitions. Second operand 46 states. [2019-12-27 23:20:46,698 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2019-12-27 23:20:47,097 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-12-27 23:20:47,668 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 35 [2019-12-27 23:20:47,873 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-12-27 23:20:48,159 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 43 [2019-12-27 23:20:48,511 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-12-27 23:20:48,735 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-12-27 23:20:49,030 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 50 [2019-12-27 23:20:49,472 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-12-27 23:20:49,725 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-12-27 23:20:50,164 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2019-12-27 23:20:50,619 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-12-27 23:20:50,811 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-12-27 23:20:51,235 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2019-12-27 23:20:51,472 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-27 23:20:51,965 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2019-12-27 23:20:52,150 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-12-27 23:20:52,632 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-12-27 23:20:53,053 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73 [2019-12-27 23:20:53,646 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 67 [2019-12-27 23:20:54,085 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2019-12-27 23:20:54,599 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-12-27 23:20:55,069 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 68 [2019-12-27 23:20:55,699 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 59 [2019-12-27 23:20:56,367 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 67 [2019-12-27 23:20:56,823 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 58 [2019-12-27 23:20:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:20:59,083 INFO L93 Difference]: Finished difference Result 555 states and 1233 transitions. [2019-12-27 23:20:59,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 23:20:59,084 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 32 [2019-12-27 23:20:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:20:59,088 INFO L225 Difference]: With dead ends: 555 [2019-12-27 23:20:59,088 INFO L226 Difference]: Without dead ends: 555 [2019-12-27 23:20:59,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2832 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=974, Invalid=9126, Unknown=0, NotChecked=0, Total=10100 [2019-12-27 23:20:59,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-27 23:20:59,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 485. [2019-12-27 23:20:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-12-27 23:20:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1078 transitions. [2019-12-27 23:20:59,099 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1078 transitions. Word has length 32 [2019-12-27 23:20:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:20:59,100 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 1078 transitions. [2019-12-27 23:20:59,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-12-27 23:20:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1078 transitions. [2019-12-27 23:20:59,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:20:59,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:20:59,101 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 23:20:59,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:20:59,304 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 23:20:59,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:20:59,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1195329808, now seen corresponding path program 8 times [2019-12-27 23:20:59,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:20:59,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748800494] [2019-12-27 23:20:59,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:20:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:21:00,157 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 38 [2019-12-27 23:21:00,593 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2019-12-27 23:21:00,856 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-12-27 23:21:01,048 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 43 [2019-12-27 23:21:01,214 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 39 [2019-12-27 23:21:01,423 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 45 [2019-12-27 23:21:01,735 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2019-12-27 23:21:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:21:02,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748800494] [2019-12-27 23:21:02,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405561528] [2019-12-27 23:21:02,235 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:21:02,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:21:02,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:21:02,329 WARN L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 114 conjunts are in the unsatisfiable core [2019-12-27 23:21:02,330 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:21:02,345 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 23:21:02,345 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-27 23:21:02,373 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-27 23:21:02,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:02,383 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 23:21:02,383 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:02,396 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:02,397 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 23:21:02,397 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 23:21:02,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:02,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:02,947 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:02,972 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:02,973 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 23:21:02,974 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:03,041 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-27 23:21:03,042 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 23:21:03,042 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 23:21:03,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:03,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:03,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,219 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:03,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,223 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 23:21:03,223 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:03,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,250 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:03,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,253 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 23:21:03,254 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:03,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,261 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 23:21:03,262 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:03,280 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:03,281 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 23:21:03,281 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-27 23:21:03,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,519 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:03,520 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 23:21:03,521 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:03,569 INFO L614 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-12-27 23:21:03,570 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 23:21:03,570 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:49 [2019-12-27 23:21:03,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:03,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:03,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,852 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:03,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,859 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 75 treesize of output 64 [2019-12-27 23:21:03,860 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:03,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,887 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:03,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,894 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 63 treesize of output 56 [2019-12-27 23:21:03,894 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:03,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:03,903 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 62 treesize of output 55 [2019-12-27 23:21:03,903 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:03,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:03,925 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 23:21:03,925 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:249, output treesize:49 [2019-12-27 23:21:04,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:04,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:04,158 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 23:21:04,159 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:04,179 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 23:21:04,180 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:04,190 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 23:21:04,190 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:04,245 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-27 23:21:04,246 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 23:21:04,247 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:212, output treesize:46 [2019-12-27 23:21:04,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:04,577 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:04,578 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 23:21:04,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:04,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:04,586 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 23:21:04,586 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:7 [2019-12-27 23:21:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:21:04,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:21:04,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 45 [2019-12-27 23:21:04,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1264671128] [2019-12-27 23:21:04,703 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:21:04,708 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:21:04,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 88 transitions. [2019-12-27 23:21:04,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:21:05,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 23:21:05,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-27 23:21:05,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:21:05,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-27 23:21:05,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=3125, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 23:21:05,810 INFO L87 Difference]: Start difference. First operand 485 states and 1078 transitions. Second operand 38 states. [2019-12-27 23:21:06,929 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-12-27 23:21:07,469 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-12-27 23:21:07,953 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-12-27 23:21:09,339 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-12-27 23:21:09,824 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-12-27 23:21:10,263 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-12-27 23:21:10,540 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-12-27 23:21:10,904 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-12-27 23:21:11,413 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 68 [2019-12-27 23:21:11,646 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2019-12-27 23:21:11,965 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 57 [2019-12-27 23:21:12,214 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-27 23:21:12,595 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 74 [2019-12-27 23:21:12,856 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2019-12-27 23:21:13,139 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2019-12-27 23:21:13,419 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 58 [2019-12-27 23:21:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:21:14,895 INFO L93 Difference]: Finished difference Result 612 states and 1362 transitions. [2019-12-27 23:21:14,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:21:14,895 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 32 [2019-12-27 23:21:14,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:21:14,900 INFO L225 Difference]: With dead ends: 612 [2019-12-27 23:21:14,900 INFO L226 Difference]: Without dead ends: 612 [2019-12-27 23:21:14,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2482 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=629, Invalid=8113, Unknown=0, NotChecked=0, Total=8742 [2019-12-27 23:21:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-12-27 23:21:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 478. [2019-12-27 23:21:14,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-12-27 23:21:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1062 transitions. [2019-12-27 23:21:14,909 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1062 transitions. Word has length 32 [2019-12-27 23:21:14,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:21:14,909 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 1062 transitions. [2019-12-27 23:21:14,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-27 23:21:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1062 transitions. [2019-12-27 23:21:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:21:14,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:21:14,911 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 23:21:15,114 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:21:15,114 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 23:21:15,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:21:15,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1618560836, now seen corresponding path program 9 times [2019-12-27 23:21:15,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:21:15,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293338329] [2019-12-27 23:21:15,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:21:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:21:15,697 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 36 [2019-12-27 23:21:15,880 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-12-27 23:21:16,356 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 43 [2019-12-27 23:21:16,544 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2019-12-27 23:21:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:21:17,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293338329] [2019-12-27 23:21:17,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017584627] [2019-12-27 23:21:17,119 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 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 23:21:17,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:21:17,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:21:17,216 WARN L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 135 conjunts are in the unsatisfiable core [2019-12-27 23:21:17,218 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:21:17,238 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 23:21:17,239 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:17,257 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 23:21:17,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:17,263 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 23:21:17,263 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:17,274 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:17,275 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 23:21:17,275 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-27 23:21:17,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:17,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:17,812 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:17,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:17,838 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 23:21:17,839 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:17,905 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-27 23:21:17,905 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 23:21:17,906 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-27 23:21:18,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:18,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:18,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:18,060 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:18,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:18,062 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 23:21:18,063 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:18,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:18,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:18,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:18,087 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 23:21:18,088 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:18,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:18,094 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 23:21:18,094 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:18,118 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:18,118 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 23:21:18,118 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-27 23:21:18,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:18,699 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:18,699 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 23:21:18,700 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:18,759 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 23:21:18,760 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 23:21:18,760 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-27 23:21:18,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:18,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:18,995 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 23:21:18,995 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:19,020 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 23:21:19,021 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:19,034 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 23:21:19,034 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:19,114 INFO L614 ElimStorePlain]: treesize reduction 133, result has 28.1 percent of original size [2019-12-27 23:21:19,114 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 23:21:19,115 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:230, output treesize:52 [2019-12-27 23:21:19,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:19,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:19,330 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:19,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:19,338 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 63 treesize of output 56 [2019-12-27 23:21:19,339 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:19,359 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:19,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:19,366 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 75 treesize of output 64 [2019-12-27 23:21:19,367 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:19,372 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 62 treesize of output 55 [2019-12-27 23:21:19,372 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:19,391 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:19,392 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 23:21:19,392 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:240, output treesize:46 [2019-12-27 23:21:19,582 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:19,583 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 23:21:19,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:19,590 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:19,591 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 23:21:19,591 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:7 [2019-12-27 23:21:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:21:19,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:21:19,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2019-12-27 23:21:19,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [775393909] [2019-12-27 23:21:19,700 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:21:19,705 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:21:19,723 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 112 transitions. [2019-12-27 23:21:19,723 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:21:21,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 23:21:21,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-27 23:21:21,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:21:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-27 23:21:21,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=3713, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 23:21:21,923 INFO L87 Difference]: Start difference. First operand 478 states and 1062 transitions. Second operand 41 states. [2019-12-27 23:21:25,775 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 42 [2019-12-27 23:21:26,013 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-12-27 23:21:26,399 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-12-27 23:21:26,834 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 51 [2019-12-27 23:21:27,082 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-12-27 23:21:27,555 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2019-12-27 23:21:27,963 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2019-12-27 23:21:28,268 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 50 [2019-12-27 23:21:28,685 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 62 [2019-12-27 23:21:29,147 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2019-12-27 23:21:29,440 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 67 [2019-12-27 23:21:29,903 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 71 [2019-12-27 23:21:30,214 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 60 [2019-12-27 23:21:30,703 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 74 [2019-12-27 23:21:31,063 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 63 [2019-12-27 23:21:31,316 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-12-27 23:21:31,840 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-12-27 23:21:32,070 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-27 23:21:32,558 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-12-27 23:21:33,501 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-12-27 23:21:33,945 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-12-27 23:21:34,331 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-12-27 23:21:34,659 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-12-27 23:21:35,788 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-12-27 23:21:36,002 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-12-27 23:21:36,178 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-12-27 23:21:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:21:36,199 INFO L93 Difference]: Finished difference Result 622 states and 1318 transitions. [2019-12-27 23:21:36,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 23:21:36,200 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 32 [2019-12-27 23:21:36,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:21:36,204 INFO L225 Difference]: With dead ends: 622 [2019-12-27 23:21:36,204 INFO L226 Difference]: Without dead ends: 622 [2019-12-27 23:21:36,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3263 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=749, Invalid=11241, Unknown=0, NotChecked=0, Total=11990 [2019-12-27 23:21:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-12-27 23:21:36,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 475. [2019-12-27 23:21:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-12-27 23:21:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1054 transitions. [2019-12-27 23:21:36,215 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1054 transitions. Word has length 32 [2019-12-27 23:21:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:21:36,215 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 1054 transitions. [2019-12-27 23:21:36,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-27 23:21:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1054 transitions. [2019-12-27 23:21:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 23:21:36,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:21:36,217 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-27 23:21:36,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:21:36,421 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 23:21:36,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:21:36,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1158332264, now seen corresponding path program 10 times [2019-12-27 23:21:36,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:21:36,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020384355] [2019-12-27 23:21:36,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:21:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:21:37,054 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2019-12-27 23:21:37,240 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-12-27 23:21:37,455 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2019-12-27 23:21:37,618 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2019-12-27 23:21:37,900 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2019-12-27 23:21:38,271 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-12-27 23:21:38,543 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-12-27 23:21:38,708 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-12-27 23:21:38,945 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2019-12-27 23:21:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:21:39,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020384355] [2019-12-27 23:21:39,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135027928] [2019-12-27 23:21:39,647 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 23:21:39,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:21:39,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:21:39,742 WARN L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 129 conjunts are in the unsatisfiable core [2019-12-27 23:21:39,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:21:39,759 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 23:21:39,759 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:39,780 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-27 23:21:39,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:39,785 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 23:21:39,785 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:39,794 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:39,795 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 23:21:39,795 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-27 23:21:40,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:40,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:40,448 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:40,473 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:40,474 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 23:21:40,474 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:40,538 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-27 23:21:40,538 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 23:21:40,539 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:49 [2019-12-27 23:21:40,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:40,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:40,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:40,740 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:40,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:40,746 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 23:21:40,747 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:40,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:40,764 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:40,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:40,770 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 23:21:40,770 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:40,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:40,776 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 23:21:40,776 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:40,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:40,796 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 23:21:40,796 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:251, output treesize:43 [2019-12-27 23:21:41,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:41,162 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:41,162 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 23:21:41,163 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:41,220 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-27 23:21:41,221 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 23:21:41,221 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-27 23:21:41,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:41,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:41,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:41,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:41,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:41,558 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:41,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:41,572 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 84 treesize of output 67 [2019-12-27 23:21:41,572 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:41,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:41,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:41,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:41,593 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-27 23:21:41,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:41,602 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 72 treesize of output 59 [2019-12-27 23:21:41,603 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:41,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:41,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:41,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-27 23:21:41,615 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 58 [2019-12-27 23:21:41,615 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:41,650 INFO L614 ElimStorePlain]: treesize reduction 4, result has 93.1 percent of original size [2019-12-27 23:21:41,651 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 23:21:41,651 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:276, output treesize:54 [2019-12-27 23:21:41,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:41,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:21:41,774 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:41,774 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 58 [2019-12-27 23:21:41,775 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:41,805 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:41,806 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 56 [2019-12-27 23:21:41,806 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:41,820 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:41,821 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 56 [2019-12-27 23:21:41,821 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:41,879 INFO L614 ElimStorePlain]: treesize reduction 141, result has 23.0 percent of original size [2019-12-27 23:21:41,879 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 23:21:41,880 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:200, output treesize:42 [2019-12-27 23:21:42,112 INFO L343 Elim1Store]: treesize reduction 12, result has 73.3 percent of original size [2019-12-27 23:21:42,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 59 [2019-12-27 23:21:42,114 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 23:21:42,120 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 23:21:42,120 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 23:21:42,120 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:7 [2019-12-27 23:21:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:21:42,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:21:42,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20] total 45 [2019-12-27 23:21:42,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16366078] [2019-12-27 23:21:42,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:21:42,249 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:21:42,293 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 116 transitions. [2019-12-27 23:21:42,294 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:21:42,612 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-12-27 23:21:46,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 23:21:46,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-12-27 23:21:46,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:21:46,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-12-27 23:21:46,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 23:21:46,715 INFO L87 Difference]: Start difference. First operand 475 states and 1054 transitions. Second operand 50 states. [2019-12-27 23:21:50,126 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 47 [2019-12-27 23:21:50,890 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 64 [2019-12-27 23:21:51,088 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-27 23:21:51,744 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 57 [2019-12-27 23:21:52,292 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 66 [2019-12-27 23:21:52,558 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 54 [2019-12-27 23:21:52,799 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-12-27 23:21:53,430 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 69 [2019-12-27 23:21:54,015 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 61 [2019-12-27 23:21:54,355 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-12-27 23:21:54,928 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 71 [2019-12-27 23:21:55,345 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-12-27 23:21:55,828 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 79 [2019-12-27 23:21:56,275 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 63 [2019-12-27 23:21:56,576 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 70 [2019-12-27 23:21:57,153 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 54 [2019-12-27 23:21:58,108 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 91 [2019-12-27 23:21:58,524 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 56 [2019-12-27 23:21:59,229 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 83 [2019-12-27 23:22:00,101 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-12-27 23:22:00,556 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 63 [2019-12-27 23:22:01,341 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 68 [2019-12-27 23:22:01,993 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 61 [2019-12-27 23:22:02,790 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 78 Received shutdown request... [2019-12-27 23:22:03,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 23:22:03,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:22:03,425 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 23:22:03,432 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 23:22:03,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:22:03 BasicIcfg [2019-12-27 23:22:03,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:22:03,434 INFO L168 Benchmark]: Toolchain (without parser) took 250122.94 ms. Allocated memory was 137.4 MB in the beginning and 511.2 MB in the end (delta: 373.8 MB). Free memory was 100.5 MB in the beginning and 462.2 MB in the end (delta: -361.7 MB). Peak memory consumption was 333.4 MB. Max. memory is 7.1 GB. [2019-12-27 23:22:03,434 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 23:22:03,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.04 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 148.3 MB in the end (delta: -48.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:22:03,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.06 ms. Allocated memory is still 202.4 MB. Free memory was 148.3 MB in the beginning and 145.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:22:03,435 INFO L168 Benchmark]: Boogie Preprocessor took 44.13 ms. Allocated memory is still 202.4 MB. Free memory was 145.4 MB in the beginning and 144.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-27 23:22:03,435 INFO L168 Benchmark]: RCFGBuilder took 646.29 ms. Allocated memory is still 202.4 MB. Free memory was 144.0 MB in the beginning and 113.7 MB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. [2019-12-27 23:22:03,435 INFO L168 Benchmark]: TraceAbstraction took 248606.74 ms. Allocated memory was 202.4 MB in the beginning and 511.2 MB in the end (delta: 308.8 MB). Free memory was 113.7 MB in the beginning and 462.2 MB in the end (delta: -348.4 MB). Peak memory consumption was 281.6 MB. Max. memory is 7.1 GB. [2019-12-27 23:22:03,436 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.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 750.04 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 148.3 MB in the end (delta: -48.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.06 ms. Allocated memory is still 202.4 MB. Free memory was 148.3 MB in the beginning and 145.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.13 ms. Allocated memory is still 202.4 MB. Free memory was 145.4 MB in the beginning and 144.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 646.29 ms. Allocated memory is still 202.4 MB. Free memory was 144.0 MB in the beginning and 113.7 MB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248606.74 ms. Allocated memory was 202.4 MB in the beginning and 511.2 MB in the end (delta: 308.8 MB). Free memory was 113.7 MB in the beginning and 462.2 MB in the end (delta: -348.4 MB). Peak memory consumption was 281.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 122 ProgramPointsBefore, 30 ProgramPointsAfterwards, 128 TransitionsBefore, 34 TransitionsAfterwards, 4968 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 3 ChoiceCompositions, 2658 VarBasedMoverChecksPositive, 43 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5914 CheckedPairsTotal, 112 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 (475states) and FLOYD_HOARE automaton (currently 44 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 108 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 (475states) and FLOYD_HOARE automaton (currently 44 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 108 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 (475states) and FLOYD_HOARE automaton (currently 44 states, 50 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 108 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 3 error locations. Result: TIMEOUT, OverallTime: 248.4s, OverallIterations: 20, TraceHistogramMax: 3, AutomataDifference: 156.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 510 SDtfs, 3533 SDslu, 5057 SDs, 0 SdLazy, 45544 SolverSat, 1647 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1820 GetRequests, 327 SyntacticMatches, 49 SemanticMatches, 1443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39334 ImplicationChecksByTransitivity, 166.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=485occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 993 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 58.0s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 892 ConstructedInterpolants, 348 QuantifiedInterpolants, 1112051 SizeOfPredicates, 676 NumberOfNonLiveVariables, 2733 ConjunctsInSsa, 1600 ConjunctsInUnsatCore, 35 InterpolantComputations, 5 PerfectInterpolantSequences, 18/354 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